/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/test-easy11.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:49:17,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:49:17,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:49:17,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:49:17,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:49:17,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:49:17,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:49:17,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:49:17,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:49:17,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:49:17,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:49:17,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:49:17,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:49:17,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:49:17,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:49:17,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:49:17,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:49:17,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:49:17,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:49:17,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:49:17,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:49:17,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:49:17,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:49:17,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:49:17,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:49:17,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:49:17,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:49:17,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:49:17,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:49:17,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:49:17,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:49:17,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:49:17,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:49:17,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:49:17,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:49:17,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:49:17,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:49:17,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:49:17,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:49:17,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:49:17,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:49:17,774 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:49:17,804 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:49:17,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:49:17,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:49:17,805 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:49:17,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:49:17,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:49:17,806 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:49:17,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:49:17,806 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:49:17,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:49:17,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:49:17,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:49:17,807 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:49:17,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:49:17,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:49:17,807 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:49:17,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:49:17,807 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:49:17,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:49:17,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:49:17,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:49:17,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:49:17,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:49:17,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:49:17,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:49:17,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:49:17,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:49:17,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:49:17,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:49:17,808 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:49:17,808 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:49:17,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:49:17,808 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 19:49:17,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:49:17,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:49:17,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:49:17,994 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:49:17,999 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:49:17,999 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c [2022-03-15 19:49:18,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a898179/80233f9356f24becbf6e3f708ff29961/FLAGb56a918e9 [2022-03-15 19:49:18,393 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:49:18,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c [2022-03-15 19:49:18,398 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a898179/80233f9356f24becbf6e3f708ff29961/FLAGb56a918e9 [2022-03-15 19:49:18,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a898179/80233f9356f24becbf6e3f708ff29961 [2022-03-15 19:49:18,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:49:18,413 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:49:18,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:49:18,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:49:18,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:49:18,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:49:18" (1/1) ... [2022-03-15 19:49:18,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b307ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:18, skipping insertion in model container [2022-03-15 19:49:18,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:49:18" (1/1) ... [2022-03-15 19:49:18,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:49:18,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:49:18,567 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/test-easy11.wvr.c[2005,2018] [2022-03-15 19:49:18,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:49:18,574 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:49:18,585 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/test-easy11.wvr.c[2005,2018] [2022-03-15 19:49:18,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:49:18,593 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:49:18,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:18 WrapperNode [2022-03-15 19:49:18,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:49:18,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:49:18,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:49:18,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:49:18,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:18" (1/1) ... [2022-03-15 19:49:18,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:18" (1/1) ... [2022-03-15 19:49:18,619 INFO L137 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2022-03-15 19:49:18,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:49:18,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:49:18,620 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:49:18,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:49:18,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:18" (1/1) ... [2022-03-15 19:49:18,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:18" (1/1) ... [2022-03-15 19:49:18,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:18" (1/1) ... [2022-03-15 19:49:18,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:18" (1/1) ... [2022-03-15 19:49:18,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:18" (1/1) ... [2022-03-15 19:49:18,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:18" (1/1) ... [2022-03-15 19:49:18,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:18" (1/1) ... [2022-03-15 19:49:18,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:49:18,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:49:18,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:49:18,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:49:18,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:18" (1/1) ... [2022-03-15 19:49:18,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:49:18,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:18,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 19:49:18,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 19:49:18,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:49:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:49:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:49:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:49:18,701 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:49:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:49:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:49:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:49:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:49:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:49:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:49:18,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:49:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:49:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:49:18,703 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:49:18,771 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:49:18,772 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:49:18,913 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:49:18,918 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:49:18,918 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 19:49:18,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:49:18 BoogieIcfgContainer [2022-03-15 19:49:18,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:49:18,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:49:18,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:49:18,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:49:18,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:49:18" (1/3) ... [2022-03-15 19:49:18,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc717bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:49:18, skipping insertion in model container [2022-03-15 19:49:18,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:49:18" (2/3) ... [2022-03-15 19:49:18,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc717bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:49:18, skipping insertion in model container [2022-03-15 19:49:18,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:49:18" (3/3) ... [2022-03-15 19:49:18,924 INFO L111 eAbstractionObserver]: Analyzing ICFG test-easy11.wvr.c [2022-03-15 19:49:18,927 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:49:18,927 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:49:18,928 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:49:18,928 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:49:18,946 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,946 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,947 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,947 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,947 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,947 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,947 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,948 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,948 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,948 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,948 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,948 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,948 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,948 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,948 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,949 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,949 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,949 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,950 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,950 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,950 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,950 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,950 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,950 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,951 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,951 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,951 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,951 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,951 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,951 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,952 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,952 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,953 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,953 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,955 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,956 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~x~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,956 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,957 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,958 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,958 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:49:18,960 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 19:49:18,987 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:49:18,992 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:49:18,992 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 19:49:19,000 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:49:19,005 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 87 transitions, 190 flow [2022-03-15 19:49:19,007 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 87 transitions, 190 flow [2022-03-15 19:49:19,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 87 transitions, 190 flow [2022-03-15 19:49:19,062 INFO L129 PetriNetUnfolder]: 6/85 cut-off events. [2022-03-15 19:49:19,062 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 19:49:19,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 85 events. 6/85 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2022-03-15 19:49:19,066 INFO L116 LiptonReduction]: Number of co-enabled transitions 572 [2022-03-15 19:49:20,765 INFO L131 LiptonReduction]: Checked pairs total: 606 [2022-03-15 19:49:20,766 INFO L133 LiptonReduction]: Total number of compositions: 80 [2022-03-15 19:49:20,775 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 18 transitions, 52 flow [2022-03-15 19:49:20,785 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:20,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 19:49:20,790 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:20,791 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:20,791 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:20,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:20,794 INFO L85 PathProgramCache]: Analyzing trace with hash -262329212, now seen corresponding path program 1 times [2022-03-15 19:49:20,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:20,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625255530] [2022-03-15 19:49:20,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:20,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:21,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:21,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625255530] [2022-03-15 19:49:21,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625255530] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:49:21,048 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:49:21,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:49:21,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2018974400] [2022-03-15 19:49:21,049 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:21,052 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:21,064 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 47 transitions. [2022-03-15 19:49:21,064 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:21,452 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [169#(and (or (<= (+ ~Y~0 (* 2 ~X~0)) 20000) (< ~X~0 10000)) (or (<= 10000 (+ ~Y~0 ~X~0)) (< ~X~0 10000))), 166#(and (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 10000 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0))) (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 20000))), 168#(and (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 10000 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0))) (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= (+ ~Y~0 ~X~0 thread1Thread1of1ForFork1_~x~0) 20000))), 167#(and (or (<= 10000 (+ ~Y~0 ~X~0)) (< ~X~0 10000)) (or (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 20000) (< ~X~0 10000)))] [2022-03-15 19:49:21,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:49:21,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:21,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:49:21,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:49:21,471 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 2.212121212121212) internal successors, (73), 33 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:21,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:21,705 INFO L93 Difference]: Finished difference Result 45 states and 97 transitions. [2022-03-15 19:49:21,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:49:21,707 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 19:49:21,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:21,712 INFO L225 Difference]: With dead ends: 45 [2022-03-15 19:49:21,712 INFO L226 Difference]: Without dead ends: 40 [2022-03-15 19:49:21,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:49:21,715 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:21,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:49:21,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-15 19:49:21,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-03-15 19:49:21,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.282051282051282) internal successors, (89), 39 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:21,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 89 transitions. [2022-03-15 19:49:21,736 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 89 transitions. Word has length 13 [2022-03-15 19:49:21,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:21,736 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 89 transitions. [2022-03-15 19:49:21,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:21,737 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 89 transitions. [2022-03-15 19:49:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 19:49:21,737 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:21,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:21,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:49:21,738 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:21,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2100744972, now seen corresponding path program 2 times [2022-03-15 19:49:21,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:21,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527161804] [2022-03-15 19:49:21,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:21,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:21,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:21,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527161804] [2022-03-15 19:49:21,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527161804] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:49:21,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:49:21,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:49:21,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [885260202] [2022-03-15 19:49:21,809 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:21,810 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:21,812 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 35 transitions. [2022-03-15 19:49:21,812 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:21,906 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [312#(and (<= 10000 ~Y~0) (<= (+ ~Y~0 ~X~0) 20000)), 313#(and (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 20000) (= ~Y~0 0))] [2022-03-15 19:49:21,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:49:21,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:49:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:49:21,908 INFO L87 Difference]: Start difference. First operand 40 states and 89 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:22,059 INFO L93 Difference]: Finished difference Result 47 states and 98 transitions. [2022-03-15 19:49:22,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:49:22,059 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 19:49:22,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:22,060 INFO L225 Difference]: With dead ends: 47 [2022-03-15 19:49:22,060 INFO L226 Difference]: Without dead ends: 42 [2022-03-15 19:49:22,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-03-15 19:49:22,061 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:22,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:49:22,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-15 19:49:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-03-15 19:49:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 41 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 92 transitions. [2022-03-15 19:49:22,065 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 92 transitions. Word has length 13 [2022-03-15 19:49:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:22,065 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 92 transitions. [2022-03-15 19:49:22,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 92 transitions. [2022-03-15 19:49:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 19:49:22,066 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:22,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:22,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:49:22,066 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:22,067 INFO L85 PathProgramCache]: Analyzing trace with hash 458276627, now seen corresponding path program 1 times [2022-03-15 19:49:22,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:22,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794459107] [2022-03-15 19:49:22,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:22,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:22,112 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 19:49:22,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:22,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794459107] [2022-03-15 19:49:22,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794459107] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:49:22,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:49:22,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:49:22,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [940036305] [2022-03-15 19:49:22,113 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:22,114 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:22,117 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 64 transitions. [2022-03-15 19:49:22,117 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:22,303 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [460#(< thread1Thread1of1ForFork1_~x~0 10000), 461#(or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 10000 thread2Thread1of1ForFork0_~x~1)), 462#(< ~X~0 10000), 463#(or (<= 10000 thread2Thread1of1ForFork0_~x~1) (< ~X~0 10000)), 464#(or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 10000 ~X~0))] [2022-03-15 19:49:22,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:49:22,303 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:22,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:49:22,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:49:22,304 INFO L87 Difference]: Start difference. First operand 42 states and 92 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:22,505 INFO L93 Difference]: Finished difference Result 86 states and 189 transitions. [2022-03-15 19:49:22,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:49:22,506 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 19:49:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:22,507 INFO L225 Difference]: With dead ends: 86 [2022-03-15 19:49:22,507 INFO L226 Difference]: Without dead ends: 76 [2022-03-15 19:49:22,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:49:22,508 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:22,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:49:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-03-15 19:49:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 48. [2022-03-15 19:49:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.297872340425532) internal successors, (108), 47 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 108 transitions. [2022-03-15 19:49:22,513 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 108 transitions. Word has length 14 [2022-03-15 19:49:22,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:22,513 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 108 transitions. [2022-03-15 19:49:22,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:22,513 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 108 transitions. [2022-03-15 19:49:22,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 19:49:22,514 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:22,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:22,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:49:22,514 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:22,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1821416402, now seen corresponding path program 1 times [2022-03-15 19:49:22,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:22,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343648673] [2022-03-15 19:49:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:22,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:22,544 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 19:49:22,545 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:22,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343648673] [2022-03-15 19:49:22,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343648673] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:22,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993712963] [2022-03-15 19:49:22,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:22,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:22,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:22,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:22,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 19:49:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:22,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 19:49:22,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:22,642 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 19:49:22,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:22,700 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 19:49:22,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993712963] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:22,700 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:49:22,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2022-03-15 19:49:22,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1014415520] [2022-03-15 19:49:22,700 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:22,701 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:22,704 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 59 transitions. [2022-03-15 19:49:22,704 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:22,882 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [754#(or (<= thread2Thread1of1ForFork0_~x~1 9999) (not (< ~X~0 10000))), 753#(<= ~X~0 9999)] [2022-03-15 19:49:22,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:49:22,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:22,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:49:22,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:49:22,884 INFO L87 Difference]: Start difference. First operand 48 states and 108 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:22,984 INFO L93 Difference]: Finished difference Result 84 states and 173 transitions. [2022-03-15 19:49:22,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:49:22,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 19:49:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:22,988 INFO L225 Difference]: With dead ends: 84 [2022-03-15 19:49:22,988 INFO L226 Difference]: Without dead ends: 84 [2022-03-15 19:49:22,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:49:22,991 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:22,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:49:22,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-03-15 19:49:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 52. [2022-03-15 19:49:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 120 transitions. [2022-03-15 19:49:23,004 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 120 transitions. Word has length 14 [2022-03-15 19:49:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:23,004 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 120 transitions. [2022-03-15 19:49:23,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 120 transitions. [2022-03-15 19:49:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 19:49:23,005 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:23,005 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:23,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:23,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:23,222 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:23,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:23,222 INFO L85 PathProgramCache]: Analyzing trace with hash -797144054, now seen corresponding path program 2 times [2022-03-15 19:49:23,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:23,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148840395] [2022-03-15 19:49:23,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:23,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:23,267 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 19:49:23,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:23,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148840395] [2022-03-15 19:49:23,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148840395] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:49:23,268 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:49:23,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 19:49:23,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1123479368] [2022-03-15 19:49:23,268 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:23,269 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:23,271 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 52 transitions. [2022-03-15 19:49:23,271 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:23,363 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [957#(< thread2Thread1of1ForFork0_~x~1 10000), 960#(<= thread2Thread1of1ForFork0_~x~1 ~X~0), 959#(<= 10000 ~X~0), 958#(< ~X~0 10000)] [2022-03-15 19:49:23,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:49:23,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:23,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:49:23,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:49:23,364 INFO L87 Difference]: Start difference. First operand 52 states and 120 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:23,543 INFO L93 Difference]: Finished difference Result 66 states and 140 transitions. [2022-03-15 19:49:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 19:49:23,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 19:49:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:23,544 INFO L225 Difference]: With dead ends: 66 [2022-03-15 19:49:23,544 INFO L226 Difference]: Without dead ends: 62 [2022-03-15 19:49:23,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:49:23,545 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:23,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:49:23,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-03-15 19:49:23,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2022-03-15 19:49:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.2745098039215685) internal successors, (116), 51 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 116 transitions. [2022-03-15 19:49:23,548 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 116 transitions. Word has length 14 [2022-03-15 19:49:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:23,548 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 116 transitions. [2022-03-15 19:49:23,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 116 transitions. [2022-03-15 19:49:23,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:49:23,549 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:23,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:23,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 19:49:23,549 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:23,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:23,550 INFO L85 PathProgramCache]: Analyzing trace with hash 460108493, now seen corresponding path program 1 times [2022-03-15 19:49:23,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:23,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974637147] [2022-03-15 19:49:23,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:23,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:23,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:23,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974637147] [2022-03-15 19:49:23,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974637147] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:23,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311451053] [2022-03-15 19:49:23,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:23,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:23,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:23,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:23,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 19:49:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:23,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:49:23,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:23,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:24,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311451053] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:24,026 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:24,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 19:49:24,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1788577391] [2022-03-15 19:49:24,026 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:24,037 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:24,041 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 81 transitions. [2022-03-15 19:49:24,041 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:24,765 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [1259#(and (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19999) (< thread1Thread1of1ForFork1_~x~0 9999)) (or (<= 9999 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0)) (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999))), 1257#(and (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 10000 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0))) (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 20000))), 1264#(and (or (not (< ~X~0 10000)) (<= 9999 (+ ~Y~0 ~X~0)) (< ~X~0 9999)) (or (not (< ~X~0 10000)) (< ~X~0 9999) (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 19998))), 1262#(and (or (<= (+ ~Y~0 ~X~0 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999)) (or (<= 9999 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0)) (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999))), 1263#(and (or (not (< ~X~0 10000)) (<= 9999 (+ ~Y~0 ~X~0)) (< ~X~0 9999)) (or (not (< ~X~0 10000)) (< ~X~0 9999) (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 19999))), 1260#(and (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998) (< thread1Thread1of1ForFork1_~x~0 9999)) (or (<= 9999 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0)) (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999))), 1265#(and (or (not (< ~X~0 10000)) (<= 9999 (+ ~Y~0 ~X~0)) (< ~X~0 9999)) (or (not (< ~X~0 10000)) (<= (+ ~Y~0 (* 2 ~X~0)) 19998) (< ~X~0 9999))), 1258#(and (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 10000 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0))) (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19999))), 1261#(and (or (<= (+ ~Y~0 ~X~0 thread1Thread1of1ForFork1_~x~0) 19999) (< thread1Thread1of1ForFork1_~x~0 10000)) (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 10000 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0))))] [2022-03-15 19:49:24,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:49:24,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:24,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:49:24,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:49:24,766 INFO L87 Difference]: Start difference. First operand 52 states and 116 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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 19:49:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:25,558 INFO L93 Difference]: Finished difference Result 97 states and 224 transitions. [2022-03-15 19:49:25,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:49:25,558 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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 15 [2022-03-15 19:49:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:25,559 INFO L225 Difference]: With dead ends: 97 [2022-03-15 19:49:25,559 INFO L226 Difference]: Without dead ends: 92 [2022-03-15 19:49:25,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=340, Invalid=1822, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:49:25,560 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:25,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:49:25,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-03-15 19:49:25,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 66. [2022-03-15 19:49:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.523076923076923) internal successors, (164), 65 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 164 transitions. [2022-03-15 19:49:25,563 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 164 transitions. Word has length 15 [2022-03-15 19:49:25,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:25,564 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 164 transitions. [2022-03-15 19:49:25,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 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 19:49:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 164 transitions. [2022-03-15 19:49:25,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:49:25,564 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:25,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:25,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:25,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-15 19:49:25,776 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:25,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:25,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1464606803, now seen corresponding path program 2 times [2022-03-15 19:49:25,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:25,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968242441] [2022-03-15 19:49:25,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:25,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:25,841 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:25,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968242441] [2022-03-15 19:49:25,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968242441] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:25,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750754221] [2022-03-15 19:49:25,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:49:25,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:25,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:25,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:25,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 19:49:25,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:49:25,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:25,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:49:25,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:25,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:26,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 19:49:26,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750754221] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:26,179 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:26,179 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 19:49:26,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [966809815] [2022-03-15 19:49:26,179 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:26,180 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:26,183 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 65 transitions. [2022-03-15 19:49:26,183 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:26,607 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [1643#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19998))), 1639#(and (or (not (< ~X~0 10000)) (<= (+ ~Y~0 ~X~0) 19999)) (or (not (< ~X~0 10000)) (<= 10000 ~Y~0))), 1641#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 1640#(and (or (not (< ~X~0 10000)) (= ~Y~0 0)) (or (not (< ~X~0 10000)) (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 19999))), 1638#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 1642#(and (or (not (< ~X~0 10000)) (= ~Y~0 0)) (or (not (< ~X~0 10000)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19998))), 1644#(or (not (< ~X~0 10000)) (= ~Y~0 0)), 1637#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= 10000 ~Y~0)))] [2022-03-15 19:49:26,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:49:26,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:26,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:49:26,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:49:26,609 INFO L87 Difference]: Start difference. First operand 66 states and 164 transitions. Second operand has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:27,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:27,164 INFO L93 Difference]: Finished difference Result 79 states and 190 transitions. [2022-03-15 19:49:27,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 19:49:27,165 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 19:49:27,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:27,165 INFO L225 Difference]: With dead ends: 79 [2022-03-15 19:49:27,166 INFO L226 Difference]: Without dead ends: 74 [2022-03-15 19:49:27,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=340, Invalid=1640, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:49:27,167 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:27,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:49:27,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-03-15 19:49:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2022-03-15 19:49:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.4927536231884058) internal successors, (172), 69 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 172 transitions. [2022-03-15 19:49:27,170 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 172 transitions. Word has length 15 [2022-03-15 19:49:27,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:27,170 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 172 transitions. [2022-03-15 19:49:27,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 172 transitions. [2022-03-15 19:49:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:49:27,171 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:27,171 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:27,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 19:49:27,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:27,388 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:27,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1379009002, now seen corresponding path program 3 times [2022-03-15 19:49:27,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:27,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431560524] [2022-03-15 19:49:27,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:27,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:27,432 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:27,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431560524] [2022-03-15 19:49:27,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431560524] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:27,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155070411] [2022-03-15 19:49:27,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:49:27,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:27,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:27,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:27,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 19:49:27,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:49:27,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:27,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:49:27,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:27,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:27,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155070411] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:27,542 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:27,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 19:49:27,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1392703849] [2022-03-15 19:49:27,542 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:27,543 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:27,547 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 103 transitions. [2022-03-15 19:49:27,547 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:27,918 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [2007#(or (<= 9999 thread2Thread1of1ForFork0_~x~1) (<= 10000 thread1Thread1of1ForFork1_~x~0) (< thread1Thread1of1ForFork1_~x~0 9999)), 2001#(< thread1Thread1of1ForFork1_~x~0 10000), 2008#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= 9999 ~X~0) (< thread1Thread1of1ForFork1_~x~0 9999)), 2006#(or (<= 10000 thread2Thread1of1ForFork0_~x~1) (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999)), 2009#(or (not (< ~X~0 10000)) (<= 10000 thread2Thread1of1ForFork0_~x~1) (< ~X~0 9999)), 2003#(or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 9999 thread2Thread1of1ForFork0_~x~1)), 2010#(or (<= 9999 thread2Thread1of1ForFork0_~x~1) (< ~X~0 9999) (<= 10000 ~X~0)), 2002#(or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 10000 thread2Thread1of1ForFork0_~x~1)), 2004#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999)), 2005#(or (not (< ~X~0 10000)) (< ~X~0 9999)), 1987#(or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 9999 ~X~0))] [2022-03-15 19:49:27,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:49:27,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:27,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:49:27,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:49:27,919 INFO L87 Difference]: Start difference. First operand 70 states and 172 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:28,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:28,426 INFO L93 Difference]: Finished difference Result 158 states and 380 transitions. [2022-03-15 19:49:28,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:49:28,426 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 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 16 [2022-03-15 19:49:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:28,427 INFO L225 Difference]: With dead ends: 158 [2022-03-15 19:49:28,427 INFO L226 Difference]: Without dead ends: 144 [2022-03-15 19:49:28,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=458, Invalid=1348, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:49:28,428 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:28,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:49:28,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-03-15 19:49:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 82. [2022-03-15 19:49:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.5308641975308643) internal successors, (205), 81 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 205 transitions. [2022-03-15 19:49:28,432 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 205 transitions. Word has length 16 [2022-03-15 19:49:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:28,432 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 205 transitions. [2022-03-15 19:49:28,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 205 transitions. [2022-03-15 19:49:28,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:49:28,433 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:28,433 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:28,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:28,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:28,650 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:28,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2065475287, now seen corresponding path program 4 times [2022-03-15 19:49:28,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:28,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360179025] [2022-03-15 19:49:28,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:28,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:28,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:28,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360179025] [2022-03-15 19:49:28,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360179025] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:28,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262623138] [2022-03-15 19:49:28,683 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:49:28,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:28,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:28,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:28,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 19:49:28,724 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:49:28,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:28,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:49:28,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:28,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:28,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262623138] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:28,799 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:28,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-03-15 19:49:28,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [679951906] [2022-03-15 19:49:28,799 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:28,800 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:28,804 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 98 transitions. [2022-03-15 19:49:28,804 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:29,052 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [2505#(or (<= thread2Thread1of1ForFork0_~x~1 9999) (< thread1Thread1of1ForFork1_~x~0 10000)), 2506#(or (<= thread2Thread1of1ForFork0_~x~1 9999) (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999)), 2509#(<= ~X~0 9998), 2510#(<= (+ ~X~0 1) thread1Thread1of1ForFork1_~x~0), 2507#(or (<= thread2Thread1of1ForFork0_~x~1 9999) (< thread1Thread1of1ForFork1_~x~0 9998) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 2508#(or (<= thread2Thread1of1ForFork0_~x~1 9999) (< ~X~0 9998) (<= 9999 ~X~0)), 2511#(<= thread2Thread1of1ForFork0_~x~1 ~X~0)] [2022-03-15 19:49:29,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:49:29,053 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:29,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:49:29,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-03-15 19:49:29,053 INFO L87 Difference]: Start difference. First operand 82 states and 205 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:29,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:29,490 INFO L93 Difference]: Finished difference Result 216 states and 479 transitions. [2022-03-15 19:49:29,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:49:29,490 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 19:49:29,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:29,491 INFO L225 Difference]: With dead ends: 216 [2022-03-15 19:49:29,491 INFO L226 Difference]: Without dead ends: 216 [2022-03-15 19:49:29,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:49:29,492 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:29,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:49:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-03-15 19:49:29,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 96. [2022-03-15 19:49:29,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.7578947368421054) internal successors, (262), 95 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 262 transitions. [2022-03-15 19:49:29,498 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 262 transitions. Word has length 16 [2022-03-15 19:49:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:29,498 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 262 transitions. [2022-03-15 19:49:29,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 262 transitions. [2022-03-15 19:49:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:49:29,501 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:29,501 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:29,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:29,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:29,711 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:29,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:29,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1014885991, now seen corresponding path program 5 times [2022-03-15 19:49:29,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:29,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264720022] [2022-03-15 19:49:29,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:29,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:29,763 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:29,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264720022] [2022-03-15 19:49:29,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264720022] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:29,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500331490] [2022-03-15 19:49:29,763 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:49:29,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:29,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:29,764 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:29,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 19:49:29,804 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:49:29,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:29,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:49:29,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:29,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:29,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:29,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500331490] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:29,873 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:29,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2022-03-15 19:49:29,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1977226101] [2022-03-15 19:49:29,875 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:29,876 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:29,878 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 87 transitions. [2022-03-15 19:49:29,878 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:30,161 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [3085#(or (not (< ~X~0 10000)) (<= (+ ~X~0 1) thread1Thread1of1ForFork1_~x~0)), 3077#(<= 10000 thread1Thread1of1ForFork1_~x~0), 3080#(<= thread2Thread1of1ForFork0_~x~1 (+ ~X~0 1)), 3081#(<= thread2Thread1of1ForFork0_~x~1 ~X~0), 3082#(or (not (< thread2Thread1of1ForFork0_~x~1 10000)) (<= thread2Thread1of1ForFork0_~x~1 9998)), 3083#(or (<= (+ thread2Thread1of1ForFork0_~x~1 1) thread1Thread1of1ForFork1_~x~0) (not (< thread2Thread1of1ForFork0_~x~1 10000))), 3084#(or (not (< ~X~0 10000)) (<= ~X~0 9998)), 3078#(<= 9999 thread1Thread1of1ForFork1_~x~0), 3079#(<= 9999 ~X~0)] [2022-03-15 19:49:30,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:49:30,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:49:30,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:49:30,162 INFO L87 Difference]: Start difference. First operand 96 states and 262 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 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 19:49:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:31,226 INFO L93 Difference]: Finished difference Result 210 states and 508 transitions. [2022-03-15 19:49:31,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 19:49:31,227 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 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 16 [2022-03-15 19:49:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:31,228 INFO L225 Difference]: With dead ends: 210 [2022-03-15 19:49:31,228 INFO L226 Difference]: Without dead ends: 198 [2022-03-15 19:49:31,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 85 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=927, Invalid=2733, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:49:31,229 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:31,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:49:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-03-15 19:49:31,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 92. [2022-03-15 19:49:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.5494505494505493) internal successors, (232), 91 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 232 transitions. [2022-03-15 19:49:31,233 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 232 transitions. Word has length 16 [2022-03-15 19:49:31,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:31,233 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 232 transitions. [2022-03-15 19:49:31,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 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 19:49:31,233 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 232 transitions. [2022-03-15 19:49:31,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:49:31,233 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:31,233 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:31,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:31,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:31,450 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:31,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:31,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1155535068, now seen corresponding path program 6 times [2022-03-15 19:49:31,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:31,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264329078] [2022-03-15 19:49:31,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:31,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:31,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:31,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264329078] [2022-03-15 19:49:31,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264329078] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:31,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162635875] [2022-03-15 19:49:31,527 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:49:31,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:31,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:31,552 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:31,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 19:49:31,595 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:49:31,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:31,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:49:31,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:31,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:31,966 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 19:49:31,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162635875] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:31,966 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:31,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-03-15 19:49:31,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [408323843] [2022-03-15 19:49:31,967 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:31,968 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:31,971 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 125 transitions. [2022-03-15 19:49:31,971 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:33,194 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [3727#(and (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998)) (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 10000 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0)))), 3740#(and (or (< ~X~0 9998) (not (< ~X~0 9999)) (<= 9998 (+ ~Y~0 ~X~0))) (or (<= (+ ~Y~0 (* 2 ~X~0)) 19996) (< ~X~0 9998) (not (< ~X~0 9999)))), 3737#(and (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996) (< thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (< thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= 9998 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0)))), 3725#(and (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 10000 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0))) (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 20000))), 3738#(and (or (< ~X~0 9998) (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 19996) (not (< ~X~0 9999))) (or (< ~X~0 9998) (not (< ~X~0 9999)) (<= 9998 (+ ~Y~0 ~X~0)))), 3736#(and (or (< ~X~0 9998) (not (< ~X~0 9999)) (<= 9998 (+ ~Y~0 ~X~0))) (or (< ~X~0 9998) (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 19997) (not (< ~X~0 9999)))), 3734#(and (or (< thread1Thread1of1ForFork1_~x~0 9998) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (< thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= 9998 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0)))), 3728#(and (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19999) (< thread1Thread1of1ForFork1_~x~0 9999)) (or (<= 9999 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0)) (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999))), 3726#(and (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 10000 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0))) (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19999))), 3735#(and (or (< ~X~0 9998) (not (< ~X~0 9999)) (<= 9998 (+ ~Y~0 ~X~0))) (or (< ~X~0 9998) (not (< ~X~0 9999)) (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 19998))), 3730#(and (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999)) (or (<= 9999 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0)) (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999))), 3732#(and (or (<= (+ ~Y~0 ~X~0 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999)) (or (<= 9999 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0)) (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999))), 3731#(and (or (<= (+ ~Y~0 ~X~0 thread1Thread1of1ForFork1_~x~0) 19998) (< thread1Thread1of1ForFork1_~x~0 10000)) (or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 10000 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0)))), 3739#(and (or (< thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~Y~0 ~X~0 thread1Thread1of1ForFork1_~x~0) 19996)) (or (< thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= 9998 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0)))), 3733#(and (or (< thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998)) (or (< thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= 9998 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0)))), 3729#(and (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998) (< thread1Thread1of1ForFork1_~x~0 9999)) (or (<= 9999 (+ ~Y~0 thread1Thread1of1ForFork1_~x~0)) (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999)))] [2022-03-15 19:49:33,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:49:33,195 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:33,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:49:33,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1338, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:49:33,196 INFO L87 Difference]: Start difference. First operand 92 states and 232 transitions. Second operand has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:35,671 INFO L93 Difference]: Finished difference Result 227 states and 584 transitions. [2022-03-15 19:49:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 19:49:35,671 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 19:49:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:35,672 INFO L225 Difference]: With dead ends: 227 [2022-03-15 19:49:35,672 INFO L226 Difference]: Without dead ends: 222 [2022-03-15 19:49:35,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2545 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1256, Invalid=6934, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 19:49:35,674 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:35,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:49:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-03-15 19:49:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 116. [2022-03-15 19:49:35,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.7217391304347824) internal successors, (313), 115 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 313 transitions. [2022-03-15 19:49:35,681 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 313 transitions. Word has length 17 [2022-03-15 19:49:35,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:35,682 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 313 transitions. [2022-03-15 19:49:35,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:35,682 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 313 transitions. [2022-03-15 19:49:35,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:49:35,683 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:35,683 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:35,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:35,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:35,895 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:35,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:35,896 INFO L85 PathProgramCache]: Analyzing trace with hash 2079953492, now seen corresponding path program 7 times [2022-03-15 19:49:35,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:35,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625987474] [2022-03-15 19:49:35,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:35,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:35,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:35,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625987474] [2022-03-15 19:49:35,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625987474] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:35,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030377077] [2022-03-15 19:49:35,975 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:49:35,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:35,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:35,976 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:35,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 19:49:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:36,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:49:36,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:36,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:36,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:36,346 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 19:49:36,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030377077] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:36,346 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:36,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2022-03-15 19:49:36,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [197057120] [2022-03-15 19:49:36,347 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:36,348 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:36,351 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 105 transitions. [2022-03-15 19:49:36,351 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:37,097 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [4436#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19996)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 4424#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 4423#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= 10000 ~Y~0))), 4433#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19997))), 4431#(and (or (not (< ~X~0 9999)) (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 19998)) (or (not (< ~X~0 9999)) (= ~Y~0 0))), 4434#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 4437#(or (not (< ~X~0 9999)) (= ~Y~0 0)), 4430#(and (or (not (< ~X~0 9999)) (<= 10000 ~Y~0)) (or (not (< ~X~0 9999)) (<= (+ ~Y~0 ~X~0) 19998))), 4435#(and (or (not (< ~X~0 9999)) (= ~Y~0 0)) (or (not (< ~X~0 9999)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19996))), 4427#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= 10000 ~Y~0))), 4428#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 4429#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 4432#(and (or (not (< ~X~0 9999)) (= ~Y~0 0)) (or (not (< ~X~0 9999)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19997))), 4425#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 4426#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 10000))))] [2022-03-15 19:49:37,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:49:37,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:37,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:49:37,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1227, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:49:37,098 INFO L87 Difference]: Start difference. First operand 116 states and 313 transitions. Second operand has 26 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:38,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:38,807 INFO L93 Difference]: Finished difference Result 173 states and 475 transitions. [2022-03-15 19:49:38,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 19:49:38,807 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 19:49:38,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:38,808 INFO L225 Difference]: With dead ends: 173 [2022-03-15 19:49:38,808 INFO L226 Difference]: Without dead ends: 166 [2022-03-15 19:49:38,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2308 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1251, Invalid=6059, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 19:49:38,810 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:38,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:49:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-03-15 19:49:38,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 114. [2022-03-15 19:49:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.6371681415929205) internal successors, (298), 113 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 298 transitions. [2022-03-15 19:49:38,814 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 298 transitions. Word has length 17 [2022-03-15 19:49:38,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:38,814 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 298 transitions. [2022-03-15 19:49:38,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 298 transitions. [2022-03-15 19:49:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:49:38,814 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:38,814 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:38,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:39,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-15 19:49:39,027 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:39,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:39,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1461301133, now seen corresponding path program 8 times [2022-03-15 19:49:39,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:39,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662194436] [2022-03-15 19:49:39,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:39,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:39,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:39,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662194436] [2022-03-15 19:49:39,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662194436] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:39,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335739687] [2022-03-15 19:49:39,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:49:39,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:39,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:39,080 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:39,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:49:39,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:49:39,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:39,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:49:39,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:39,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:39,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335739687] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:39,209 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:39,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-03-15 19:49:39,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [204463036] [2022-03-15 19:49:39,210 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:39,211 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:39,215 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 152 transitions. [2022-03-15 19:49:39,215 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:39,798 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [5062#(or (< thread1Thread1of1ForFork1_~x~0 9998) (<= 9998 ~X~0) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 5031#(or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 9998 ~X~0)), 5059#(or (< thread1Thread1of1ForFork1_~x~0 9998) (<= 9999 thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 5061#(or (<= 9998 ~X~0) (<= 10000 thread1Thread1of1ForFork1_~x~0) (< thread1Thread1of1ForFork1_~x~0 9999)), 5064#(or (< ~X~0 9998) (<= 10000 thread2Thread1of1ForFork0_~x~1) (<= 9999 ~X~0)), 5057#(or (< thread1Thread1of1ForFork1_~x~0 9998) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 5055#(or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 9998 thread2Thread1of1ForFork0_~x~1)), 5058#(or (< thread1Thread1of1ForFork1_~x~0 9998) (<= 10000 thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 5066#(or (< ~X~0 9998) (<= 9999 ~X~0) (<= 9998 thread2Thread1of1ForFork0_~x~1)), 5049#(< thread1Thread1of1ForFork1_~x~0 10000), 5050#(or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 10000 thread2Thread1of1ForFork0_~x~1)), 5065#(or (< ~X~0 9998) (<= 9999 thread2Thread1of1ForFork0_~x~1) (<= 9999 ~X~0)), 5063#(or (< ~X~0 9998) (<= 9999 ~X~0)), 5051#(or (< thread1Thread1of1ForFork1_~x~0 10000) (<= 9999 thread2Thread1of1ForFork0_~x~1)), 5054#(or (<= 9999 thread2Thread1of1ForFork0_~x~1) (<= 10000 thread1Thread1of1ForFork1_~x~0) (< thread1Thread1of1ForFork1_~x~0 9999)), 5052#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999)), 5053#(or (<= 10000 thread2Thread1of1ForFork0_~x~1) (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999)), 5060#(or (< thread1Thread1of1ForFork1_~x~0 9998) (<= 9998 thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 5056#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (< thread1Thread1of1ForFork1_~x~0 9999) (<= 9998 thread2Thread1of1ForFork0_~x~1))] [2022-03-15 19:49:39,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 19:49:39,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:39,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 19:49:39,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2022-03-15 19:49:39,799 INFO L87 Difference]: Start difference. First operand 114 states and 298 transitions. Second operand has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:40,779 INFO L93 Difference]: Finished difference Result 272 states and 689 transitions. [2022-03-15 19:49:40,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 19:49:40,779 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 19:49:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:40,780 INFO L225 Difference]: With dead ends: 272 [2022-03-15 19:49:40,780 INFO L226 Difference]: Without dead ends: 252 [2022-03-15 19:49:40,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1172, Invalid=3940, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:49:40,782 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 181 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:40,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 0 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:49:40,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-03-15 19:49:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 136. [2022-03-15 19:49:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.651851851851852) internal successors, (358), 135 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 358 transitions. [2022-03-15 19:49:40,788 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 358 transitions. Word has length 18 [2022-03-15 19:49:40,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:40,788 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 358 transitions. [2022-03-15 19:49:40,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 358 transitions. [2022-03-15 19:49:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:49:40,789 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:40,789 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:40,808 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:49:41,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 19:49:41,003 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:41,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash 527167474, now seen corresponding path program 9 times [2022-03-15 19:49:41,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:41,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759352187] [2022-03-15 19:49:41,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:41,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:41,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:41,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759352187] [2022-03-15 19:49:41,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759352187] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:41,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836592966] [2022-03-15 19:49:41,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:49:41,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:41,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:41,044 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:41,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 19:49:41,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:49:41,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:41,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:49:41,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 19:49:41,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 19:49:41,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836592966] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:49:41,166 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 19:49:41,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2022-03-15 19:49:41,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [594907080] [2022-03-15 19:49:41,167 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:41,168 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:41,172 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 147 transitions. [2022-03-15 19:49:41,172 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:42,182 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [5805#(and (or (< thread1Thread1of1ForFork1_~x~0 9997) (not (< thread1Thread1of1ForFork1_~x~0 9998)) (not (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 9997))) (or (< thread1Thread1of1ForFork1_~x~0 9997) (not (< thread1Thread1of1ForFork1_~x~0 9998)) (< thread2Thread1of1ForFork0_~x~1 10001)) (or (< thread1Thread1of1ForFork1_~x~0 9997) (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 9998) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 5802#(and (or (< thread1Thread1of1ForFork1_~x~0 10000) (< thread2Thread1of1ForFork0_~x~1 10001)) (or (< thread1Thread1of1ForFork1_~x~0 10000) (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 10001)) (or (< thread1Thread1of1ForFork1_~x~0 10000) (not (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 10000)))), 5806#(and (or (< thread1Thread1of1ForFork1_~x~0 10000) (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 10001)) (or (< thread1Thread1of1ForFork1_~x~0 10000) (not (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 10000)))), 5803#(and (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (not (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 9999)) (< thread1Thread1of1ForFork1_~x~0 9999)) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999) (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 10000)) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread2Thread1of1ForFork0_~x~1 10001) (< thread1Thread1of1ForFork1_~x~0 9999))), 5808#(and (or (< thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 9999)) (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 9999)) (or (< thread1Thread1of1ForFork1_~x~0 9998) (not (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 9998)) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 5807#(and (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (not (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 9999)) (< thread1Thread1of1ForFork1_~x~0 9999)) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (< thread1Thread1of1ForFork1_~x~0 9999) (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 10000))), 5810#(and (<= 0 ~Y~0) (< thread2Thread1of1ForFork0_~x~1 10001) (<= ~Y~0 0)), 5804#(and (or (< thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 9999)) (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 9999)) (or (< thread1Thread1of1ForFork1_~x~0 9998) (not (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 9998)) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (< thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 9999)) (< thread2Thread1of1ForFork0_~x~1 10001))), 5809#(and (or (< thread1Thread1of1ForFork1_~x~0 9997) (not (< thread1Thread1of1ForFork1_~x~0 9998)) (not (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 9997))) (or (< thread1Thread1of1ForFork1_~x~0 9997) (< (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 9998) (not (< thread1Thread1of1ForFork1_~x~0 9998))))] [2022-03-15 19:49:42,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:49:42,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:42,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:49:42,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:49:42,183 INFO L87 Difference]: Start difference. First operand 136 states and 358 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:42,467 INFO L93 Difference]: Finished difference Result 149 states and 381 transitions. [2022-03-15 19:49:42,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:49:42,468 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 15 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 18 [2022-03-15 19:49:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:42,468 INFO L225 Difference]: With dead ends: 149 [2022-03-15 19:49:42,469 INFO L226 Difference]: Without dead ends: 118 [2022-03-15 19:49:42,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 14 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:49:42,469 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:42,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:49:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-03-15 19:49:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2022-03-15 19:49:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.504424778761062) internal successors, (283), 113 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 283 transitions. [2022-03-15 19:49:42,472 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 283 transitions. Word has length 18 [2022-03-15 19:49:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:42,472 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 283 transitions. [2022-03-15 19:49:42,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 283 transitions. [2022-03-15 19:49:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:49:42,473 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:42,473 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:42,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:42,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 19:49:42,679 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:42,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:42,680 INFO L85 PathProgramCache]: Analyzing trace with hash -121492314, now seen corresponding path program 10 times [2022-03-15 19:49:42,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:42,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193757088] [2022-03-15 19:49:42,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:42,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:42,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:42,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193757088] [2022-03-15 19:49:42,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193757088] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:42,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736259940] [2022-03-15 19:49:42,719 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:49:42,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:42,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:42,720 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:42,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 19:49:42,761 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:49:42,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:42,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:49:42,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:42,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:42,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736259940] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:42,864 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:42,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 19:49:42,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [305328171] [2022-03-15 19:49:42,864 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:42,865 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:42,869 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 132 transitions. [2022-03-15 19:49:42,869 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:43,262 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [6318#(<= 9999 thread1Thread1of1ForFork1_~x~0), 6317#(or (<= thread2Thread1of1ForFork0_~x~1 9999) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 6313#(<= ~X~0 9997), 6324#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 6326#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 6328#(<= thread2Thread1of1ForFork0_~x~1 ~X~0), 6320#(<= 9998 thread1Thread1of1ForFork1_~x~0), 6322#(<= 9998 ~X~0), 6325#(or (<= thread2Thread1of1ForFork0_~x~1 9998) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 6323#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9998 ~X~0)), 6327#(or (<= 9998 ~X~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 6315#(<= (+ ~X~0 1) thread1Thread1of1ForFork1_~x~0), 6319#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 6321#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 6314#(<= (+ 2 ~X~0) thread1Thread1of1ForFork1_~x~0), 6316#(<= 10000 thread1Thread1of1ForFork1_~x~0)] [2022-03-15 19:49:43,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:49:43,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:49:43,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:49:43,264 INFO L87 Difference]: Start difference. First operand 114 states and 283 transitions. Second operand has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:44,136 INFO L93 Difference]: Finished difference Result 278 states and 679 transitions. [2022-03-15 19:49:44,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 19:49:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 19:49:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:44,138 INFO L225 Difference]: With dead ends: 278 [2022-03-15 19:49:44,138 INFO L226 Difference]: Without dead ends: 256 [2022-03-15 19:49:44,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1765 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1398, Invalid=4764, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 19:49:44,140 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:44,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:49:44,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-03-15 19:49:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 150. [2022-03-15 19:49:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.5704697986577183) internal successors, (383), 149 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 383 transitions. [2022-03-15 19:49:44,145 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 383 transitions. Word has length 18 [2022-03-15 19:49:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:44,145 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 383 transitions. [2022-03-15 19:49:44,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 383 transitions. [2022-03-15 19:49:44,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:49:44,145 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:44,145 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:44,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:44,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 19:49:44,359 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:44,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:44,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1765014003, now seen corresponding path program 11 times [2022-03-15 19:49:44,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:44,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336045995] [2022-03-15 19:49:44,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:44,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:44,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:44,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336045995] [2022-03-15 19:49:44,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336045995] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:44,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783847188] [2022-03-15 19:49:44,468 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:49:44,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:44,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:44,469 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:44,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:49:44,517 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:49:44,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:44,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:49:44,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:49:44,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:49:44,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783847188] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:44,695 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:44,695 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 17 [2022-03-15 19:49:44,695 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1891110641] [2022-03-15 19:49:44,695 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:44,696 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:44,700 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 155 transitions. [2022-03-15 19:49:44,700 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:45,878 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [7197#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 7189#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 7193#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 7190#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 7199#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19996))), 7204#(and (or (not (< ~X~0 9998)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19996)) (or (not (< ~X~0 9998)) (= ~Y~0 0))), 7191#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 7187#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 7195#(and (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 7185#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= 10000 ~Y~0))), 7200#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19995))), 7188#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 7194#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= 10000 ~Y~0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19997))), 7192#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 7203#(and (or (not (< ~X~0 9998)) (= ~Y~0 0)) (or (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 19997) (not (< ~X~0 9998)))), 7207#(or (not (< ~X~0 9998)) (= ~Y~0 0)), 7201#(and (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 7205#(and (or (not (< ~X~0 9998)) (= ~Y~0 0)) (or (not (< ~X~0 9998)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19995))), 7186#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 7184#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= 10000 ~Y~0))), 7196#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 7206#(and (or (not (< ~X~0 9998)) (= ~Y~0 0)) (or (not (< ~X~0 9998)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19994))), 7198#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 7202#(and (or (not (< ~X~0 9998)) (<= (+ ~Y~0 ~X~0) 19997)) (or (not (< ~X~0 9998)) (<= 10000 ~Y~0)))] [2022-03-15 19:49:45,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:49:45,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:45,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:49:45,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1614, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:49:45,880 INFO L87 Difference]: Start difference. First operand 150 states and 383 transitions. Second operand has 37 states, 36 states have (on average 2.8055555555555554) internal successors, (101), 36 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:49,959 INFO L93 Difference]: Finished difference Result 435 states and 1099 transitions. [2022-03-15 19:49:49,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-03-15 19:49:49,959 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.8055555555555554) internal successors, (101), 36 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:49:49,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:49,961 INFO L225 Difference]: With dead ends: 435 [2022-03-15 19:49:49,961 INFO L226 Difference]: Without dead ends: 428 [2022-03-15 19:49:49,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6735 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3442, Invalid=16580, Unknown=0, NotChecked=0, Total=20022 [2022-03-15 19:49:49,964 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:49,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:49:49,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-03-15 19:49:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 196. [2022-03-15 19:49:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.5641025641025643) internal successors, (500), 195 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 500 transitions. [2022-03-15 19:49:49,969 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 500 transitions. Word has length 19 [2022-03-15 19:49:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:49,969 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 500 transitions. [2022-03-15 19:49:49,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.8055555555555554) internal successors, (101), 36 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 500 transitions. [2022-03-15 19:49:49,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:49:49,970 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:49,970 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:49,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:50,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 19:49:50,189 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:50,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:50,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1042218874, now seen corresponding path program 12 times [2022-03-15 19:49:50,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:50,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970979704] [2022-03-15 19:49:50,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:50,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:50,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:50,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970979704] [2022-03-15 19:49:50,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970979704] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:50,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766176173] [2022-03-15 19:49:50,249 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:49:50,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:50,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:50,250 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:50,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:49:50,295 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:49:50,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:50,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:49:50,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:50,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:50,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766176173] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:50,427 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:50,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2022-03-15 19:49:50,428 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1470431746] [2022-03-15 19:49:50,428 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:50,429 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:50,434 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 178 transitions. [2022-03-15 19:49:50,434 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:51,249 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [8367#(or (<= thread1Thread1of1ForFork1_~x~0 9997) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 8384#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 8370#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 8379#(or (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 8375#(or (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 8385#(or (<= 9998 ~X~0) (<= ~X~0 thread2Thread1of1ForFork0_~x~1)), 8383#(or (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 8366#(or (<= thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 8374#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 8382#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 8368#(or (<= thread1Thread1of1ForFork1_~x~0 9996) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 8381#(or (<= (+ ~X~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9998 ~X~0)), 8372#(or (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 8376#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 8387#(or (<= thread1Thread1of1ForFork1_~x~0 (+ ~X~0 1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 8373#(or (<= (+ 3 ~X~0) thread2Thread1of1ForFork0_~x~1) (<= 9998 ~X~0)), 8378#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 8369#(or (<= ~X~0 9996) (<= 9998 ~X~0)), 8371#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 8380#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 8377#(or (<= 9998 ~X~0) (<= (+ 2 ~X~0) thread2Thread1of1ForFork0_~x~1)), 8386#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 ~X~0)) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 8388#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 ~X~0))] [2022-03-15 19:49:51,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:49:51,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:51,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:49:51,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1537, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:49:51,251 INFO L87 Difference]: Start difference. First operand 196 states and 500 transitions. Second operand has 34 states, 34 states have (on average 3.1176470588235294) internal successors, (106), 34 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:55,259 INFO L93 Difference]: Finished difference Result 1102 states and 2590 transitions. [2022-03-15 19:49:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-03-15 19:49:55,260 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.1176470588235294) internal successors, (106), 34 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:49:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:55,263 INFO L225 Difference]: With dead ends: 1102 [2022-03-15 19:49:55,263 INFO L226 Difference]: Without dead ends: 1094 [2022-03-15 19:49:55,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 195 SyntacticMatches, 3 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8073 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5641, Invalid=21091, Unknown=0, NotChecked=0, Total=26732 [2022-03-15 19:49:55,266 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 186 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:55,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 0 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:49:55,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2022-03-15 19:49:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 330. [2022-03-15 19:49:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 2.6990881458966567) internal successors, (888), 329 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 888 transitions. [2022-03-15 19:49:55,277 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 888 transitions. Word has length 20 [2022-03-15 19:49:55,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:55,277 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 888 transitions. [2022-03-15 19:49:55,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.1176470588235294) internal successors, (106), 34 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 888 transitions. [2022-03-15 19:49:55,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:49:55,278 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:55,278 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:55,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:55,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 19:49:55,491 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:55,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:55,492 INFO L85 PathProgramCache]: Analyzing trace with hash -907176071, now seen corresponding path program 13 times [2022-03-15 19:49:55,492 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:55,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815679755] [2022-03-15 19:49:55,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:55,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:55,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:55,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815679755] [2022-03-15 19:49:55,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815679755] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:55,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075525781] [2022-03-15 19:49:55,562 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:49:55,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:55,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:55,563 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:55,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 19:49:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:55,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:49:55,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:55,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:55,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075525781] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:55,725 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:55,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2022-03-15 19:49:55,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2139850845] [2022-03-15 19:49:55,725 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:55,726 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:55,732 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 187 transitions. [2022-03-15 19:49:55,732 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:56,373 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [10670#(<= (+ 2 ~X~0) thread1Thread1of1ForFork1_~x~0), 10653#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 10657#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 10660#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 10647#(<= 10000 thread1Thread1of1ForFork1_~x~0), 10651#(<= 9997 ~X~0), 10667#(<= thread2Thread1of1ForFork0_~x~1 ~X~0), 10662#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 10656#(or (<= thread2Thread1of1ForFork0_~x~1 9998) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 10649#(<= 9998 thread1Thread1of1ForFork1_~x~0), 10659#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 10648#(<= 9999 thread1Thread1of1ForFork1_~x~0), 10666#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9997 ~X~0)), 10664#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9997 ~X~0)), 10671#(<= (+ ~X~0 1) thread1Thread1of1ForFork1_~x~0), 10654#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 10652#(or (<= thread2Thread1of1ForFork0_~x~1 9999) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 10661#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 10658#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 10669#(<= (+ 3 ~X~0) thread1Thread1of1ForFork1_~x~0), 10668#(<= ~X~0 9996), 10650#(<= 9997 thread1Thread1of1ForFork1_~x~0), 10665#(or (<= 9997 ~X~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 10663#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 10655#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9999 thread1Thread1of1ForFork1_~x~0))] [2022-03-15 19:49:56,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:49:56,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:56,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:49:56,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1292, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:49:56,375 INFO L87 Difference]: Start difference. First operand 330 states and 888 transitions. Second operand has 36 states, 36 states have (on average 3.1944444444444446) internal successors, (115), 36 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:58,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:58,335 INFO L93 Difference]: Finished difference Result 920 states and 2399 transitions. [2022-03-15 19:49:58,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-03-15 19:49:58,335 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.1944444444444446) internal successors, (115), 36 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 19:49:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:58,338 INFO L225 Difference]: With dead ends: 920 [2022-03-15 19:49:58,338 INFO L226 Difference]: Without dead ends: 860 [2022-03-15 19:49:58,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 173 SyntacticMatches, 2 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6226 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3876, Invalid=14214, Unknown=0, NotChecked=0, Total=18090 [2022-03-15 19:49:58,341 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:58,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:49:58,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-03-15 19:49:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 334. [2022-03-15 19:49:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.6966966966966965) internal successors, (898), 333 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 898 transitions. [2022-03-15 19:49:58,361 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 898 transitions. Word has length 20 [2022-03-15 19:49:58,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:58,361 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 898 transitions. [2022-03-15 19:49:58,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.1944444444444446) internal successors, (115), 36 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:49:58,361 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 898 transitions. [2022-03-15 19:49:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:49:58,362 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:58,362 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:58,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:58,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:58,565 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:58,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:58,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2004860852, now seen corresponding path program 14 times [2022-03-15 19:49:58,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:58,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208183595] [2022-03-15 19:49:58,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:58,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:58,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:58,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208183595] [2022-03-15 19:49:58,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208183595] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:58,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826488940] [2022-03-15 19:49:58,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:49:58,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:58,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:58,684 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:49:58,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 19:49:58,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:49:58,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:58,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:49:58,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:58,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:59,274 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826488940] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:59,274 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:59,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2022-03-15 19:49:59,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [92177960] [2022-03-15 19:49:59,275 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:59,276 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:59,282 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 215 transitions. [2022-03-15 19:49:59,282 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:01,094 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [12728#(and (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19992) (not (< ~X~0 9997))) (or (not (< ~X~0 9997)) (= ~Y~0 0))), 12729#(or (not (< ~X~0 9997)) (= ~Y~0 0)), 12713#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 12708#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 12727#(and (or (not (< ~X~0 9997)) (= ~Y~0 0)) (or (not (< ~X~0 9997)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19993))), 12720#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 12701#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 12722#(and (or (not (< ~X~0 9997)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19994)) (or (not (< ~X~0 9997)) (= ~Y~0 0))), 12702#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 12704#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19996)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= 10000 ~Y~0))), 12721#(and (or (not (< ~X~0 9997)) (= ~Y~0 0)) (or (not (< ~X~0 9997)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19995))), 12706#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 12719#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 12696#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= 10000 ~Y~0))), 12718#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 12705#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 12695#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= 10000 ~Y~0))), 12700#(and (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 12725#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19993))), 12726#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19992)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 12698#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 12710#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 12717#(and (or (not (< ~X~0 9997)) (= ~Y~0 0)) (or (not (< ~X~0 9997)) (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 19996))), 12699#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 12712#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 12723#(and (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19995)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 12714#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 12715#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 12724#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 12703#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 12697#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= 10000 ~Y~0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19997))), 12709#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 12707#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 12711#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 12716#(and (or (not (< ~X~0 9997)) (<= (+ ~Y~0 ~X~0) 19996)) (or (not (< ~X~0 9997)) (<= 10000 ~Y~0)))] [2022-03-15 19:50:01,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 19:50:01,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:01,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 19:50:01,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=4071, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:50:01,107 INFO L87 Difference]: Start difference. First operand 334 states and 898 transitions. Second operand has 50 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:10,313 INFO L93 Difference]: Finished difference Result 1413 states and 3637 transitions. [2022-03-15 19:50:10,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2022-03-15 19:50:10,314 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:50:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:10,318 INFO L225 Difference]: With dead ends: 1413 [2022-03-15 19:50:10,318 INFO L226 Difference]: Without dead ends: 1406 [2022-03-15 19:50:10,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24110 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=10407, Invalid=52845, Unknown=0, NotChecked=0, Total=63252 [2022-03-15 19:50:10,322 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 148 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:10,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 0 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:50:10,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2022-03-15 19:50:10,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 448. [2022-03-15 19:50:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 2.6599552572706937) internal successors, (1189), 447 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1189 transitions. [2022-03-15 19:50:10,334 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1189 transitions. Word has length 21 [2022-03-15 19:50:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:10,335 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 1189 transitions. [2022-03-15 19:50:10,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.816326530612245) internal successors, (138), 49 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1189 transitions. [2022-03-15 19:50:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:50:10,336 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:10,336 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:10,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 19:50:10,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:10,549 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:10,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:10,550 INFO L85 PathProgramCache]: Analyzing trace with hash -112463399, now seen corresponding path program 15 times [2022-03-15 19:50:10,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:10,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532839969] [2022-03-15 19:50:10,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:10,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:10,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:10,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532839969] [2022-03-15 19:50:10,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532839969] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:10,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213323602] [2022-03-15 19:50:10,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:50:10,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:10,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:10,625 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:50:10,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 19:50:10,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:50:10,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:10,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:50:10,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-15 19:50:10,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-15 19:50:10,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213323602] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:10,901 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:10,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 21 [2022-03-15 19:50:10,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1293777112] [2022-03-15 19:50:10,901 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:10,902 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:10,910 INFO L252 McrAutomatonBuilder]: Finished intersection with 116 states and 243 transitions. [2022-03-15 19:50:10,910 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:12,287 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [15573#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 15577#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 15568#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1)), 15571#(or (<= 9997 ~X~0) (<= (+ ~X~0 4) thread2Thread1of1ForFork0_~x~1)), 15555#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 15581#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 15560#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 15563#(or (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 15574#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 15579#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1)) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 15556#(or (<= thread1Thread1of1ForFork1_~x~0 9997) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 15565#(or (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 15564#(or (<= thread1Thread1of1ForFork1_~x~0 9996) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 15557#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 15575#(or (<= 9997 ~X~0) (<= (+ 2 ~X~0) thread2Thread1of1ForFork0_~x~1)), 15558#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 15566#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 15559#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 15585#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 ~X~0)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 15561#(or (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 15586#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ ~X~0 1))), 15567#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 9995)), 15576#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 15562#(or (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 15584#(or (<= 9997 ~X~0) (<= ~X~0 thread2Thread1of1ForFork0_~x~1)), 15572#(or (<= 9997 ~X~0) (<= (+ 3 ~X~0) thread2Thread1of1ForFork0_~x~1)), 15583#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 15569#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 15554#(or (<= thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 15578#(or (<= 9997 ~X~0) (<= (+ ~X~0 1) thread2Thread1of1ForFork0_~x~1)), 15580#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ 3 ~X~0))), 15582#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 15570#(or (<= 9997 ~X~0) (<= ~X~0 9995)), 15587#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 ~X~0))] [2022-03-15 19:50:12,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 19:50:12,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 19:50:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2708, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:50:12,288 INFO L87 Difference]: Start difference. First operand 448 states and 1189 transitions. Second operand has 47 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:20,093 INFO L93 Difference]: Finished difference Result 2150 states and 5217 transitions. [2022-03-15 19:50:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2022-03-15 19:50:20,094 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:50:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:20,100 INFO L225 Difference]: With dead ends: 2150 [2022-03-15 19:50:20,100 INFO L226 Difference]: Without dead ends: 2142 [2022-03-15 19:50:20,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 286 SyntacticMatches, 4 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20576 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=12018, Invalid=50232, Unknown=0, NotChecked=0, Total=62250 [2022-03-15 19:50:20,103 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 234 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 2273 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 2273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:20,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 0 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 2273 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:50:20,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2022-03-15 19:50:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 560. [2022-03-15 19:50:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 2.6940966010733454) internal successors, (1506), 559 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 1506 transitions. [2022-03-15 19:50:20,120 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 1506 transitions. Word has length 22 [2022-03-15 19:50:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:20,120 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 1506 transitions. [2022-03-15 19:50:20,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.0638297872340425) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 1506 transitions. [2022-03-15 19:50:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:50:20,121 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:20,121 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:20,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 19:50:20,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:20,336 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:20,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash 308525702, now seen corresponding path program 16 times [2022-03-15 19:50:20,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:20,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713424315] [2022-03-15 19:50:20,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:20,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:20,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:20,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713424315] [2022-03-15 19:50:20,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713424315] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:20,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27051293] [2022-03-15 19:50:20,395 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:50:20,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:20,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:20,396 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:50:20,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 19:50:20,442 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:50:20,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:20,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-15 19:50:20,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:20,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:20,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27051293] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:20,565 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:20,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2022-03-15 19:50:20,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1732701925] [2022-03-15 19:50:20,565 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:20,566 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:20,573 INFO L252 McrAutomatonBuilder]: Finished intersection with 120 states and 252 transitions. [2022-03-15 19:50:20,573 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:21,528 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [19607#(<= 9996 thread1Thread1of1ForFork1_~x~0), 19591#(<= 9997 thread1Thread1of1ForFork1_~x~0), 19588#(<= 10000 thread1Thread1of1ForFork1_~x~0), 19590#(<= 9998 thread1Thread1of1ForFork1_~x~0), 19594#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 19600#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 19616#(<= (+ 2 ~X~0) thread1Thread1of1ForFork1_~x~0), 19621#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9996 ~X~0)), 19593#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 19595#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 19596#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 19599#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 19623#(<= thread2Thread1of1ForFork0_~x~1 ~X~0), 19598#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 19622#(<= (+ ~X~0 1) thread1Thread1of1ForFork1_~x~0), 19609#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 19613#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 19618#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9996 ~X~0)), 19620#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9996 ~X~0)), 19603#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 19606#(<= (+ 3 ~X~0) thread1Thread1of1ForFork1_~x~0), 19614#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 19597#(or (<= thread2Thread1of1ForFork0_~x~1 9998) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 19610#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 19617#(<= 9996 ~X~0), 19619#(or (<= 9996 ~X~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 19602#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 19615#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 19611#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 19605#(<= (+ ~X~0 4) thread1Thread1of1ForFork1_~x~0), 19604#(<= ~X~0 9995), 19589#(<= 9999 thread1Thread1of1ForFork1_~x~0), 19612#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 19601#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 19608#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 19592#(or (<= thread2Thread1of1ForFork0_~x~1 9999) (<= 10000 thread1Thread1of1ForFork1_~x~0))] [2022-03-15 19:50:21,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 19:50:21,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:21,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 19:50:21,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=2329, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:50:21,529 INFO L87 Difference]: Start difference. First operand 560 states and 1506 transitions. Second operand has 49 states, 49 states have (on average 3.142857142857143) internal successors, (154), 49 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:25,229 INFO L93 Difference]: Finished difference Result 1620 states and 4256 transitions. [2022-03-15 19:50:25,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-03-15 19:50:25,230 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.142857142857143) internal successors, (154), 49 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:50:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:25,234 INFO L225 Difference]: With dead ends: 1620 [2022-03-15 19:50:25,234 INFO L226 Difference]: Without dead ends: 1520 [2022-03-15 19:50:25,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 254 SyntacticMatches, 2 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17224 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=9199, Invalid=35533, Unknown=0, NotChecked=0, Total=44732 [2022-03-15 19:50:25,237 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:25,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:50:25,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2022-03-15 19:50:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 550. [2022-03-15 19:50:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 2.7012750455373404) internal successors, (1483), 549 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1483 transitions. [2022-03-15 19:50:25,249 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1483 transitions. Word has length 22 [2022-03-15 19:50:25,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:25,249 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 1483 transitions. [2022-03-15 19:50:25,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.142857142857143) internal successors, (154), 49 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:25,249 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1483 transitions. [2022-03-15 19:50:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:50:25,250 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:25,250 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:25,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-15 19:50:25,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:25,467 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1568508819, now seen corresponding path program 17 times [2022-03-15 19:50:25,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:25,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694496797] [2022-03-15 19:50:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:25,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:25,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:25,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694496797] [2022-03-15 19:50:25,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694496797] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:25,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470975119] [2022-03-15 19:50:25,607 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:50:25,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:25,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:25,608 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:50:25,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 19:50:25,657 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:50:25,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:25,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:50:25,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:25,744 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-03-15 19:50:25,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-03-15 19:50:25,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470975119] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:25,861 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:25,861 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 21 [2022-03-15 19:50:25,861 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1453269140] [2022-03-15 19:50:25,862 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:25,863 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:25,871 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 285 transitions. [2022-03-15 19:50:25,871 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:28,328 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 48 new interpolants: [22988#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 22977#(and (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 23016#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19990))), 22999#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 22997#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 23003#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 22972#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= 10000 ~Y~0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19997))), 22994#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 22982#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 22991#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 22981#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 22975#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 22980#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 23002#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 22990#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 23011#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990))), 23009#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 22970#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= 10000 ~Y~0))), 23010#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0))), 23014#(and (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19990) (not (< ~X~0 9996))) (or (not (< ~X~0 9996)) (= ~Y~0 0))), 22989#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 23000#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 22992#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0))), 22993#(and (or (not (< ~X~0 9996)) (= ~Y~0 0)) (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19993) (not (< ~X~0 9996)))), 22986#(and (or (not (< ~X~0 9996)) (= ~Y~0 0)) (or (not (< ~X~0 9996)) (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 19995))), 23005#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 22983#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 22971#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= 10000 ~Y~0))), 22973#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19996)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= 10000 ~Y~0))), 22974#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= 10000 ~Y~0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19995))), 22978#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 23006#(and (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 22995#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 23012#(and (or (not (< ~X~0 9996)) (= ~Y~0 0)) (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19992) (not (< ~X~0 9996)))), 22984#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9996)))), 23001#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 22979#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995))), 22985#(and (or (not (< ~X~0 9996)) (<= 10000 ~Y~0)) (or (not (< ~X~0 9996)) (<= (+ ~Y~0 ~X~0) 19995))), 22996#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 22998#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 22987#(and (or (not (< ~X~0 9996)) (= ~Y~0 0)) (or (not (< ~X~0 9996)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19994))), 23017#(or (not (< ~X~0 9996)) (= ~Y~0 0)), 23008#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19992)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 23007#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19993))), 23004#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 23015#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19991)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 22976#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 23013#(and (or (not (< ~X~0 9996)) (= ~Y~0 0)) (or (not (< ~X~0 9996)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19991)))] [2022-03-15 19:50:28,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 19:50:28,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:28,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 19:50:28,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=4500, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 19:50:28,329 INFO L87 Difference]: Start difference. First operand 550 states and 1483 transitions. Second operand has 65 states, 64 states have (on average 2.828125) internal successors, (181), 64 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:47,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:50:47,418 INFO L93 Difference]: Finished difference Result 3185 states and 8142 transitions. [2022-03-15 19:50:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 322 states. [2022-03-15 19:50:47,419 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.828125) internal successors, (181), 64 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:50:47,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:50:47,428 INFO L225 Difference]: With dead ends: 3185 [2022-03-15 19:50:47,428 INFO L226 Difference]: Without dead ends: 3178 [2022-03-15 19:50:47,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60735 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=22945, Invalid=124127, Unknown=0, NotChecked=0, Total=147072 [2022-03-15 19:50:47,435 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 157 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 3140 mSolverCounterSat, 1207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1207 IncrementalHoareTripleChecker+Valid, 3140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:50:47,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 0 Invalid, 4347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1207 Valid, 3140 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:50:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2022-03-15 19:50:47,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 724. [2022-03-15 19:50:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 723 states have (on average 2.663900414937759) internal successors, (1926), 723 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1926 transitions. [2022-03-15 19:50:47,456 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1926 transitions. Word has length 23 [2022-03-15 19:50:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:50:47,456 INFO L470 AbstractCegarLoop]: Abstraction has 724 states and 1926 transitions. [2022-03-15 19:50:47,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.828125) internal successors, (181), 64 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:50:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1926 transitions. [2022-03-15 19:50:47,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:50:47,457 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:50:47,457 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:50:47,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 19:50:47,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:47,671 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:50:47,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:50:47,672 INFO L85 PathProgramCache]: Analyzing trace with hash -754474534, now seen corresponding path program 18 times [2022-03-15 19:50:47,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:50:47,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267156370] [2022-03-15 19:50:47,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:50:47,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:50:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:50:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:50:47,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:50:47,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267156370] [2022-03-15 19:50:47,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267156370] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:50:47,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748838947] [2022-03-15 19:50:47,749 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:50:47,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:50:47,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:50:47,750 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:50:47,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 19:50:47,804 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:50:47,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:50:47,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:50:47,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:50:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-15 19:50:47,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:50:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-15 19:50:48,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748838947] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:50:48,063 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:50:48,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 23 [2022-03-15 19:50:48,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [656004583] [2022-03-15 19:50:48,064 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:50:48,065 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:50:48,074 INFO L252 McrAutomatonBuilder]: Finished intersection with 148 states and 318 transitions. [2022-03-15 19:50:48,074 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:50:50,007 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 47 new interpolants: [28450#(or (<= thread1Thread1of1ForFork1_~x~0 (+ ~X~0 4)) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 28482#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 ~X~0)) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 28462#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 9994)), 28472#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 28461#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 28442#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 28448#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1)) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 28465#(or (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 28455#(or (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 28447#(or (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 28483#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ ~X~0 1))), 28466#(or (<= 9996 ~X~0) (<= ~X~0 9994)), 28476#(or (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 28438#(or (<= thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 28480#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 28469#(or (<= (+ 3 ~X~0) thread2Thread1of1ForFork0_~x~1) (<= 9996 ~X~0)), 28451#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 28467#(or (<= (+ 5 ~X~0) thread2Thread1of1ForFork0_~x~1) (<= 9996 ~X~0)), 28475#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 28473#(or (<= 9996 ~X~0) (<= (+ 2 ~X~0) thread2Thread1of1ForFork0_~x~1)), 28459#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1)), 28443#(or (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 28481#(or (<= ~X~0 thread2Thread1of1ForFork0_~x~1) (<= 9996 ~X~0)), 28463#(or (<= (+ 5 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 28452#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 28468#(or (<= 9996 ~X~0) (<= (+ ~X~0 4) thread2Thread1of1ForFork0_~x~1)), 28464#(or (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 28456#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 28453#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 ~X~0)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 28454#(or (<= thread1Thread1of1ForFork1_~x~0 9996) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 28470#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 28484#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 ~X~0)), 28457#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 28446#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 28441#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 28444#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 28477#(or (<= (+ ~X~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9996 ~X~0)), 28479#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 28458#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 9995)), 28460#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 28449#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 4))), 28474#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 28471#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 28440#(or (<= thread1Thread1of1ForFork1_~x~0 9997) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 28478#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 28439#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 28445#(or (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0))] [2022-03-15 19:50:50,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 19:50:50,007 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:50:50,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 19:50:50,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=4408, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 19:50:50,008 INFO L87 Difference]: Start difference. First operand 724 states and 1926 transitions. Second operand has 62 states, 62 states have (on average 3.032258064516129) internal successors, (188), 62 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:03,751 INFO L93 Difference]: Finished difference Result 3502 states and 8494 transitions. [2022-03-15 19:51:03,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 303 states. [2022-03-15 19:51:03,752 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 3.032258064516129) internal successors, (188), 62 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:51:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:03,762 INFO L225 Difference]: With dead ends: 3502 [2022-03-15 19:51:03,762 INFO L226 Difference]: Without dead ends: 3490 [2022-03-15 19:51:03,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 402 SyntacticMatches, 3 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45354 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=24625, Invalid=103897, Unknown=0, NotChecked=0, Total=128522 [2022-03-15 19:51:03,767 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 383 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 3144 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 3144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:03,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 0 Invalid, 3664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [520 Valid, 3144 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:51:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2022-03-15 19:51:03,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 876. [2022-03-15 19:51:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 2.686857142857143) internal successors, (2351), 875 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 2351 transitions. [2022-03-15 19:51:03,791 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 2351 transitions. Word has length 24 [2022-03-15 19:51:03,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:03,791 INFO L470 AbstractCegarLoop]: Abstraction has 876 states and 2351 transitions. [2022-03-15 19:51:03,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 3.032258064516129) internal successors, (188), 62 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 2351 transitions. [2022-03-15 19:51:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:51:03,793 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:03,793 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:03,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:04,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:04,012 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1868084071, now seen corresponding path program 19 times [2022-03-15 19:51:04,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:04,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829790182] [2022-03-15 19:51:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:04,104 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:04,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829790182] [2022-03-15 19:51:04,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829790182] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:04,104 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189063172] [2022-03-15 19:51:04,104 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:51:04,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:04,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:04,106 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:04,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 19:51:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:04,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:51:04,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:04,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:04,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189063172] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:04,320 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:04,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2022-03-15 19:51:04,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1903460015] [2022-03-15 19:51:04,320 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:04,322 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:04,331 INFO L252 McrAutomatonBuilder]: Finished intersection with 152 states and 327 transitions. [2022-03-15 19:51:04,331 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:05,734 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 49 new interpolants: [34781#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 34795#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9995)), 34770#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 34809#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 34777#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 34780#(<= 9996 thread1Thread1of1ForFork1_~x~0), 34792#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 34814#(<= thread2Thread1of1ForFork0_~x~1 ~X~0), 34779#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 34798#(<= 9995 ~X~0), 34796#(<= (+ 2 ~X~0) thread1Thread1of1ForFork1_~x~0), 34778#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 34806#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9995 ~X~0)), 34813#(<= (+ ~X~0 1) thread1Thread1of1ForFork1_~x~0), 34810#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 34773#(<= (+ 5 ~X~0) thread1Thread1of1ForFork1_~x~0), 34808#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 34800#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9995 ~X~0)), 34782#(or (<= thread2Thread1of1ForFork0_~x~1 9998) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 34789#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 34772#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 34805#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 34774#(<= 9999 thread1Thread1of1ForFork1_~x~0), 34788#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 34771#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 34807#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 34769#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 34802#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 34786#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 34775#(<= 9998 thread1Thread1of1ForFork1_~x~0), 34766#(<= ~X~0 9994), 34767#(<= 10000 thread1Thread1of1ForFork1_~x~0), 34783#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 34801#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 34768#(or (<= thread2Thread1of1ForFork0_~x~1 9999) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 34776#(<= 9997 thread1Thread1of1ForFork1_~x~0), 34804#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 34791#(<= (+ 3 ~X~0) thread1Thread1of1ForFork1_~x~0), 34784#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 34787#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 34797#(<= 9995 thread1Thread1of1ForFork1_~x~0), 34793#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 34799#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 34794#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 34790#(<= (+ ~X~0 4) thread1Thread1of1ForFork1_~x~0), 34811#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9995 ~X~0)), 34812#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9995 ~X~0)), 34803#(or (<= thread2Thread1of1ForFork0_~x~1 9998) (<= 9995 ~X~0)), 34785#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9999 thread1Thread1of1ForFork1_~x~0))] [2022-03-15 19:51:05,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 19:51:05,735 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:05,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 19:51:05,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1090, Invalid=3880, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 19:51:05,736 INFO L87 Difference]: Start difference. First operand 876 states and 2351 transitions. Second operand has 64 states, 64 states have (on average 3.109375) internal successors, (199), 64 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:12,481 INFO L93 Difference]: Finished difference Result 2614 states and 6894 transitions. [2022-03-15 19:51:12,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2022-03-15 19:51:12,481 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 3.109375) internal successors, (199), 64 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-03-15 19:51:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:12,488 INFO L225 Difference]: With dead ends: 2614 [2022-03-15 19:51:12,488 INFO L226 Difference]: Without dead ends: 2460 [2022-03-15 19:51:12,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 359 SyntacticMatches, 2 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40422 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=19491, Invalid=78165, Unknown=0, NotChecked=0, Total=97656 [2022-03-15 19:51:12,492 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:12,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:51:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2022-03-15 19:51:12,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 840. [2022-03-15 19:51:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 839 states have (on average 2.6948748510131106) internal successors, (2261), 839 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2261 transitions. [2022-03-15 19:51:12,509 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 2261 transitions. Word has length 24 [2022-03-15 19:51:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:12,509 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 2261 transitions. [2022-03-15 19:51:12,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.109375) internal successors, (199), 64 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:12,510 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2261 transitions. [2022-03-15 19:51:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:51:12,511 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:12,511 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:12,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:12,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 19:51:12,719 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:12,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:12,720 INFO L85 PathProgramCache]: Analyzing trace with hash -247876332, now seen corresponding path program 20 times [2022-03-15 19:51:12,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:12,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146754078] [2022-03-15 19:51:12,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:12,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:12,871 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:12,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:12,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146754078] [2022-03-15 19:51:12,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146754078] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:12,872 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937894910] [2022-03-15 19:51:12,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:51:12,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:12,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:12,873 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:12,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 19:51:12,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:51:12,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:12,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:51:12,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:13,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:13,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937894910] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:13,651 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:13,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 41 [2022-03-15 19:51:13,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [412309668] [2022-03-15 19:51:13,652 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:13,654 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:13,665 INFO L252 McrAutomatonBuilder]: Finished intersection with 168 states and 365 transitions. [2022-03-15 19:51:13,665 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:17,019 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 63 new interpolants: [40023#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= 10000 ~Y~0))), 40073#(and (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 40050#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 40072#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19992))), 40083#(and (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19988) (not (< ~X~0 9995))) (or (not (< ~X~0 9995)) (= ~Y~0 0))), 40034#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 40047#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (<= 10000 ~Y~0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 40076#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19988) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 40035#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 40051#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 40049#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 40065#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0))), 40074#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19990)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 40054#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 40084#(or (not (< ~X~0 9995)) (= ~Y~0 0)), 40037#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 40048#(and (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 40077#(and (or (not (< ~X~0 9995)) (= ~Y~0 0)) (or (not (< ~X~0 9995)) (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 19994))), 40080#(and (or (not (< ~X~0 9995)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19991)) (or (not (< ~X~0 9995)) (= ~Y~0 0))), 40068#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 40042#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 40059#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 40075#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19989)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0))), 40063#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 40026#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= 10000 ~Y~0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19995))), 40066#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990))), 40052#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 40071#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19993))), 40064#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 40079#(and (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19992) (not (< ~X~0 9995))) (or (not (< ~X~0 9995)) (= ~Y~0 0))), 40044#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9996)))), 40039#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 40024#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= 10000 ~Y~0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19997))), 40028#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 40032#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 40036#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 40055#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 40040#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 40027#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 40038#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 40043#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995))), 40053#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 40057#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 40058#(and (or (not (< ~X~0 9995)) (<= (+ ~Y~0 ~X~0) 19994)) (or (not (< ~X~0 9995)) (<= 10000 ~Y~0))), 40081#(and (or (not (< ~X~0 9995)) (= ~Y~0 0)) (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19990) (not (< ~X~0 9995)))), 40041#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 40061#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 40078#(and (or (not (< ~X~0 9995)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19993)) (or (not (< ~X~0 9995)) (= ~Y~0 0))), 40030#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 40025#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19996)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= 10000 ~Y~0))), 40045#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0))), 40070#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 40022#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= 10000 ~Y~0))), 40046#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 40062#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 40067#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989))), 40056#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 40069#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 40031#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 40033#(and (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 40029#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 40060#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 40082#(and (or (not (< ~X~0 9995)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19989)) (or (not (< ~X~0 9995)) (= ~Y~0 0)))] [2022-03-15 19:51:17,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-03-15 19:51:17,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:17,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-03-15 19:51:17,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1110, Invalid=10020, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 19:51:17,020 INFO L87 Difference]: Start difference. First operand 840 states and 2261 transitions. Second operand has 82 states, 81 states have (on average 2.8395061728395063) internal successors, (230), 81 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:55,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:51:55,027 INFO L93 Difference]: Finished difference Result 6263 states and 15930 transitions. [2022-03-15 19:51:55,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 507 states. [2022-03-15 19:51:55,028 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 2.8395061728395063) internal successors, (230), 81 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:51:55,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:51:55,040 INFO L225 Difference]: With dead ends: 6263 [2022-03-15 19:51:55,040 INFO L226 Difference]: Without dead ends: 6256 [2022-03-15 19:51:55,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 601 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157154 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=53900, Invalid=309106, Unknown=0, NotChecked=0, Total=363006 [2022-03-15 19:51:55,056 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 226 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 3839 mSolverCounterSat, 2112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2112 IncrementalHoareTripleChecker+Valid, 3839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:51:55,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 0 Invalid, 5951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2112 Valid, 3839 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 19:51:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6256 states. [2022-03-15 19:51:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6256 to 1086. [2022-03-15 19:51:55,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 2.6599078341013827) internal successors, (2886), 1085 states have internal predecessors, (2886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 2886 transitions. [2022-03-15 19:51:55,092 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 2886 transitions. Word has length 25 [2022-03-15 19:51:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:51:55,092 INFO L470 AbstractCegarLoop]: Abstraction has 1086 states and 2886 transitions. [2022-03-15 19:51:55,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 81 states have (on average 2.8395061728395063) internal successors, (230), 81 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:51:55,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 2886 transitions. [2022-03-15 19:51:55,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:51:55,094 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:51:55,094 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:51:55,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 19:51:55,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-03-15 19:51:55,306 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:51:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:51:55,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1227839367, now seen corresponding path program 21 times [2022-03-15 19:51:55,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:51:55,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910520502] [2022-03-15 19:51:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:51:55,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:51:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:51:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:51:55,417 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:51:55,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910520502] [2022-03-15 19:51:55,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910520502] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:51:55,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658458280] [2022-03-15 19:51:55,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:51:55,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:51:55,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:51:55,418 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:51:55,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 19:51:55,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:51:55,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:51:55,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:51:55,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:51:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-15 19:51:55,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:51:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-03-15 19:51:55,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658458280] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:51:55,720 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:51:55,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5, 5] total 25 [2022-03-15 19:51:55,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [35448418] [2022-03-15 19:51:55,720 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:51:55,722 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:51:55,735 INFO L252 McrAutomatonBuilder]: Finished intersection with 184 states and 403 transitions. [2022-03-15 19:51:55,735 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:51:58,572 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 62 new interpolants: [49731#(or (<= thread1Thread1of1ForFork1_~x~0 9993) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 49725#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 49698#(or (<= thread1Thread1of1ForFork1_~x~0 9997) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 49722#(or (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 49738#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 49713#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 9995)), 49712#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 49702#(or (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 49706#(or (<= thread1Thread1of1ForFork1_~x~0 (+ ~X~0 4)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 49719#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 9994)), 49724#(or (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 49709#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 49747#(or (<= (+ 2 ~X~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 ~X~0)), 49744#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ ~X~0 1))), 49750#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 ~X~0)), 49742#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ 3 ~X~0))), 49689#(or (<= thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 49691#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 49735#(or (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 49736#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 49692#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 49696#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ 5 thread2Thread1of1ForFork0_~x~1))), 49700#(or (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 49708#(or (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 49743#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 ~X~0)) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 49703#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 49717#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 49739#(or (<= ~X~0 9993) (<= 9995 ~X~0)), 49715#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 49704#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 49726#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 49746#(or (<= (+ 3 ~X~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 ~X~0)), 49737#(or (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 49732#(or (<= (+ 6 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 49718#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 49740#(or (<= (+ 6 ~X~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 ~X~0)), 49699#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 49720#(or (<= (+ 5 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 49734#(or (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 49749#(or (<= ~X~0 thread2Thread1of1ForFork0_~x~1) (<= 9995 ~X~0)), 49693#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 49694#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1)) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 49690#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 49741#(or (<= (+ 5 ~X~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 ~X~0)), 49707#(or (<= thread1Thread1of1ForFork1_~x~0 9996) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 49695#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 4))), 49723#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 49728#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1)) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 49697#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 5 ~X~0)) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 49745#(or (<= (+ ~X~0 4) thread2Thread1of1ForFork0_~x~1) (<= 9995 ~X~0)), 49714#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1)), 49733#(or (<= (+ 5 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 49701#(or (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 49711#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 49716#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 49729#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1))), 49748#(or (<= (+ ~X~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9995 ~X~0)), 49721#(or (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 49705#(or (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 4)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 49710#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 49727#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 49730#(or (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1)) (<= 9996 thread1Thread1of1ForFork1_~x~0))] [2022-03-15 19:51:58,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-03-15 19:51:58,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:51:58,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-03-15 19:51:58,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=6825, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 19:51:58,574 INFO L87 Difference]: Start difference. First operand 1086 states and 2886 transitions. Second operand has 79 states, 79 states have (on average 3.0126582278481013) internal successors, (238), 79 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:21,303 INFO L93 Difference]: Finished difference Result 5336 states and 12902 transitions. [2022-03-15 19:52:21,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 422 states. [2022-03-15 19:52:21,303 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 3.0126582278481013) internal successors, (238), 79 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:52:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:21,312 INFO L225 Difference]: With dead ends: 5336 [2022-03-15 19:52:21,312 INFO L226 Difference]: Without dead ends: 5320 [2022-03-15 19:52:21,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1036 GetRequests, 541 SyntacticMatches, 4 SemanticMatches, 491 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89864 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=46168, Invalid=196388, Unknown=0, NotChecked=0, Total=242556 [2022-03-15 19:52:21,324 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 435 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 4608 mSolverCounterSat, 701 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 701 IncrementalHoareTripleChecker+Valid, 4608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:21,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [435 Valid, 0 Invalid, 5309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [701 Valid, 4608 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-03-15 19:52:21,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2022-03-15 19:52:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 1282. [2022-03-15 19:52:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1281 states have (on average 2.676814988290398) internal successors, (3429), 1281 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 3429 transitions. [2022-03-15 19:52:21,356 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 3429 transitions. Word has length 26 [2022-03-15 19:52:21,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:21,356 INFO L470 AbstractCegarLoop]: Abstraction has 1282 states and 3429 transitions. [2022-03-15 19:52:21,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 3.0126582278481013) internal successors, (238), 79 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 3429 transitions. [2022-03-15 19:52:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:52:21,358 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:21,358 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:21,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-15 19:52:21,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-15 19:52:21,575 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:21,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:21,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1791258726, now seen corresponding path program 22 times [2022-03-15 19:52:21,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:21,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795484910] [2022-03-15 19:52:21,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:21,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:21,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:21,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795484910] [2022-03-15 19:52:21,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795484910] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:21,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025675964] [2022-03-15 19:52:21,676 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:52:21,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:21,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:21,678 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:21,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 19:52:21,729 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:52:21,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:21,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 19:52:21,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:21,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:21,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025675964] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:21,894 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:21,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2022-03-15 19:52:21,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [31998325] [2022-03-15 19:52:21,894 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:21,896 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:21,908 INFO L252 McrAutomatonBuilder]: Finished intersection with 188 states and 412 transitions. [2022-03-15 19:52:21,908 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:23,818 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 64 new interpolants: [59077#(<= 9996 thread1Thread1of1ForFork1_~x~0), 59067#(<= (+ ~X~0 4) thread1Thread1of1ForFork1_~x~0), 59091#(or (<= 9994 ~X~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 59095#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9996)), 59096#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9994 ~X~0)), 59071#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9994)), 59087#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 59084#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 59069#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 59076#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9994)), 59103#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9994)), 59050#(<= 9998 thread1Thread1of1ForFork1_~x~0), 59055#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 59052#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 59101#(or (<= thread2Thread1of1ForFork0_~x~1 9994) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 59075#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9995)), 59056#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 59047#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 59102#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9994)), 59081#(<= 9995 thread1Thread1of1ForFork1_~x~0), 59078#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 59100#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9994 ~X~0)), 59057#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 59097#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 59094#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 59099#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9995)), 59064#(<= ~X~0 9993), 59073#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 59044#(<= 10000 thread1Thread1of1ForFork1_~x~0), 59053#(<= 9997 thread1Thread1of1ForFork1_~x~0), 59058#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 59085#(<= 9994 thread1Thread1of1ForFork1_~x~0), 59045#(<= 9999 thread1Thread1of1ForFork1_~x~0), 59059#(or (<= thread2Thread1of1ForFork0_~x~1 9994) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 59083#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 59054#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 59063#(or (<= thread2Thread1of1ForFork0_~x~1 9994) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 59093#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 59090#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9994 ~X~0)), 59107#(<= (+ ~X~0 1) thread1Thread1of1ForFork1_~x~0), 59104#(or (<= thread2Thread1of1ForFork0_~x~1 9994) (<= 9994 ~X~0)), 59062#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 59079#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 59080#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 59105#(<= thread2Thread1of1ForFork0_~x~1 ~X~0), 59086#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (< thread2Thread1of1ForFork0_~x~1 10000)), 59046#(or (<= thread2Thread1of1ForFork0_~x~1 9999) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 59060#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 59092#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9994 ~X~0)), 59089#(<= 9994 ~X~0), 59061#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 59048#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 59106#(<= (+ 2 ~X~0) thread1Thread1of1ForFork1_~x~0), 59051#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 59082#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 59072#(<= (+ 3 ~X~0) thread1Thread1of1ForFork1_~x~0), 59049#(or (<= thread2Thread1of1ForFork0_~x~1 9998) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 59074#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 59066#(<= (+ 5 ~X~0) thread1Thread1of1ForFork1_~x~0), 59088#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9997)), 59098#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 59070#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 59065#(<= (+ 6 ~X~0) thread1Thread1of1ForFork1_~x~0), 59068#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9998 thread1Thread1of1ForFork1_~x~0))] [2022-03-15 19:52:23,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-03-15 19:52:23,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:23,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-03-15 19:52:23,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1742, Invalid=6090, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 19:52:23,820 INFO L87 Difference]: Start difference. First operand 1282 states and 3429 transitions. Second operand has 81 states, 81 states have (on average 3.0864197530864197) internal successors, (250), 81 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:52:35,596 INFO L93 Difference]: Finished difference Result 3954 states and 10451 transitions. [2022-03-15 19:52:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 369 states. [2022-03-15 19:52:35,597 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 3.0864197530864197) internal successors, (250), 81 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-03-15 19:52:35,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:52:35,604 INFO L225 Difference]: With dead ends: 3954 [2022-03-15 19:52:35,604 INFO L226 Difference]: Without dead ends: 3730 [2022-03-15 19:52:35,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 932 GetRequests, 491 SyntacticMatches, 2 SemanticMatches, 439 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84779 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=37878, Invalid=156162, Unknown=0, NotChecked=0, Total=194040 [2022-03-15 19:52:35,616 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 3200 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 3200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:52:35,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 3671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 3200 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 19:52:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2022-03-15 19:52:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 1214. [2022-03-15 19:52:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1213 states have (on average 2.685078318219291) internal successors, (3257), 1213 states have internal predecessors, (3257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:35,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3257 transitions. [2022-03-15 19:52:35,645 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3257 transitions. Word has length 26 [2022-03-15 19:52:35,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:52:35,645 INFO L470 AbstractCegarLoop]: Abstraction has 1214 states and 3257 transitions. [2022-03-15 19:52:35,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 3.0864197530864197) internal successors, (250), 81 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:52:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3257 transitions. [2022-03-15 19:52:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:52:35,647 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:52:35,647 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:52:35,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 19:52:35,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:35,857 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:52:35,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:52:35,857 INFO L85 PathProgramCache]: Analyzing trace with hash 281728307, now seen corresponding path program 23 times [2022-03-15 19:52:35,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:52:35,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925358411] [2022-03-15 19:52:35,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:52:35,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:52:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:52:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 21 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:52:36,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:52:36,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925358411] [2022-03-15 19:52:36,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925358411] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:52:36,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045120165] [2022-03-15 19:52:36,076 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:52:36,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:52:36,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:52:36,077 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:52:36,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 19:52:36,136 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:52:36,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:52:36,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:52:36,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:52:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-15 19:52:36,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:52:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-03-15 19:52:36,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045120165] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:52:36,444 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:52:36,444 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5, 5] total 25 [2022-03-15 19:52:36,444 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [909917893] [2022-03-15 19:52:36,444 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:52:36,445 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:52:36,461 INFO L252 McrAutomatonBuilder]: Finished intersection with 206 states and 455 transitions. [2022-03-15 19:52:36,461 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:52:40,609 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 80 new interpolants: [66790#(and (or (not (< ~X~0 9994)) (<= 10000 ~Y~0)) (or (not (< ~X~0 9994)) (<= (+ ~Y~0 ~X~0) 19993))), 66788#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 66770#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0))), 66786#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 66765#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= 10000 ~Y~0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19995))), 66800#(and (or (not (< ~X~0 9994)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19986)) (or (not (< ~X~0 9994)) (= ~Y~0 0))), 66751#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 66784#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 66747#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 66803#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19990))), 66796#(and (or (not (< ~X~0 9994)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19988)) (or (not (< ~X~0 9994)) (= ~Y~0 0))), 66757#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 66743#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 66787#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 66758#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 66805#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19988))), 66734#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 66802#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 66807#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (not (< thread1Thread1of1ForFork1_~x~0 9994)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19986))), 66772#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989))), 66789#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9994)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 66736#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 66733#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 66749#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 66745#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= 10000 ~Y~0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19997))), 66794#(and (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19990) (not (< ~X~0 9994))) (or (not (< ~X~0 9994)) (= ~Y~0 0))), 66782#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19987) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 66778#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 66795#(and (or (not (< ~X~0 9994)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19989)) (or (not (< ~X~0 9994)) (= ~Y~0 0))), 66756#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19996)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= 10000 ~Y~0))), 66769#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 66731#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 66760#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 66741#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 66735#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 66793#(and (or (not (< ~X~0 9994)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19991)) (or (not (< ~X~0 9994)) (= ~Y~0 0))), 66740#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 66785#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 66742#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 66808#(or (not (< ~X~0 9994)) (= ~Y~0 0)), 66806#(and (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19987) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 66799#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (not (< thread1Thread1of1ForFork1_~x~0 9994)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19986))), 66767#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9996)))), 66764#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 66738#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 66732#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 66798#(and (or (not (< ~X~0 9994)) (= ~Y~0 0)) (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19987) (not (< ~X~0 9994)))), 66768#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0))), 66761#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 66781#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988))), 66739#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 66753#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 66763#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 66774#(and (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 66759#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 66792#(and (or (not (< ~X~0 9994)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19992)) (or (not (< ~X~0 9994)) (= ~Y~0 0))), 66783#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (not (< thread1Thread1of1ForFork1_~x~0 9994)) (<= 10000 ~Y~0))), 66804#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19989)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 66797#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19987) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 66777#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 66748#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 66762#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 66780#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 66801#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19992))), 66754#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 66744#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 66775#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 66755#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 66737#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= 10000 ~Y~0))), 66771#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990))), 66779#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 66776#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 66773#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (<= 10000 ~Y~0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 66730#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 66746#(and (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 66752#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 66729#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= 10000 ~Y~0))), 66791#(and (or (not (< ~X~0 9994)) (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 19993)) (or (not (< ~X~0 9994)) (= ~Y~0 0))), 66750#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 66766#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995)))] [2022-03-15 19:52:40,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-03-15 19:52:40,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:52:40,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-03-15 19:52:40,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1051, Invalid=10291, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 19:52:40,611 INFO L87 Difference]: Start difference. First operand 1214 states and 3257 transitions. Second operand has 101 states, 100 states have (on average 2.85) internal successors, (285), 100 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:51,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:53:51,199 INFO L93 Difference]: Finished difference Result 11241 states and 28488 transitions. [2022-03-15 19:53:51,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 760 states. [2022-03-15 19:53:51,200 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 100 states have (on average 2.85) internal successors, (285), 100 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:53:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:53:51,220 INFO L225 Difference]: With dead ends: 11241 [2022-03-15 19:53:51,220 INFO L226 Difference]: Without dead ends: 11234 [2022-03-15 19:53:51,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 998 GetRequests, 140 SyntacticMatches, 4 SemanticMatches, 854 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334352 ImplicationChecksByTransitivity, 67.2s TimeCoverageRelationStatistics Valid=102789, Invalid=629091, Unknown=0, NotChecked=0, Total=731880 [2022-03-15 19:53:51,256 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 247 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 5698 mSolverCounterSat, 3226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3226 IncrementalHoareTripleChecker+Valid, 5698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:53:51,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 0 Invalid, 8924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3226 Valid, 5698 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 19:53:51,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11234 states. [2022-03-15 19:53:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11234 to 1544. [2022-03-15 19:53:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1543 states have (on average 2.6532728451069345) internal successors, (4094), 1543 states have internal predecessors, (4094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 4094 transitions. [2022-03-15 19:53:51,331 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 4094 transitions. Word has length 27 [2022-03-15 19:53:51,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:53:51,331 INFO L470 AbstractCegarLoop]: Abstraction has 1544 states and 4094 transitions. [2022-03-15 19:53:51,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 100 states have (on average 2.85) internal successors, (285), 100 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:53:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 4094 transitions. [2022-03-15 19:53:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:53:51,333 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:53:51,333 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:53:51,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 19:53:51,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 19:53:51,547 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:53:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:53:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1989964742, now seen corresponding path program 24 times [2022-03-15 19:53:51,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:53:51,548 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875538116] [2022-03-15 19:53:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:53:51,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:53:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:53:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:53:51,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:53:51,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875538116] [2022-03-15 19:53:51,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875538116] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:53:51,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665635062] [2022-03-15 19:53:51,663 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:53:51,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:53:51,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:53:51,664 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:53:51,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-15 19:53:51,719 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:53:51,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:53:51,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:53:51,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:53:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-03-15 19:53:51,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:53:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-03-15 19:53:51,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665635062] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:53:51,984 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:53:51,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5, 5] total 27 [2022-03-15 19:53:51,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2134055215] [2022-03-15 19:53:51,984 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:53:51,986 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:53:52,001 INFO L252 McrAutomatonBuilder]: Finished intersection with 224 states and 498 transitions. [2022-03-15 19:53:52,002 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:53:56,045 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 79 new interpolants: [82886#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 82826#(or (<= thread1Thread1of1ForFork1_~x~0 9997) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 82843#(or (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 82901#(or (<= 9994 ~X~0) (<= (+ 2 ~X~0) thread2Thread1of1ForFork0_~x~1)), 82869#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ 6 thread2Thread1of1ForFork0_~x~1))), 82829#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 82838#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= (+ 7 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 82878#(or (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 82873#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 82831#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 9995)), 82900#(or (<= (+ 3 ~X~0) thread2Thread1of1ForFork0_~x~1) (<= 9994 ~X~0)), 82889#(or (<= thread1Thread1of1ForFork1_~x~0 (+ ~X~0 4)) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 82864#(or (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 4)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 82830#(or (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 82870#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 5 thread2Thread1of1ForFork0_~x~1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 82883#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 82880#(or (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1)) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 82881#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 82832#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 9994)), 82852#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= (+ 5 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 82825#(or (<= thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 82841#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 82863#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 82872#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 82858#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1)) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 82888#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 5 ~X~0)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 82827#(or (<= thread1Thread1of1ForFork1_~x~0 9996) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 82902#(or (<= (+ ~X~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9994 ~X~0)), 82848#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 82859#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 4))), 82844#(or (<= (+ 5 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 82837#(or (<= (+ 6 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 82857#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 82828#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 82842#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 82897#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 82884#(or (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 82877#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 82866#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 82887#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ 6 ~X~0))), 82854#(or (<= (+ 7 ~X~0) thread2Thread1of1ForFork0_~x~1) (<= 9994 ~X~0)), 82895#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 82874#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 82875#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1))), 82868#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1)) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 82862#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 82836#(or (<= (+ 5 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 82834#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 9992)), 82861#(or (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 82882#(or (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 82893#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1)), 82835#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1)), 82833#(or (<= thread1Thread1of1ForFork1_~x~0 9993) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 82849#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 82851#(or (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 82896#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 82855#(or (<= (+ 6 ~X~0) thread2Thread1of1ForFork0_~x~1) (<= 9994 ~X~0)), 82890#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ 3 ~X~0))), 82903#(or (<= ~X~0 thread2Thread1of1ForFork0_~x~1) (<= 9994 ~X~0)), 82865#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 82867#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 82879#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 82885#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 82845#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= (+ 6 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 82871#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 4))), 82891#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 ~X~0)) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 82876#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1))), 82847#(or (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 82853#(or (<= 9994 ~X~0) (<= ~X~0 9992)), 82856#(or (<= (+ 5 ~X~0) thread2Thread1of1ForFork0_~x~1) (<= 9994 ~X~0)), 82839#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 82850#(or (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 82894#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 82860#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ 5 thread2Thread1of1ForFork0_~x~1))), 82898#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 ~X~0)), 82899#(or (<= 9994 ~X~0) (<= (+ ~X~0 4) thread2Thread1of1ForFork0_~x~1)), 82892#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ ~X~0 1))), 82846#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 82840#(or (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0))] [2022-03-15 19:53:56,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-03-15 19:53:56,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:53:56,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-03-15 19:53:56,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=989, Invalid=10141, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 19:53:56,048 INFO L87 Difference]: Start difference. First operand 1544 states and 4094 transitions. Second operand has 98 states, 98 states have (on average 3.0) internal successors, (294), 98 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:32,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:32,019 INFO L93 Difference]: Finished difference Result 7738 states and 18628 transitions. [2022-03-15 19:54:32,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 566 states. [2022-03-15 19:54:32,020 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 3.0) internal successors, (294), 98 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:54:32,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:32,033 INFO L225 Difference]: With dead ends: 7738 [2022-03-15 19:54:32,033 INFO L226 Difference]: Without dead ends: 7718 [2022-03-15 19:54:32,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1364 GetRequests, 707 SyntacticMatches, 5 SemanticMatches, 652 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163978 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=80809, Invalid=346253, Unknown=0, NotChecked=0, Total=427062 [2022-03-15 19:54:32,055 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 643 mSDsluCounter, 2048 mSDsCounter, 0 mSdLazyCounter, 5429 mSolverCounterSat, 884 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 884 IncrementalHoareTripleChecker+Valid, 5429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:32,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 0 Invalid, 6313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [884 Valid, 5429 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 19:54:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7718 states. [2022-03-15 19:54:32,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7718 to 1788. [2022-03-15 19:54:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1787 states have (on average 2.6664801343033018) internal successors, (4765), 1787 states have internal predecessors, (4765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 4765 transitions. [2022-03-15 19:54:32,109 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 4765 transitions. Word has length 28 [2022-03-15 19:54:32,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:32,109 INFO L470 AbstractCegarLoop]: Abstraction has 1788 states and 4765 transitions. [2022-03-15 19:54:32,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 3.0) internal successors, (294), 98 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 4765 transitions. [2022-03-15 19:54:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:54:32,112 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:32,112 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:54:32,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:32,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 19:54:32,329 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:54:32,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:32,329 INFO L85 PathProgramCache]: Analyzing trace with hash 577460665, now seen corresponding path program 25 times [2022-03-15 19:54:32,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:32,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409120148] [2022-03-15 19:54:32,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:32,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:32,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:32,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409120148] [2022-03-15 19:54:32,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409120148] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:32,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222854885] [2022-03-15 19:54:32,509 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:54:32,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:32,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:32,511 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:32,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-15 19:54:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:32,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 19:54:32,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:32,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:32,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222854885] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:32,786 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:32,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2022-03-15 19:54:32,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [857731054] [2022-03-15 19:54:32,786 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:32,787 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:32,804 INFO L252 McrAutomatonBuilder]: Finished intersection with 228 states and 507 transitions. [2022-03-15 19:54:32,804 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:54:35,337 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 81 new interpolants: [96063#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 96077#(<= 9995 thread1Thread1of1ForFork1_~x~0), 96096#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 96121#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9993 ~X~0)), 96116#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 96106#(or (<= 9993 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 96131#(<= (+ 2 ~X~0) thread1Thread1of1ForFork1_~x~0), 96066#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 96062#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 96105#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 96101#(<= 9994 thread1Thread1of1ForFork1_~x~0), 96059#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 96122#(or (<= 9993 ~X~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 96074#(<= 9996 thread1Thread1of1ForFork1_~x~0), 96118#(<= 9993 ~X~0), 96110#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 96109#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 96119#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 96088#(<= (+ 5 ~X~0) thread1Thread1of1ForFork1_~x~0), 96113#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9996)), 96069#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 96112#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9994)), 96071#(<= 9997 thread1Thread1of1ForFork1_~x~0), 96060#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 96084#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9994)), 96054#(<= 9999 thread1Thread1of1ForFork1_~x~0), 96078#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 96053#(or (<= thread2Thread1of1ForFork0_~x~1 9999) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 96070#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 96082#(or (<= thread2Thread1of1ForFork0_~x~1 9994) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 96107#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 96104#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 96073#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 96125#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9993 ~X~0)), 96129#(or (<= 9993 ~X~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 96095#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 96081#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 96100#(<= (+ 3 ~X~0) thread1Thread1of1ForFork1_~x~0), 96090#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 96091#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 96108#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9997)), 96067#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 96064#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 96072#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 96087#(<= (+ 6 ~X~0) thread1Thread1of1ForFork1_~x~0), 96114#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9995)), 96089#(<= (+ ~X~0 4) thread1Thread1of1ForFork1_~x~0), 96111#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 96102#(<= 9993 thread1Thread1of1ForFork1_~x~0), 96124#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9993 ~X~0)), 96115#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9994)), 96080#(or (<= thread2Thread1of1ForFork0_~x~1 9994) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 96055#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 96076#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 96052#(<= 10000 thread1Thread1of1ForFork1_~x~0), 96097#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 96126#(or (<= thread2Thread1of1ForFork0_~x~1 9994) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 96075#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 96086#(<= (+ 7 ~X~0) thread1Thread1of1ForFork1_~x~0), 96079#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 96117#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 96061#(<= ~X~0 9992), 96127#(or (<= 9993 ~X~0) (<= thread2Thread1of1ForFork0_~x~1 9994)), 96057#(or (<= thread2Thread1of1ForFork0_~x~1 9998) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 96123#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9993 ~X~0)), 96056#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 96083#(or (<= thread2Thread1of1ForFork0_~x~1 9993) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 96098#(or (<= thread2Thread1of1ForFork0_~x~1 9994) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 96132#(<= (+ ~X~0 1) thread1Thread1of1ForFork1_~x~0), 96120#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 96058#(<= 9998 thread1Thread1of1ForFork1_~x~0), 96093#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9994)), 96103#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (< thread2Thread1of1ForFork0_~x~1 10000)), 96092#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9995)), 96099#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 96094#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 96128#(or (<= 9993 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 96130#(<= thread2Thread1of1ForFork0_~x~1 ~X~0), 96065#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 96085#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 96068#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 10000 thread1Thread1of1ForFork1_~x~0))] [2022-03-15 19:54:35,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2022-03-15 19:54:35,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:54:35,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2022-03-15 19:54:35,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2650, Invalid=9122, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 19:54:35,339 INFO L87 Difference]: Start difference. First operand 1788 states and 4765 transitions. Second operand has 100 states, 100 states have (on average 3.07) internal successors, (307), 100 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:54,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:54:54,695 INFO L93 Difference]: Finished difference Result 5692 states and 15065 transitions. [2022-03-15 19:54:54,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 509 states. [2022-03-15 19:54:54,696 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 3.07) internal successors, (307), 100 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-03-15 19:54:54,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:54:54,703 INFO L225 Difference]: With dead ends: 5692 [2022-03-15 19:54:54,703 INFO L226 Difference]: Without dead ends: 5380 [2022-03-15 19:54:54,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1252 GetRequests, 653 SyntacticMatches, 2 SemanticMatches, 597 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162917 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=68761, Invalid=289441, Unknown=0, NotChecked=0, Total=358202 [2022-03-15 19:54:54,723 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 4191 mSolverCounterSat, 662 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 662 IncrementalHoareTripleChecker+Valid, 4191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:54:54,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 4853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [662 Valid, 4191 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:54:54,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2022-03-15 19:54:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 1682. [2022-03-15 19:54:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1681 states have (on average 2.674598453301606) internal successors, (4496), 1681 states have internal predecessors, (4496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 4496 transitions. [2022-03-15 19:54:54,762 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 4496 transitions. Word has length 28 [2022-03-15 19:54:54,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:54:54,762 INFO L470 AbstractCegarLoop]: Abstraction has 1682 states and 4496 transitions. [2022-03-15 19:54:54,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 3.07) internal successors, (307), 100 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:54:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 4496 transitions. [2022-03-15 19:54:54,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:54:54,765 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:54:54,765 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:54:54,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-15 19:54:54,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:54,970 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:54:54,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:54:54,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1300591220, now seen corresponding path program 26 times [2022-03-15 19:54:54,971 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:54:54,971 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133206268] [2022-03-15 19:54:54,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:54:54,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:54:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:54:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:55,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:54:55,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133206268] [2022-03-15 19:54:55,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133206268] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:54:55,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298240504] [2022-03-15 19:54:55,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:54:55,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:54:55,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:54:55,240 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:54:55,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-15 19:54:55,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:54:55,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:54:55,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:54:55,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:54:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:55,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:54:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 21 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:54:56,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298240504] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:54:56,191 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:54:56,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 51 [2022-03-15 19:54:56,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [893069690] [2022-03-15 19:54:56,192 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:54:56,193 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:54:56,211 INFO L252 McrAutomatonBuilder]: Finished intersection with 248 states and 555 transitions. [2022-03-15 19:54:56,211 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:55:01,978 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 99 new interpolants: [106914#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 106975#(and (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19984) (not (< thread1Thread1of1ForFork1_~x~0 9993))) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 106977#(and (or (not (< ~X~0 9993)) (= ~Y~0 0)) (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19984) (not (< ~X~0 9993)))), 106911#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 106939#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 106944#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19986) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 106919#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 106920#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 106970#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (not (< thread1Thread1of1ForFork1_~x~0 9994)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19986))), 106910#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 106930#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990))), 106966#(and (or (not (< ~X~0 9993)) (= ~Y~0 0)) (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19989) (not (< ~X~0 9993)))), 106961#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9994)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 106882#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 106954#(and (or (not (< ~X~0 9993)) (<= 10000 ~Y~0)) (or (<= (+ ~Y~0 ~X~0) 19992) (not (< ~X~0 9993)))), 106940#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 106942#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 106918#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 106925#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988))), 106934#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19987))), 106933#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19987))), 106889#(and (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 106952#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 106881#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 106888#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= 10000 ~Y~0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19997))), 106955#(and (or (not (< ~X~0 9993)) (= ~Y~0 0)) (or (not (< ~X~0 9993)) (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 19992))), 106974#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19984)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 106923#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 106897#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 106943#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19987) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 106905#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 106906#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 106972#(and (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19985) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 106931#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989))), 106895#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 106956#(and (or (not (< ~X~0 9993)) (= ~Y~0 0)) (or (not (< ~X~0 9993)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19991))), 106953#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 106917#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 106928#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19989)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 106901#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995))), 106929#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19988)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 106945#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19986) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 106903#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0))), 106971#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19985) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 106922#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 106884#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 106892#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19996)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= 10000 ~Y~0))), 106908#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 106907#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 106899#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 106913#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 106946#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (not (< thread1Thread1of1ForFork1_~x~0 9994)) (<= 10000 ~Y~0))), 106891#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 106962#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19987) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 106948#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 106968#(and (or (not (< ~X~0 9993)) (= ~Y~0 0)) (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19987) (not (< ~X~0 9993)))), 106941#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 106949#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= 10000 ~Y~0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19992))), 106926#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 106886#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 106969#(and (or (not (< ~X~0 9993)) (= ~Y~0 0)) (or (not (< ~X~0 9993)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19986))), 106921#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 106973#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19985))), 106978#(or (not (< ~X~0 9993)) (= ~Y~0 0)), 106883#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= 10000 ~Y~0))), 106963#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988))), 106898#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 106958#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 106927#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19990))), 106887#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 106967#(and (or (not (< ~X~0 9993)) (= ~Y~0 0)) (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19988) (not (< ~X~0 9993)))), 106950#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 106912#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 106890#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 106924#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 106960#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 106957#(and (or (not (< ~X~0 9993)) (= ~Y~0 0)) (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19990) (not (< ~X~0 9993)))), 106916#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 106938#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 106936#(and (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 106904#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 106951#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 106976#(and (or (not (< ~X~0 9993)) (= ~Y~0 0)) (or (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19985) (not (< ~X~0 9993)))), 106900#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= 10000 ~Y~0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19995))), 106909#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0))), 106935#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (<= 10000 ~Y~0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 106964#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19987))), 106893#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 106902#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9996)))), 106880#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= 10000 ~Y~0))), 106947#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 106915#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 106937#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 106896#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 106932#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988))), 106965#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19986)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 106959#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 106894#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 106885#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9999))))] [2022-03-15 19:55:01,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2022-03-15 19:55:01,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:55:01,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2022-03-15 19:55:01,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2242, Invalid=20710, Unknown=0, NotChecked=0, Total=22952 [2022-03-15 19:55:01,980 INFO L87 Difference]: Start difference. First operand 1682 states and 4496 transitions. Second operand has 122 states, 121 states have (on average 2.8595041322314048) internal successors, (346), 121 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:57:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:57:09,328 INFO L93 Difference]: Finished difference Result 18775 states and 47458 transitions. [2022-03-15 19:57:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1094 states. [2022-03-15 19:57:09,328 INFO L78 Accepts]: Start accepts. Automaton has has 122 states, 121 states have (on average 2.8595041322314048) internal successors, (346), 121 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:57:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:57:09,357 INFO L225 Difference]: With dead ends: 18775 [2022-03-15 19:57:09,357 INFO L226 Difference]: Without dead ends: 18768 [2022-03-15 19:57:09,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1377 GetRequests, 140 SyntacticMatches, 5 SemanticMatches, 1232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709991 ImplicationChecksByTransitivity, 121.5s TimeCoverageRelationStatistics Valid=205974, Invalid=1315548, Unknown=0, NotChecked=0, Total=1521522 [2022-03-15 19:57:09,440 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 227 mSDsluCounter, 2798 mSDsCounter, 0 mSdLazyCounter, 7992 mSolverCounterSat, 4085 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 12077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4085 IncrementalHoareTripleChecker+Valid, 7992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:57:09,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 0 Invalid, 12077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4085 Valid, 7992 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-03-15 19:57:09,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18768 states. [2022-03-15 19:57:09,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18768 to 2108. [2022-03-15 19:57:09,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2107 states have (on average 2.6459420977693404) internal successors, (5575), 2107 states have internal predecessors, (5575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:57:09,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 5575 transitions. [2022-03-15 19:57:09,547 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 5575 transitions. Word has length 29 [2022-03-15 19:57:09,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:57:09,547 INFO L470 AbstractCegarLoop]: Abstraction has 2108 states and 5575 transitions. [2022-03-15 19:57:09,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 121 states have (on average 2.8595041322314048) internal successors, (346), 121 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:57:09,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 5575 transitions. [2022-03-15 19:57:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:57:09,550 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:57:09,550 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:57:09,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-15 19:57:09,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:57:09,763 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:57:09,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:57:09,764 INFO L85 PathProgramCache]: Analyzing trace with hash -469985511, now seen corresponding path program 27 times [2022-03-15 19:57:09,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:57:09,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683931872] [2022-03-15 19:57:09,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:57:09,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:57:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:57:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:57:09,912 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:57:09,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683931872] [2022-03-15 19:57:09,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683931872] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:57:09,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804476902] [2022-03-15 19:57:09,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:57:09,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:57:09,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:57:09,913 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:57:09,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-15 19:57:09,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:57:09,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:57:09,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:57:09,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:57:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-03-15 19:57:10,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:57:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-03-15 19:57:10,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804476902] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:57:10,246 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:57:10,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5, 5] total 29 [2022-03-15 19:57:10,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1617021705] [2022-03-15 19:57:10,246 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:57:10,248 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:57:10,268 INFO L252 McrAutomatonBuilder]: Finished intersection with 268 states and 603 transitions. [2022-03-15 19:57:10,268 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:57:15,828 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 98 new interpolants: [132392#(or (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1)) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 132377#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 132418#(or (<= (+ 7 ~X~0) thread2Thread1of1ForFork0_~x~1) (<= 9993 ~X~0)), 132342#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 132347#(or (<= thread1Thread1of1ForFork1_~x~0 9993) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 132351#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 132338#(or (<= thread1Thread1of1ForFork1_~x~0 9997) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 132374#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 132425#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 7 ~X~0)) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 132389#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 132428#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ ~X~0 4))), 132354#(or (<= (+ 5 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 132372#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1)) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 132366#(or (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 132431#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ ~X~0 1))), 132381#(or (<= ~X~0 9991) (<= 9993 ~X~0)), 132396#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1))), 132413#(or (<= (+ 5 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 132415#(or (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 132385#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 132349#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 132393#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ 6 thread2Thread1of1ForFork0_~x~1))), 132353#(or (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 132376#(or (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 132371#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1)), 132355#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 9992)), 132348#(or (<= (+ 6 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 132405#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 132367#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 132419#(or (<= (+ 6 ~X~0) thread2Thread1of1ForFork0_~x~1) (<= 9993 ~X~0)), 132420#(or (<= 9993 ~X~0) (<= (+ 5 ~X~0) thread2Thread1of1ForFork0_~x~1)), 132402#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1)) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 132356#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= (+ 7 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 132426#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 6 ~X~0)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 132397#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 132370#(or (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 132358#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 132359#(or (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 132384#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 132378#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 132369#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 132343#(or (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 132424#(or (<= (+ ~X~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9993 ~X~0)), 132408#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 132345#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 9994)), 132365#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 132368#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 132399#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 6 thread2Thread1of1ForFork0_~x~1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 132423#(or (<= 9993 ~X~0) (<= (+ 2 ~X~0) thread2Thread1of1ForFork0_~x~1)), 132380#(or (<= (+ thread1Thread1of1ForFork1_~x~0 8) thread2Thread1of1ForFork0_~x~1) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 132398#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ 7 thread2Thread1of1ForFork0_~x~1))), 132407#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 132429#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 ~X~0)) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 132409#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 132394#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 5 thread2Thread1of1ForFork0_~x~1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 132391#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 132340#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 9995)), 132379#(or (<= thread1Thread1of1ForFork1_~x~0 9991) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 132341#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 132430#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 ~X~0)) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 132427#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 5 ~X~0)) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 132417#(or (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 132421#(or (<= 9993 ~X~0) (<= (+ ~X~0 4) thread2Thread1of1ForFork0_~x~1)), 132416#(or (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 132352#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 132395#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 4))), 132414#(or (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 132404#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 132373#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 132344#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1)), 132375#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1)), 132433#(or (<= 9993 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 ~X~0)), 132412#(or (<= (+ 6 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 132387#(or (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 4)) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 132337#(or (<= thread1Thread1of1ForFork1_~x~0 9998) (not (< thread1Thread1of1ForFork1_~x~0 10000))), 132360#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1)), 132361#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= (+ 2 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 132382#(or (<= 9993 ~X~0) (<= (+ ~X~0 8) thread2Thread1of1ForFork0_~x~1)), 132350#(or (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 132386#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ 5 thread2Thread1of1ForFork0_~x~1))), 132390#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1))), 132411#(or (<= 9993 thread1Thread1of1ForFork1_~x~0) (<= (+ 7 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 132406#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 2 thread2Thread1of1ForFork0_~x~1)) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 132432#(or (<= thread1Thread1of1ForFork1_~x~0 thread2Thread1of1ForFork0_~x~1) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 132422#(or (<= (+ 3 ~X~0) thread2Thread1of1ForFork0_~x~1) (<= 9993 ~X~0)), 132339#(or (<= thread1Thread1of1ForFork1_~x~0 9996) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 132401#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 4))), 132388#(or (<= thread1Thread1of1ForFork1_~x~0 (+ 3 thread2Thread1of1ForFork0_~x~1)) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 132434#(or (<= 9993 ~X~0) (<= ~X~0 thread2Thread1of1ForFork0_~x~1)), 132346#(or (<= (+ 5 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 132357#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= (+ 6 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 132383#(or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 4))), 132403#(or (<= (+ thread1Thread1of1ForFork1_~x~0 1) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 132400#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ 5 thread2Thread1of1ForFork0_~x~1))), 132410#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread1Thread1of1ForFork1_~x~0 (+ thread2Thread1of1ForFork0_~x~1 1))), 132362#(or (<= (+ 3 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 132364#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= (+ 5 thread1Thread1of1ForFork1_~x~0) thread2Thread1of1ForFork0_~x~1)), 132363#(or (<= (+ thread1Thread1of1ForFork1_~x~0 4) thread2Thread1of1ForFork0_~x~1) (<= 9995 thread1Thread1of1ForFork1_~x~0))] [2022-03-15 19:57:15,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 119 states [2022-03-15 19:57:15,828 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:57:15,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2022-03-15 19:57:15,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=14559, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 19:57:15,830 INFO L87 Difference]: Start difference. First operand 2108 states and 5575 transitions. Second operand has 119 states, 119 states have (on average 2.991596638655462) internal successors, (356), 119 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:58:11,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:58:11,477 INFO L93 Difference]: Finished difference Result 10798 states and 25865 transitions. [2022-03-15 19:58:11,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 737 states. [2022-03-15 19:58:11,477 INFO L78 Accepts]: Start accepts. Automaton has has 119 states, 119 states have (on average 2.991596638655462) internal successors, (356), 119 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:58:11,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:58:11,492 INFO L225 Difference]: With dead ends: 10798 [2022-03-15 19:58:11,492 INFO L226 Difference]: Without dead ends: 10774 [2022-03-15 19:58:11,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1750 GetRequests, 903 SyntacticMatches, 5 SemanticMatches, 842 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281744 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=133903, Invalid=577589, Unknown=0, NotChecked=0, Total=711492 [2022-03-15 19:58:11,526 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 627 mSDsluCounter, 3137 mSDsCounter, 0 mSdLazyCounter, 8445 mSolverCounterSat, 1123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1123 IncrementalHoareTripleChecker+Valid, 8445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:58:11,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [627 Valid, 0 Invalid, 9568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1123 Valid, 8445 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-03-15 19:58:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10774 states. [2022-03-15 19:58:11,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10774 to 2404. [2022-03-15 19:58:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2403 states have (on average 2.6566791510611734) internal successors, (6384), 2403 states have internal predecessors, (6384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:58:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 6384 transitions. [2022-03-15 19:58:11,595 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 6384 transitions. Word has length 30 [2022-03-15 19:58:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:58:11,595 INFO L470 AbstractCegarLoop]: Abstraction has 2404 states and 6384 transitions. [2022-03-15 19:58:11,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 119 states, 119 states have (on average 2.991596638655462) internal successors, (356), 119 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:58:11,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 6384 transitions. [2022-03-15 19:58:11,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:58:11,598 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:58:11,598 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:58:11,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-03-15 19:58:11,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:58:11,811 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:58:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:58:11,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1540731322, now seen corresponding path program 28 times [2022-03-15 19:58:11,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:58:11,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031279083] [2022-03-15 19:58:11,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:58:11,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:58:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:58:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:58:11,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:58:11,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031279083] [2022-03-15 19:58:11,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031279083] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:58:11,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502887787] [2022-03-15 19:58:11,940 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:58:11,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:58:11,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:58:11,941 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:58:11,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-03-15 19:58:11,997 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:58:11,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:58:11,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:58:11,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:58:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:58:12,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:58:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:58:12,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502887787] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:58:12,208 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:58:12,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2022-03-15 19:58:12,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [963687925] [2022-03-15 19:58:12,209 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:58:12,210 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:58:12,231 INFO L252 McrAutomatonBuilder]: Finished intersection with 272 states and 612 transitions. [2022-03-15 19:58:12,231 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:58:15,546 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 100 new interpolants: [150418#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 150456#(or (<= 9993 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 150431#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9994)), 150442#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 150419#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 150433#(or (<= thread2Thread1of1ForFork0_~x~1 9994) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 150492#(<= (+ 5 ~X~0) thread1Thread1of1ForFork1_~x~0), 150397#(<= 10000 thread1Thread1of1ForFork1_~x~0), 150404#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 150432#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9994)), 150487#(<= ~X~0 9991), 150482#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9992 ~X~0)), 150438#(<= 9995 thread1Thread1of1ForFork1_~x~0), 150414#(<= 9997 thread1Thread1of1ForFork1_~x~0), 150471#(or (<= thread2Thread1of1ForFork0_~x~1 9992) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 150469#(or (<= 9992 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 150401#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 150461#(or (<= 9993 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 150483#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9992 ~X~0)), 150447#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (< thread2Thread1of1ForFork0_~x~1 10000)), 150398#(<= 9999 thread1Thread1of1ForFork1_~x~0), 150476#(or (<= thread2Thread1of1ForFork0_~x~1 9992) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 150412#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 150407#(or (<= thread2Thread1of1ForFork0_~x~1 9994) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 150403#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 150411#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 150474#(or (<= thread2Thread1of1ForFork0_~x~1 9992) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 150406#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 150425#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 150473#(or (<= thread2Thread1of1ForFork0_~x~1 9992) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 150439#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 150453#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 150437#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 150422#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 150493#(<= (+ ~X~0 4) thread1Thread1of1ForFork1_~x~0), 150467#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9992 thread1Thread1of1ForFork1_~x~0)), 150410#(or (<= thread2Thread1of1ForFork0_~x~1 9998) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 150416#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 150455#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 150426#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 150495#(<= (+ 2 ~X~0) thread1Thread1of1ForFork1_~x~0), 150440#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 150481#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9992 ~X~0)), 150424#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 150480#(or (<= 9992 ~X~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 150460#(or (<= thread2Thread1of1ForFork0_~x~1 9994) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 150491#(<= thread2Thread1of1ForFork0_~x~1 ~X~0), 150423#(or (<= 9996 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 150446#(<= 9994 thread1Thread1of1ForFork1_~x~0), 150485#(or (<= 9992 ~X~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 150490#(<= (+ 6 ~X~0) thread1Thread1of1ForFork1_~x~0), 150468#(or (<= thread2Thread1of1ForFork0_~x~1 9994) (<= 9992 thread1Thread1of1ForFork1_~x~0)), 150408#(or (<= 10000 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 150400#(or (<= thread2Thread1of1ForFork0_~x~1 9999) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 150427#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 150405#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 150409#(or (<= thread2Thread1of1ForFork0_~x~1 9992) (<= 10000 thread1Thread1of1ForFork1_~x~0)), 150463#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9992 thread1Thread1of1ForFork1_~x~0)), 150477#(or (<= thread2Thread1of1ForFork0_~x~1 9992) (<= 9992 thread1Thread1of1ForFork1_~x~0)), 150458#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 150484#(or (<= 9992 ~X~0) (<= thread2Thread1of1ForFork0_~x~1 9994)), 150489#(<= (+ 7 ~X~0) thread1Thread1of1ForFork1_~x~0), 150479#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9992 ~X~0)), 150486#(or (<= thread2Thread1of1ForFork0_~x~1 9992) (<= 9992 ~X~0)), 150457#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 150435#(or (<= 9998 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 150421#(<= 9996 thread1Thread1of1ForFork1_~x~0), 150441#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 150496#(<= (+ ~X~0 1) thread1Thread1of1ForFork1_~x~0), 150415#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 150399#(<= 9998 thread1Thread1of1ForFork1_~x~0), 150494#(<= (+ 3 ~X~0) thread1Thread1of1ForFork1_~x~0), 150436#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 150450#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9996)), 150454#(<= 9993 thread1Thread1of1ForFork1_~x~0), 150417#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 150402#(or (< thread2Thread1of1ForFork0_~x~1 10000) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 150451#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9995)), 150449#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9997)), 150448#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 150472#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9992)), 150465#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9992 thread1Thread1of1ForFork1_~x~0)), 150478#(<= 9992 ~X~0), 150444#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9994)), 150452#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9994)), 150459#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9993 thread1Thread1of1ForFork1_~x~0)), 150429#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9996 thread1Thread1of1ForFork1_~x~0)), 150428#(or (<= 9997 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9995)), 150413#(or (<= thread2Thread1of1ForFork0_~x~1 9997) (<= 9998 thread1Thread1of1ForFork1_~x~0)), 150430#(or (<= thread2Thread1of1ForFork0_~x~1 9994) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 150488#(<= (+ ~X~0 8) thread1Thread1of1ForFork1_~x~0), 150464#(or (<= 9992 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9998)), 150443#(or (<= thread2Thread1of1ForFork0_~x~1 9995) (<= 9995 thread1Thread1of1ForFork1_~x~0)), 150475#(or (<= 9994 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9992)), 150420#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9997 thread1Thread1of1ForFork1_~x~0)), 150434#(or (<= thread2Thread1of1ForFork0_~x~1 9993) (<= 9999 thread1Thread1of1ForFork1_~x~0)), 150462#(<= 9992 thread1Thread1of1ForFork1_~x~0), 150445#(or (<= 9995 thread1Thread1of1ForFork1_~x~0) (<= thread2Thread1of1ForFork0_~x~1 9993)), 150466#(or (<= thread2Thread1of1ForFork0_~x~1 9996) (<= 9992 thread1Thread1of1ForFork1_~x~0)), 150470#(or (<= thread2Thread1of1ForFork0_~x~1 9992) (<= 9999 thread1Thread1of1ForFork1_~x~0))] [2022-03-15 19:58:15,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2022-03-15 19:58:15,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:58:15,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2022-03-15 19:58:15,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3873, Invalid=13157, Unknown=0, NotChecked=0, Total=17030 [2022-03-15 19:58:15,550 INFO L87 Difference]: Start difference. First operand 2404 states and 6384 transitions. Second operand has 121 states, 121 states have (on average 3.0578512396694215) internal successors, (370), 121 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:58:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:58:46,562 INFO L93 Difference]: Finished difference Result 7880 states and 20874 transitions. [2022-03-15 19:58:46,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 680 states. [2022-03-15 19:58:46,562 INFO L78 Accepts]: Start accepts. Automaton has has 121 states, 121 states have (on average 3.0578512396694215) internal successors, (370), 121 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-03-15 19:58:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:58:46,572 INFO L225 Difference]: With dead ends: 7880 [2022-03-15 19:58:46,572 INFO L226 Difference]: Without dead ends: 7460 [2022-03-15 19:58:46,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1638 GetRequests, 848 SyntacticMatches, 2 SemanticMatches, 788 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292648 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=118122, Invalid=505188, Unknown=0, NotChecked=0, Total=623310 [2022-03-15 19:58:46,605 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 127 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 5735 mSolverCounterSat, 790 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 790 IncrementalHoareTripleChecker+Valid, 5735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:58:46,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 0 Invalid, 6525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [790 Valid, 5735 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 19:58:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7460 states. [2022-03-15 19:58:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7460 to 2254. [2022-03-15 19:58:46,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2253 states have (on average 2.6644474034620504) internal successors, (6003), 2253 states have internal predecessors, (6003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:58:46,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 6003 transitions. [2022-03-15 19:58:46,653 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 6003 transitions. Word has length 30 [2022-03-15 19:58:46,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:58:46,653 INFO L470 AbstractCegarLoop]: Abstraction has 2254 states and 6003 transitions. [2022-03-15 19:58:46,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 3.0578512396694215) internal successors, (370), 121 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:58:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 6003 transitions. [2022-03-15 19:58:46,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:58:46,656 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:58:46,657 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:58:46,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-03-15 19:58:46,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:58:46,863 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:58:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:58:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash 658364115, now seen corresponding path program 29 times [2022-03-15 19:58:46,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:58:46,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577851966] [2022-03-15 19:58:46,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:58:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:58:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:58:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 36 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:58:47,090 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:58:47,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577851966] [2022-03-15 19:58:47,090 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577851966] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:58:47,090 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169106122] [2022-03-15 19:58:47,090 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:58:47,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:58:47,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:58:47,092 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:58:47,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-03-15 19:58:47,149 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:58:47,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:58:47,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:58:47,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:58:47,255 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-03-15 19:58:47,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:58:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-03-15 19:58:47,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169106122] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:58:47,399 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:58:47,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5, 5] total 29 [2022-03-15 19:58:47,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1369402616] [2022-03-15 19:58:47,400 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:58:47,402 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:58:47,425 INFO L252 McrAutomatonBuilder]: Finished intersection with 294 states and 665 transitions. [2022-03-15 19:58:47,425 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:58:54,440 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 120 new interpolants: [165151#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19985))), 165079#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= 10000 ~Y~0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19997))), 165126#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 165104#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 165083#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 165123#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 165121#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (not (< thread1Thread1of1ForFork1_~x~0 9994)) (<= 10000 ~Y~0))), 165180#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19990))), 165132#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 165147#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 165110#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 165160#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9992))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19985) (not (< thread1Thread1of1ForFork1_~x~0 9992)))), 165119#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989))), 165102#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0))), 165074#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 165143#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= 10000 ~Y~0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19992))), 165108#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (<= 10000 ~Y~0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 165087#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9996)))), 165181#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19989))), 165182#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19988) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 165185#(and (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19985) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 165118#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 165172#(and (or (not (< ~X~0 9992)) (<= (+ ~Y~0 ~X~0) 19991)) (or (not (< ~X~0 9992)) (<= 10000 ~Y~0))), 165133#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988))), 165122#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 165167#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19986))), 165093#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 165148#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988))), 165164#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 165171#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9992))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19982) (not (< thread1Thread1of1ForFork1_~x~0 9992)))), 165129#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 165084#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 165170#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19983) (not (< thread1Thread1of1ForFork1_~x~0 9993))) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 165130#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 165125#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 165081#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 165145#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 165107#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990))), 165168#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19985) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 165169#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (not (< thread1Thread1of1ForFork1_~x~0 9994)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19984))), 165112#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 165092#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0))), 165162#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9992))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19983) (not (< thread1Thread1of1ForFork1_~x~0 9992)))), 165177#(and (or (not (< ~X~0 9992)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19987)) (or (not (< ~X~0 9992)) (= ~Y~0 0))), 165089#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19996))), 165091#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 165159#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9992))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19986) (not (< thread1Thread1of1ForFork1_~x~0 9992)))), 165144#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 165173#(and (or (not (< ~X~0 9992)) (= ~Y~0 0)) (or (not (< ~X~0 9992)) (<= (+ ~Y~0 ~X~0 thread2Thread1of1ForFork0_~x~1) 19991))), 165179#(and (or (not (< ~X~0 9992)) (= ~Y~0 0)) (or (not (< ~X~0 9992)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19985))), 165090#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 165149#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19987))), 165188#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9992))) (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19982) (not (< thread1Thread1of1ForFork1_~x~0 9992)))), 165176#(and (or (not (< ~X~0 9992)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19988)) (or (not (< ~X~0 9992)) (= ~Y~0 0))), 165105#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 165178#(and (or (not (< ~X~0 9992)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19986)) (or (not (< ~X~0 9992)) (= ~Y~0 0))), 165134#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19987) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 165106#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 165136#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 165139#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988))), 165088#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 165128#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19987) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 165175#(and (or (not (< ~X~0 9992)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19989)) (or (not (< ~X~0 9992)) (= ~Y~0 0))), 165155#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990) (not (< thread1Thread1of1ForFork1_~x~0 9992))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9992)))), 165101#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 165146#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 165166#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19987)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 165152#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19984)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 165113#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 165140#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19987))), 165165#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (not (< thread1Thread1of1ForFork1_~x~0 9998)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988))), 165186#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19984) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 165190#(and (or (not (< ~X~0 9992)) (= ~Y~0 0)) (or (not (< ~X~0 9992)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19983))), 165080#(and (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 165138#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 165094#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 165115#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 165161#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9992)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19984)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9992)))), 165189#(and (or (not (< ~X~0 9992)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19984)) (or (not (< ~X~0 9992)) (= ~Y~0 0))), 165095#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 165073#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19999) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (not (< thread1Thread1of1ForFork1_~x~0 10000)) (<= 10000 ~Y~0))), 165086#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995))), 165116#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 165076#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 165117#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 165137#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 165157#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9992))) (or (not (< thread1Thread1of1ForFork1_~x~0 9992)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988))), 165103#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 165096#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0))), 165187#(and (or (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19983) (not (< thread1Thread1of1ForFork1_~x~0 9993))) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 165156#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989) (not (< thread1Thread1of1ForFork1_~x~0 9992))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9992)))), 165192#(or (not (< ~X~0 9992)) (= ~Y~0 0)), 165135#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (not (< thread1Thread1of1ForFork1_~x~0 9994)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19986))), 165163#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 165154#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9992))) (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9992)))), 165099#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 165150#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19986)) (or (not (< thread1Thread1of1ForFork1_~x~0 9993)) (= ~Y~0 0))), 165184#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19986))), 165131#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19990) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 165120#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 165141#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19986) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 165078#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19997) (not (< thread1Thread1of1ForFork1_~x~0 9999)))), 165077#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 165174#(and (or (not (< ~X~0 9992)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19990)) (or (not (< ~X~0 9992)) (= ~Y~0 0))), 165124#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19991) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 165127#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9994)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19988)) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 165098#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 10000))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19995) (not (< thread1Thread1of1ForFork1_~x~0 10000)))), 165082#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19996)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= 10000 ~Y~0))), 165085#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= 10000 ~Y~0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19995))), 165142#(and (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9994))) (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19985) (not (< thread1Thread1of1ForFork1_~x~0 9994)))), 165191#(and (or (not (< ~X~0 9992)) (<= (+ ~X~0 thread2Thread1of1ForFork0_~x~1) 19982)) (or (not (< ~X~0 9992)) (= ~Y~0 0))), 165111#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 165075#(and (or (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19998) (not (< thread1Thread1of1ForFork1_~x~0 9999))) (or (not (< thread1Thread1of1ForFork1_~x~0 9999)) (<= 10000 ~Y~0))), 165109#(and (or (<= (+ ~Y~0 thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19994) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 165097#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9996)) (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19992))), 165114#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19989) (not (< thread1Thread1of1ForFork1_~x~0 9995))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9995)))), 165153#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9992)) (<= (+ ~Y~0 thread1Thread1of1ForFork1_~x~0) 19991)) (or (<= 10000 ~Y~0) (not (< thread1Thread1of1ForFork1_~x~0 9992)))), 165183#(and (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (= ~Y~0 0)) (or (not (< thread1Thread1of1ForFork1_~x~0 9997)) (<= (+ ~X~0 thread1Thread1of1ForFork1_~x~0) 19987))), 165100#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19993) (not (< thread1Thread1of1ForFork1_~x~0 9998))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9998)))), 165158#(and (or (<= (+ thread2Thread1of1ForFork0_~x~1 thread1Thread1of1ForFork1_~x~0) 19987) (not (< thread1Thread1of1ForFork1_~x~0 9992))) (or (= ~Y~0 0) (not (< thread1Thread1of1ForFork1_~x~0 9992))))] [2022-03-15 19:58:54,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 145 states [2022-03-15 19:58:54,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:58:54,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2022-03-15 19:58:54,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2123, Invalid=20527, Unknown=0, NotChecked=0, Total=22650 [2022-03-15 19:58:54,443 INFO L87 Difference]: Start difference. First operand 2254 states and 6003 transitions. Second operand has 145 states, 144 states have (on average 2.8680555555555554) internal successors, (413), 144 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 20:01:33,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1258 states. [2022-03-15 20:01:33,410 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 20:01:33,410 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 20:01:33,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1592 GetRequests, 192 SyntacticMatches, 4 SemanticMatches, 1395 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947575 ImplicationChecksByTransitivity, 151.0s TimeCoverageRelationStatistics Valid=284730, Invalid=1665482, Unknown=0, NotChecked=0, Total=1950212 [2022-03-15 20:01:33,482 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 3188 mSDsCounter, 0 mSdLazyCounter, 8899 mSolverCounterSat, 3909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 12808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3909 IncrementalHoareTripleChecker+Valid, 8899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-03-15 20:01:33,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 12808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3909 Valid, 8899 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-03-15 20:01:33,483 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-15 20:01:33,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-03-15 20:01:33,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-03-15 20:01:33,684 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (2254states) and FLOYD_HOARE automaton (currently 1258 states, 145 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1397 known predicates. [2022-03-15 20:01:33,685 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 20:01:33,685 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 20:01:33,687 INFO L732 BasicCegarLoop]: Path program histogram: [29, 2, 2, 1] [2022-03-15 20:01:33,688 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 20:01:33,688 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 20:01:33,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 08:01:33 BasicIcfg [2022-03-15 20:01:33,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 20:01:33,690 INFO L158 Benchmark]: Toolchain (without parser) took 735277.16ms. Allocated memory was 186.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 136.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 387.0MB. Max. memory is 8.0GB. [2022-03-15 20:01:33,690 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 20:01:33,690 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.34ms. Allocated memory is still 186.6MB. Free memory was 136.5MB in the beginning and 161.7MB in the end (delta: -25.2MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-03-15 20:01:33,690 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.44ms. Allocated memory is still 186.6MB. Free memory was 161.7MB in the beginning and 160.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:01:33,690 INFO L158 Benchmark]: Boogie Preprocessor took 23.33ms. Allocated memory is still 186.6MB. Free memory was 160.3MB in the beginning and 159.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 20:01:33,690 INFO L158 Benchmark]: RCFGBuilder took 273.40ms. Allocated memory is still 186.6MB. Free memory was 159.2MB in the beginning and 147.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-15 20:01:33,690 INFO L158 Benchmark]: TraceAbstraction took 734769.34ms. Allocated memory was 186.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 147.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 397.7MB. Max. memory is 8.0GB. [2022-03-15 20:01:33,691 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.09ms. Allocated memory is still 186.6MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.34ms. Allocated memory is still 186.6MB. Free memory was 136.5MB in the beginning and 161.7MB in the end (delta: -25.2MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.44ms. Allocated memory is still 186.6MB. Free memory was 161.7MB in the beginning and 160.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.33ms. Allocated memory is still 186.6MB. Free memory was 160.3MB in the beginning and 159.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 273.40ms. Allocated memory is still 186.6MB. Free memory was 159.2MB in the beginning and 147.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 734769.34ms. Allocated memory was 186.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 147.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 397.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 88 PlacesBefore, 23 PlacesAfterwards, 87 TransitionsBefore, 18 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 6 FixpointIterations, 46 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 80 TotalNumberOfCompositions, 606 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 552, positive: 540, positive conditional: 0, positive unconditional: 540, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 304, positive: 302, positive conditional: 0, positive unconditional: 302, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 552, positive: 238, positive conditional: 0, positive unconditional: 238, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 304, unknown conditional: 0, unknown unconditional: 304] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - 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: 79]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (2254states) and FLOYD_HOARE automaton (currently 1258 states, 145 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1397 known predicates. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2254states) and FLOYD_HOARE automaton (currently 1258 states, 145 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1397 known predicates. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2254states) and FLOYD_HOARE automaton (currently 1258 states, 145 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 1397 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 104 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 734.7s, OverallIterations: 34, TraceHistogramMax: 9, PathProgramHistogramMax: 29, EmptinessCheckTime: 0.0s, AutomataDifference: 653.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.8s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5531 SdHoareTripleChecker+Valid, 38.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5531 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 33.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31012 mSDsCounter, 23036 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84099 IncrementalHoareTripleChecker+Invalid, 107135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23036 mSolverCounterUnsat, 0 mSDtfsCounter, 84099 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18221 GetRequests, 7377 SyntacticMatches, 125 SemanticMatches, 10718 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465268 ImplicationChecksByTransitivity, 618.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2404occurred in iteration=32, InterpolantAutomatonStates: 7877, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 33 MinimizatonAttempts, 73770 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 1364 NumberOfCodeBlocks, 1338 NumberOfCodeBlocksAsserted, 114 NumberOfCheckSat, 1908 ConstructedInterpolants, 0 QuantifiedInterpolants, 11570 SizeOfPredicates, 92 NumberOfNonLiveVariables, 4137 ConjunctsInSsa, 468 ConjunctsInUnsatCore, 93 InterpolantComputations, 6 PerfectInterpolantSequences, 1596/2753 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