/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:34:44,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:34:44,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:34:44,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:34:44,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:34:44,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:34:44,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:34:44,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:34:44,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:34:44,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:34:44,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:34:44,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:34:44,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:34:44,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:34:44,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:34:44,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:34:44,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:34:44,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:34:44,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:34:44,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:34:44,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:34:44,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:34:44,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:34:44,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:34:44,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:34:44,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:34:44,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:34:44,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:34:44,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:34:44,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:34:44,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:34:44,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:34:44,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:34:44,292 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:34:44,293 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:34:44,293 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:34:44,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:34:44,294 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:34:44,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:34:44,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:34:44,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:34:44,296 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:34:44,313 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:34:44,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:34:44,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:34:44,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:34:44,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:34:44,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:34:44,317 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:34:44,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:34:44,317 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:34:44,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:34:44,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:34:44,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:34:44,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:34:44,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:34:44,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:34:44,318 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:34:44,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:34:44,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:34:44,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:34:44,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:34:44,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:34:44,319 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:34:44,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:34:44,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:34:44,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:34:44,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:34:44,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:34:44,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:34:44,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:34:44,321 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:34:44,321 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:34:44,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:34:44,322 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:34:44,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:34:44,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:34:44,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:34:44,510 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:34:44,512 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:34:44,514 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c [2022-03-15 19:34:44,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d56bdc1e1/bef74f09b806478990db5022f83d280d/FLAG791f4d997 [2022-03-15 19:34:44,887 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:34:44,888 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c [2022-03-15 19:34:44,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d56bdc1e1/bef74f09b806478990db5022f83d280d/FLAG791f4d997 [2022-03-15 19:34:45,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d56bdc1e1/bef74f09b806478990db5022f83d280d [2022-03-15 19:34:45,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:34:45,305 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:34:45,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:34:45,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:34:45,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:34:45,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:34:45" (1/1) ... [2022-03-15 19:34:45,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15cc9105 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:34:45, skipping insertion in model container [2022-03-15 19:34:45,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:34:45" (1/1) ... [2022-03-15 19:34:45,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:34:45,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:34:45,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c[2098,2111] [2022-03-15 19:34:45,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:34:45,460 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:34:45,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c[2098,2111] [2022-03-15 19:34:45,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:34:45,488 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:34:45,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:34:45 WrapperNode [2022-03-15 19:34:45,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:34:45,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:34:45,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:34:45,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:34:45,495 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:34:45" (1/1) ... [2022-03-15 19:34:45,501 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:34:45" (1/1) ... [2022-03-15 19:34:45,517 INFO L137 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2022-03-15 19:34:45,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:34:45,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:34:45,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:34:45,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:34:45,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:34:45" (1/1) ... [2022-03-15 19:34:45,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:34:45" (1/1) ... [2022-03-15 19:34:45,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:34:45" (1/1) ... [2022-03-15 19:34:45,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:34:45" (1/1) ... [2022-03-15 19:34:45,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:34:45" (1/1) ... [2022-03-15 19:34:45,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:34:45" (1/1) ... [2022-03-15 19:34:45,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:34:45" (1/1) ... [2022-03-15 19:34:45,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:34:45,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:34:45,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:34:45,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:34:45,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:34:45" (1/1) ... [2022-03-15 19:34:45,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:34:45,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:45,573 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:34:45,605 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:34:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:34:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:34:45,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:34:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:34:45,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:34:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:34:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:34:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:34:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:34:45,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:34:45,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:34:45,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:34:45,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:34:45,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:34:45,620 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:34:45,674 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:34:45,675 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:34:45,822 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:34:45,849 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:34:45,849 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-15 19:34:45,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:34:45 BoogieIcfgContainer [2022-03-15 19:34:45,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:34:45,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:34:45,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:34:45,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:34:45,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:34:45" (1/3) ... [2022-03-15 19:34:45,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dd126b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:34:45, skipping insertion in model container [2022-03-15 19:34:45,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:34:45" (2/3) ... [2022-03-15 19:34:45,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dd126b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:34:45, skipping insertion in model container [2022-03-15 19:34:45,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:34:45" (3/3) ... [2022-03-15 19:34:45,856 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-nonblocking-cntr-alt.wvr.c [2022-03-15 19:34:45,859 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:34:45,859 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:34:45,860 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:34:45,860 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:34:45,889 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,889 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,890 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,890 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,890 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,890 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,891 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,892 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,892 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,892 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,892 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,892 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,894 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,894 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,894 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,899 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,900 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,900 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,900 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,901 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,901 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,901 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,902 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,902 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,902 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,903 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,908 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,908 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,908 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,908 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,909 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,909 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,909 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,909 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,910 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,910 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,910 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,910 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,913 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,914 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,914 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,914 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,914 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,915 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,915 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,915 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,915 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,915 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:34:45,919 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 19:34:45,952 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:34:45,962 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:34:45,962 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 19:34:45,971 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:34:45,977 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 86 transitions, 188 flow [2022-03-15 19:34:45,979 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 86 transitions, 188 flow [2022-03-15 19:34:45,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 86 transitions, 188 flow [2022-03-15 19:34:46,010 INFO L129 PetriNetUnfolder]: 6/84 cut-off events. [2022-03-15 19:34:46,010 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 19:34:46,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 84 events. 6/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 43 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-03-15 19:34:46,014 INFO L116 LiptonReduction]: Number of co-enabled transitions 404 [2022-03-15 19:34:47,856 INFO L131 LiptonReduction]: Checked pairs total: 465 [2022-03-15 19:34:47,856 INFO L133 LiptonReduction]: Total number of compositions: 77 [2022-03-15 19:34:47,865 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 18 transitions, 52 flow [2022-03-15 19:34:47,897 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:34:47,899 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:34:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 19:34:47,904 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:47,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:47,905 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:47,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:47,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1455699562, now seen corresponding path program 1 times [2022-03-15 19:34:47,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:47,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794440987] [2022-03-15 19:34:47,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:47,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:48,153 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:34:48,154 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:48,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794440987] [2022-03-15 19:34:48,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794440987] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:34:48,155 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:34:48,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 19:34:48,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1196726889] [2022-03-15 19:34:48,158 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:48,163 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:48,181 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 57 transitions. [2022-03-15 19:34:48,185 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:48,374 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [162#(< thread2Thread1of1ForFork1_~i~1 ~M2~0)] [2022-03-15 19:34:48,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:34:48,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:34:48,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:34:48,394 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 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:48,429 INFO L93 Difference]: Finished difference Result 42 states and 92 transitions. [2022-03-15 19:34:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 19:34:48,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 19:34:48,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:48,437 INFO L225 Difference]: With dead ends: 42 [2022-03-15 19:34:48,437 INFO L226 Difference]: Without dead ends: 42 [2022-03-15 19:34:48,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 19:34:48,441 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:48,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:34:48,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-15 19:34:48,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-03-15 19:34:48,467 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:34:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 92 transitions. [2022-03-15 19:34:48,469 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 92 transitions. Word has length 13 [2022-03-15 19:34:48,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:48,470 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 92 transitions. [2022-03-15 19:34:48,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 92 transitions. [2022-03-15 19:34:48,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 19:34:48,471 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:48,471 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:48,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:34:48,471 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:48,474 INFO L85 PathProgramCache]: Analyzing trace with hash 945835833, now seen corresponding path program 1 times [2022-03-15 19:34:48,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:48,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890185546] [2022-03-15 19:34:48,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:48,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:48,558 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:34:48,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:48,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890185546] [2022-03-15 19:34:48,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890185546] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:48,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152577368] [2022-03-15 19:34:48,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:48,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:48,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:48,561 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:34:48,562 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:34:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:48,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-15 19:34:48,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:48,688 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:34:48,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:48,754 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:34:48,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152577368] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:48,755 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:48,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-03-15 19:34:48,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1493249780] [2022-03-15 19:34:48,756 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:48,757 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:48,760 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 74 transitions. [2022-03-15 19:34:48,760 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:49,120 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:34:49,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:34:49,121 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:49,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:34:49,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:34:49,121 INFO L87 Difference]: Start difference. First operand 42 states and 92 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:49,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:49,175 INFO L93 Difference]: Finished difference Result 68 states and 151 transitions. [2022-03-15 19:34:49,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:34:49,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 19:34:49,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:49,176 INFO L225 Difference]: With dead ends: 68 [2022-03-15 19:34:49,176 INFO L226 Difference]: Without dead ends: 54 [2022-03-15 19:34:49,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:34:49,177 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:49,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:34:49,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-03-15 19:34:49,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2022-03-15 19:34:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 43 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 96 transitions. [2022-03-15 19:34:49,182 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 96 transitions. Word has length 14 [2022-03-15 19:34:49,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:49,182 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 96 transitions. [2022-03-15 19:34:49,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 96 transitions. [2022-03-15 19:34:49,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:34:49,183 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:49,183 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:49,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 19:34:49,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:49,384 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:49,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1578345181, now seen corresponding path program 1 times [2022-03-15 19:34:49,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:49,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151379927] [2022-03-15 19:34:49,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:49,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:49,515 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:34:49,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:49,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151379927] [2022-03-15 19:34:49,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151379927] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:49,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214402327] [2022-03-15 19:34:49,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:49,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:49,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:49,517 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:34:49,551 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:34:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:49,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 19:34:49,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:49,715 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:34:49,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:49,911 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:34:49,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214402327] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:49,911 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:49,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-03-15 19:34:49,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856137100] [2022-03-15 19:34:49,912 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:49,913 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:49,917 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 76 transitions. [2022-03-15 19:34:49,917 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:50,871 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [639#(and (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 640#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 643#(and (or (<= ~M1~0 (+ ~counter~0 1)) (< 1 ~M1~0) (not (< 0 ~M1~0))) (or (< 1 ~M1~0) (<= (+ ~counter~0 1) ~M1~0) (not (< 0 ~M1~0)))), 638#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 637#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 642#(and (or (< 1 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 1)) (< 1 ~M1~0) (not (< 0 ~M1~0))) (or (< 1 ~M1~0) (<= (+ ~counter~0 1) ~M1~0) (not (< 0 ~M1~0)))), 641#(and (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 636#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:34:50,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:34:50,871 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:50,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:34:50,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:34:50,872 INFO L87 Difference]: Start difference. First operand 44 states and 96 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:51,774 INFO L93 Difference]: Finished difference Result 148 states and 316 transitions. [2022-03-15 19:34:51,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:34:51,774 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 19:34:51,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:51,775 INFO L225 Difference]: With dead ends: 148 [2022-03-15 19:34:51,775 INFO L226 Difference]: Without dead ends: 138 [2022-03-15 19:34:51,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=289, Invalid=1603, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 19:34:51,776 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 95 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:51,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 26 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:34:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-03-15 19:34:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 70. [2022-03-15 19:34:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.3768115942028984) internal successors, (164), 69 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:34:51,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 164 transitions. [2022-03-15 19:34:51,783 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 164 transitions. Word has length 15 [2022-03-15 19:34:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:51,783 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 164 transitions. [2022-03-15 19:34:51,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 164 transitions. [2022-03-15 19:34:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:34:51,784 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:51,784 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:51,824 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:34:52,000 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,SelfDestructingSolverStorable2 [2022-03-15 19:34:52,001 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:52,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:52,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1683323300, now seen corresponding path program 2 times [2022-03-15 19:34:52,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:52,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303710765] [2022-03-15 19:34:52,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:52,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:52,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:52,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303710765] [2022-03-15 19:34:52,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303710765] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:52,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764998122] [2022-03-15 19:34:52,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:34:52,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:52,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:52,052 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:34:52,053 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:34:52,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:34:52,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:52,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:34:52,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:52,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:52,204 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:34:52,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764998122] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:52,204 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:52,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-03-15 19:34:52,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1794638795] [2022-03-15 19:34:52,205 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:52,207 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:52,212 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 88 transitions. [2022-03-15 19:34:52,212 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:52,527 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:34:52,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:34:52,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:52,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:34:52,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-15 19:34:52,528 INFO L87 Difference]: Start difference. First operand 70 states and 164 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:52,591 INFO L93 Difference]: Finished difference Result 152 states and 346 transitions. [2022-03-15 19:34:52,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:34:52,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 19:34:52,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:52,593 INFO L225 Difference]: With dead ends: 152 [2022-03-15 19:34:52,593 INFO L226 Difference]: Without dead ends: 130 [2022-03-15 19:34:52,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:34:52,594 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:52,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 9 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:34:52,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-03-15 19:34:52,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 94. [2022-03-15 19:34:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.4193548387096775) internal successors, (225), 93 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 225 transitions. [2022-03-15 19:34:52,599 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 225 transitions. Word has length 16 [2022-03-15 19:34:52,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:52,599 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 225 transitions. [2022-03-15 19:34:52,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 225 transitions. [2022-03-15 19:34:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:34:52,600 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:52,600 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:52,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 19:34:52,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:52,817 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:52,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:52,818 INFO L85 PathProgramCache]: Analyzing trace with hash 133556783, now seen corresponding path program 3 times [2022-03-15 19:34:52,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:52,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526599114] [2022-03-15 19:34:52,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:52,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:52,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:52,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526599114] [2022-03-15 19:34:52,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526599114] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:52,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55955195] [2022-03-15 19:34:52,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:34:52,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:52,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:52,956 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:34:52,957 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:34:52,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 19:34:52,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:52,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:34:52,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:53,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:53,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55955195] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:53,356 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:53,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-03-15 19:34:53,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1474012900] [2022-03-15 19:34:53,356 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:53,358 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:53,361 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 62 transitions. [2022-03-15 19:34:53,361 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:53,789 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [1518#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 1523#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 1519#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 1521#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 1522#(or (= ~M1~0 (+ ~counter~0 ~M2~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)), 1481#(or (= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread2Thread1of1ForFork1_~i~1 ~M2~0)), 1520#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0))))] [2022-03-15 19:34:53,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:34:53,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:53,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:34:53,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:34:53,793 INFO L87 Difference]: Start difference. First operand 94 states and 225 transitions. Second operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:54,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:54,643 INFO L93 Difference]: Finished difference Result 213 states and 466 transitions. [2022-03-15 19:34:54,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-03-15 19:34:54,643 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 19:34:54,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:54,644 INFO L225 Difference]: With dead ends: 213 [2022-03-15 19:34:54,644 INFO L226 Difference]: Without dead ends: 208 [2022-03-15 19:34:54,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=334, Invalid=1828, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:34:54,645 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 82 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:54,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 36 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:34:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-03-15 19:34:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 112. [2022-03-15 19:34:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.5225225225225225) internal successors, (280), 111 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 280 transitions. [2022-03-15 19:34:54,653 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 280 transitions. Word has length 16 [2022-03-15 19:34:54,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:54,654 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 280 transitions. [2022-03-15 19:34:54,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:54,654 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 280 transitions. [2022-03-15 19:34:54,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:34:54,655 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:54,655 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:54,672 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:34:54,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:54,872 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:54,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:54,872 INFO L85 PathProgramCache]: Analyzing trace with hash -804192011, now seen corresponding path program 4 times [2022-03-15 19:34:54,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:54,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630004314] [2022-03-15 19:34:54,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:54,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:55,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:55,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630004314] [2022-03-15 19:34:55,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630004314] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:55,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440897629] [2022-03-15 19:34:55,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:34:55,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:55,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:55,028 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:34:55,029 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:34:55,070 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:34:55,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:55,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-15 19:34:55,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:55,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:34:55,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440897629] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:55,417 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:55,417 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-03-15 19:34:55,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [329288627] [2022-03-15 19:34:55,417 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:55,419 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:55,423 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 88 transitions. [2022-03-15 19:34:55,423 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:56,320 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [2110#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 2121#(and (<= 2 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= ~counter~0 ~M1~0)), 2114#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 2122#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 2120#(and (= thread2Thread1of1ForFork1_~i~1 0) (= ~counter~0 0)), 2112#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 2116#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 2117#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0))), 2118#(and (or (< 2 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< 1 ~M1~0))) (or (< 2 ~M1~0) (<= (+ ~counter~0 2) ~M1~0) (not (< 1 ~M1~0))) (or (< 2 ~M1~0) (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 2115#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 2109#(and (<= 2 ~counter~0) (<= ~M1~0 ~counter~0) (<= ~counter~0 ~M1~0)), 2113#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 2111#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 2119#(and (or (< 2 ~M1~0) (<= (+ ~counter~0 2) ~M1~0) (not (< 1 ~M1~0))) (or (< 2 ~M1~0) (<= 0 ~counter~0) (not (< 1 ~M1~0))))] [2022-03-15 19:34:56,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 19:34:56,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:56,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 19:34:56,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:34:56,321 INFO L87 Difference]: Start difference. First operand 112 states and 280 transitions. Second operand has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:34:57,416 INFO L93 Difference]: Finished difference Result 204 states and 466 transitions. [2022-03-15 19:34:57,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:34:57,417 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 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:34:57,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:34:57,418 INFO L225 Difference]: With dead ends: 204 [2022-03-15 19:34:57,418 INFO L226 Difference]: Without dead ends: 194 [2022-03-15 19:34:57,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=400, Invalid=2252, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:34:57,419 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 122 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:34:57,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 47 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:34:57,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-03-15 19:34:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 86. [2022-03-15 19:34:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 2.4705882352941178) internal successors, (210), 85 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 210 transitions. [2022-03-15 19:34:57,425 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 210 transitions. Word has length 16 [2022-03-15 19:34:57,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:34:57,426 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 210 transitions. [2022-03-15 19:34:57,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:34:57,426 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 210 transitions. [2022-03-15 19:34:57,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:34:57,427 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:34:57,427 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:34:57,444 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:34:57,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:57,643 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:34:57,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:34:57,644 INFO L85 PathProgramCache]: Analyzing trace with hash -360549304, now seen corresponding path program 5 times [2022-03-15 19:34:57,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:34:57,645 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777628249] [2022-03-15 19:34:57,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:34:57,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:34:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:34:57,844 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:34:57,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:34:57,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777628249] [2022-03-15 19:34:57,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777628249] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:34:57,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022674745] [2022-03-15 19:34:57,845 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:34:57,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:34:57,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:34:57,852 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:34:57,854 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:34:57,897 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:34:57,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:34:57,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:34:57,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:34:58,099 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:34:58,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:34:58,346 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:34:58,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022674745] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:34:58,346 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:34:58,346 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-03-15 19:34:58,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [923371237] [2022-03-15 19:34:58,347 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:34:58,348 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:34:58,353 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 100 transitions. [2022-03-15 19:34:58,353 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:34:59,711 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [2656#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 2654#(and (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (= (+ (- 2) thread2Thread1of1ForFork1_~i~1) 0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 2661#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0))), 2655#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= 2 (+ thread2Thread1of1ForFork1_~i~1 1)))), 2663#(and (or (< 2 ~M1~0) (<= (+ ~counter~0 2) ~M1~0) (not (< 1 ~M1~0))) (or (< 2 ~M1~0) (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 2657#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 2660#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 2653#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 2658#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 2662#(and (or (< 2 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< 1 ~M1~0))) (or (< 2 ~M1~0) (<= (+ ~counter~0 2) ~M1~0) (not (< 1 ~M1~0))) (or (< 2 ~M1~0) (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 2659#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))] [2022-03-15 19:34:59,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:34:59,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:34:59,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:34:59,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:34:59,712 INFO L87 Difference]: Start difference. First operand 86 states and 210 transitions. Second operand has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:01,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:01,590 INFO L93 Difference]: Finished difference Result 235 states and 524 transitions. [2022-03-15 19:35:01,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 19:35:01,591 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 19:35:01,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:01,592 INFO L225 Difference]: With dead ends: 235 [2022-03-15 19:35:01,592 INFO L226 Difference]: Without dead ends: 220 [2022-03-15 19:35:01,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=633, Invalid=3923, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:35:01,593 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 154 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:01,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 47 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:35:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-03-15 19:35:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 102. [2022-03-15 19:35:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.5841584158415842) internal successors, (261), 101 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 261 transitions. [2022-03-15 19:35:01,599 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 261 transitions. Word has length 17 [2022-03-15 19:35:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:01,599 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 261 transitions. [2022-03-15 19:35:01,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 261 transitions. [2022-03-15 19:35:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:35:01,600 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:01,600 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:01,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 19:35:01,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:01,818 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:01,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:01,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1326230378, now seen corresponding path program 6 times [2022-03-15 19:35:01,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:01,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400757910] [2022-03-15 19:35:01,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:01,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:01,955 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:35:01,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:01,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400757910] [2022-03-15 19:35:01,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400757910] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:01,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049433333] [2022-03-15 19:35:01,956 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:35:01,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:01,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:01,957 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:35:01,958 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:35:02,027 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:35:02,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:02,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:35:02,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:02,188 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:35:02,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:02,511 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:35:02,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049433333] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:02,511 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:02,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2022-03-15 19:35:02,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [409826662] [2022-03-15 19:35:02,511 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:02,514 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:02,518 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 69 transitions. [2022-03-15 19:35:02,518 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:03,135 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [3288#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 3290#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 3286#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 3291#(and (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (= (+ (- 2) thread2Thread1of1ForFork1_~i~1) 0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 3287#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 3289#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0))))] [2022-03-15 19:35:03,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:35:03,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:03,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:35:03,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2022-03-15 19:35:03,137 INFO L87 Difference]: Start difference. First operand 102 states and 261 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:03,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:03,602 INFO L93 Difference]: Finished difference Result 181 states and 410 transitions. [2022-03-15 19:35:03,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 19:35:03,602 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 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:35:03,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:03,603 INFO L225 Difference]: With dead ends: 181 [2022-03-15 19:35:03,603 INFO L226 Difference]: Without dead ends: 168 [2022-03-15 19:35:03,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 19:35:03,604 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 74 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:03,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 25 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:35:03,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-03-15 19:35:03,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 104. [2022-03-15 19:35:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.5825242718446604) internal successors, (266), 103 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 266 transitions. [2022-03-15 19:35:03,610 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 266 transitions. Word has length 17 [2022-03-15 19:35:03,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:03,610 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 266 transitions. [2022-03-15 19:35:03,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 266 transitions. [2022-03-15 19:35:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:35:03,611 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:03,611 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:03,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 19:35:03,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:03,827 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:03,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash 295324371, now seen corresponding path program 7 times [2022-03-15 19:35:03,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:03,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133913473] [2022-03-15 19:35:03,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:03,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:03,941 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:03,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133913473] [2022-03-15 19:35:03,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133913473] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:03,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351666327] [2022-03-15 19:35:03,942 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:35:03,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:03,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:03,943 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:35:03,950 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:35:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:04,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 19:35:04,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:04,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:04,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351666327] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:04,460 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:04,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 21 [2022-03-15 19:35:04,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1725939146] [2022-03-15 19:35:04,460 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:04,462 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:04,465 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 70 transitions. [2022-03-15 19:35:04,465 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:05,034 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [3789#(or (and (<= thread1Thread1of1ForFork0_~i~0 (+ ~counter~0 ~M2~0)) (<= (+ ~counter~0 ~M2~0) thread1Thread1of1ForFork0_~i~0)) (< thread2Thread1of1ForFork1_~i~1 ~M2~0)), 3821#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 3818#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 3819#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 3823#(and (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread2Thread1of1ForFork1_~i~1 ~M2~0)) (or (<= thread1Thread1of1ForFork0_~i~0 (+ ~counter~0 ~M2~0)) (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread2Thread1of1ForFork1_~i~1 ~M2~0))), 3822#(and (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread2Thread1of1ForFork1_~i~1 ~M2~0)) (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread2Thread1of1ForFork1_~i~1 ~M2~0))), 3820#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0))))] [2022-03-15 19:35:05,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 19:35:05,034 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:05,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 19:35:05,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:35:05,035 INFO L87 Difference]: Start difference. First operand 104 states and 266 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:05,631 INFO L93 Difference]: Finished difference Result 179 states and 410 transitions. [2022-03-15 19:35:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:35:05,631 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 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:35:05,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:05,632 INFO L225 Difference]: With dead ends: 179 [2022-03-15 19:35:05,632 INFO L226 Difference]: Without dead ends: 166 [2022-03-15 19:35:05,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=268, Invalid=1454, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 19:35:05,634 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 63 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:05,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 24 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:35:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-03-15 19:35:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 102. [2022-03-15 19:35:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.5247524752475248) internal successors, (255), 101 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 255 transitions. [2022-03-15 19:35:05,638 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 255 transitions. Word has length 17 [2022-03-15 19:35:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:05,638 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 255 transitions. [2022-03-15 19:35:05,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 255 transitions. [2022-03-15 19:35:05,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:35:05,639 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:05,639 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:05,660 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:35:05,847 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,SelfDestructingSolverStorable8 [2022-03-15 19:35:05,847 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:05,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1707136409, now seen corresponding path program 8 times [2022-03-15 19:35:05,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:05,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86472370] [2022-03-15 19:35:05,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:05,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:05,926 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:05,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86472370] [2022-03-15 19:35:05,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86472370] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:05,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530546539] [2022-03-15 19:35:05,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:35:05,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:05,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:05,943 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:35:05,944 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:35:05,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:35:05,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:05,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 19:35:05,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:06,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:06,155 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:35:06,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530546539] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:06,155 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:06,157 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-03-15 19:35:06,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [493776748] [2022-03-15 19:35:06,157 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:06,158 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:06,164 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 112 transitions. [2022-03-15 19:35:06,164 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:06,600 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:35:06,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 19:35:06,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:06,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 19:35:06,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:35:06,601 INFO L87 Difference]: Start difference. First operand 102 states and 255 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:06,672 INFO L93 Difference]: Finished difference Result 244 states and 581 transitions. [2022-03-15 19:35:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:35:06,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 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:35:06,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:06,673 INFO L225 Difference]: With dead ends: 244 [2022-03-15 19:35:06,673 INFO L226 Difference]: Without dead ends: 218 [2022-03-15 19:35:06,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-03-15 19:35:06,674 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:06,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 16 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:35:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-03-15 19:35:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 132. [2022-03-15 19:35:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.564885496183206) internal successors, (336), 131 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 336 transitions. [2022-03-15 19:35:06,678 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 336 transitions. Word has length 18 [2022-03-15 19:35:06,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:06,678 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 336 transitions. [2022-03-15 19:35:06,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:06,678 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 336 transitions. [2022-03-15 19:35:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:35:06,679 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:06,679 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:06,698 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:35:06,879 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,SelfDestructingSolverStorable9 [2022-03-15 19:35:06,879 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:06,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:06,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1329615576, now seen corresponding path program 9 times [2022-03-15 19:35:06,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:06,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894309855] [2022-03-15 19:35:06,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:06,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:07,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:07,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894309855] [2022-03-15 19:35:07,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894309855] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:07,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559167041] [2022-03-15 19:35:07,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:35:07,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:07,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:07,053 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:35:07,056 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:35:07,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:35:07,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:07,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:35:07,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:07,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:07,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559167041] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:07,617 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:07,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-03-15 19:35:07,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1423810578] [2022-03-15 19:35:07,617 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:07,618 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:07,622 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 77 transitions. [2022-03-15 19:35:07,622 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:08,261 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [4992#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 4944#(or (and (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= ~M1~0 (+ ~counter~0 ~M2~0))) (< thread2Thread1of1ForFork1_~i~1 ~M2~0)), 4990#(and (or (< (+ ~counter~0 ~M2~0) ~M1~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 ~M2~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 4993#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 4991#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 4989#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 4995#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 4996#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 4994#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:35:08,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:35:08,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:08,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:35:08,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1142, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:35:08,263 INFO L87 Difference]: Start difference. First operand 132 states and 336 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 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:35:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:09,240 INFO L93 Difference]: Finished difference Result 289 states and 664 transitions. [2022-03-15 19:35:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:35:09,241 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 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 18 [2022-03-15 19:35:09,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:09,242 INFO L225 Difference]: With dead ends: 289 [2022-03-15 19:35:09,242 INFO L226 Difference]: Without dead ends: 284 [2022-03-15 19:35:09,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=408, Invalid=2562, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:35:09,244 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 97 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:09,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 39 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:35:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-03-15 19:35:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 152. [2022-03-15 19:35:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.6887417218543046) internal successors, (406), 151 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 406 transitions. [2022-03-15 19:35:09,250 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 406 transitions. Word has length 18 [2022-03-15 19:35:09,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:09,250 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 406 transitions. [2022-03-15 19:35:09,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 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:35:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 406 transitions. [2022-03-15 19:35:09,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:35:09,251 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:09,251 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:09,268 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:35:09,467 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,SelfDestructingSolverStorable10 [2022-03-15 19:35:09,468 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:09,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:09,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1812181760, now seen corresponding path program 10 times [2022-03-15 19:35:09,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:09,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782967617] [2022-03-15 19:35:09,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:09,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:09,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:09,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782967617] [2022-03-15 19:35:09,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782967617] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:09,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099840864] [2022-03-15 19:35:09,616 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:35:09,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:09,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:09,617 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:35:09,618 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:35:09,684 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:35:09,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:09,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:35:09,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:09,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:10,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099840864] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:10,054 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:10,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 26 [2022-03-15 19:35:10,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [61907620] [2022-03-15 19:35:10,054 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:10,055 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:10,058 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 68 transitions. [2022-03-15 19:35:10,059 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:10,616 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [5756#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 5760#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 5758#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 5761#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 5712#(or (and (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= ~M1~0 (+ ~counter~0 ~M2~0))) (< thread2Thread1of1ForFork1_~i~1 ~M2~0)), 5759#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 5757#(and (or (< (+ ~counter~0 ~M2~0) ~M1~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 ~M2~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))] [2022-03-15 19:35:10,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:35:10,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:10,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:35:10,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:35:10,617 INFO L87 Difference]: Start difference. First operand 152 states and 406 transitions. Second operand has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:11,490 INFO L93 Difference]: Finished difference Result 295 states and 713 transitions. [2022-03-15 19:35:11,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-15 19:35:11,491 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 19:35:11,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:11,492 INFO L225 Difference]: With dead ends: 295 [2022-03-15 19:35:11,492 INFO L226 Difference]: Without dead ends: 290 [2022-03-15 19:35:11,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 9 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=360, Invalid=2502, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:35:11,493 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 86 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:11,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 31 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:35:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-03-15 19:35:11,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 140. [2022-03-15 19:35:11,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.6043165467625897) internal successors, (362), 139 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 362 transitions. [2022-03-15 19:35:11,497 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 362 transitions. Word has length 18 [2022-03-15 19:35:11,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:11,497 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 362 transitions. [2022-03-15 19:35:11,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.6666666666666665) internal successors, (48), 18 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 362 transitions. [2022-03-15 19:35:11,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:35:11,498 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:11,498 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:11,519 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:35:11,714 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,SelfDestructingSolverStorable11 [2022-03-15 19:35:11,715 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:11,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:11,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1921584921, now seen corresponding path program 11 times [2022-03-15 19:35:11,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:11,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926338516] [2022-03-15 19:35:11,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:11,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:11,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:11,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926338516] [2022-03-15 19:35:11,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926338516] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:11,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782918995] [2022-03-15 19:35:11,869 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:35:11,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:11,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:11,885 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:35:11,886 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:35:11,930 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:35:11,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:11,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 19:35:11,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:12,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:12,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782918995] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:12,861 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:12,861 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-03-15 19:35:12,862 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1777284870] [2022-03-15 19:35:12,862 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:12,863 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:12,866 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 72 transitions. [2022-03-15 19:35:12,867 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:13,618 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [6506#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))), 6509#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 6508#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))), 6507#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 6511#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 6510#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M2~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M2~0) (= 2 thread2Thread1of1ForFork1_~i~1)) (or (not (<= (+ ~M1~0 1) (+ ~counter~0 ~M2~0))) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= (+ thread2Thread1of1ForFork1_~i~1 1) ~M2~0)))] [2022-03-15 19:35:13,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 19:35:13,619 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:13,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 19:35:13,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:35:13,619 INFO L87 Difference]: Start difference. First operand 140 states and 362 transitions. Second operand has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:14,290 INFO L93 Difference]: Finished difference Result 179 states and 447 transitions. [2022-03-15 19:35:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:35:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 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:35:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:14,292 INFO L225 Difference]: With dead ends: 179 [2022-03-15 19:35:14,292 INFO L226 Difference]: Without dead ends: 166 [2022-03-15 19:35:14,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=1569, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 19:35:14,293 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 42 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:14,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 28 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:35:14,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-03-15 19:35:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 146. [2022-03-15 19:35:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.613793103448276) internal successors, (379), 145 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 379 transitions. [2022-03-15 19:35:14,297 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 379 transitions. Word has length 18 [2022-03-15 19:35:14,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:14,297 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 379 transitions. [2022-03-15 19:35:14,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 379 transitions. [2022-03-15 19:35:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:35:14,298 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:14,298 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:14,327 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:35:14,511 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,SelfDestructingSolverStorable12 [2022-03-15 19:35:14,511 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:14,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash -974245202, now seen corresponding path program 12 times [2022-03-15 19:35:14,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:14,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622330787] [2022-03-15 19:35:14,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:14,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:14,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:14,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622330787] [2022-03-15 19:35:14,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622330787] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:14,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366549458] [2022-03-15 19:35:14,664 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:35:14,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:14,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:14,666 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:35:14,666 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:35:14,731 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:35:14,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:14,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 19:35:14,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:14,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:15,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366549458] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:15,150 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:15,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-03-15 19:35:15,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1456011871] [2022-03-15 19:35:15,150 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:15,152 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:15,157 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 112 transitions. [2022-03-15 19:35:15,158 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:16,399 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [7144#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 2 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 7147#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 7150#(and (= thread2Thread1of1ForFork1_~i~1 0) (= ~counter~0 0)), 7148#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 7149#(and (or (< 3 ~M1~0) (not (< 2 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (< 3 ~M1~0) (not (< 2 ~M1~0))) (or (<= (+ ~counter~0 3) ~M1~0) (< 3 ~M1~0) (not (< 2 ~M1~0)))), 7136#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 7142#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 7140#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 7139#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 7146#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0))), 7137#(and (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (= (+ (- 2) thread2Thread1of1ForFork1_~i~1) 0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 7141#(and (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= ~counter~0 ~M1~0) (<= 3 ~counter~0)), 7143#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 7138#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= 2 (+ thread2Thread1of1ForFork1_~i~1 1)))), 7152#(and (or (<= 0 ~counter~0) (< 3 ~M1~0) (not (< 2 ~M1~0))) (or (<= (+ ~counter~0 3) ~M1~0) (< 3 ~M1~0) (not (< 2 ~M1~0)))), 7135#(and (<= ~M1~0 ~counter~0) (<= ~counter~0 ~M1~0) (<= 3 ~counter~0)), 7151#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 7145#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:35:16,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 19:35:16,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:16,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 19:35:16,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1818, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:35:16,401 INFO L87 Difference]: Start difference. First operand 146 states and 379 transitions. Second operand has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 29 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:18,024 INFO L93 Difference]: Finished difference Result 286 states and 675 transitions. [2022-03-15 19:35:18,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:35:18,024 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 29 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 19:35:18,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:18,025 INFO L225 Difference]: With dead ends: 286 [2022-03-15 19:35:18,025 INFO L226 Difference]: Without dead ends: 276 [2022-03-15 19:35:18,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1433 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=573, Invalid=3717, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:35:18,026 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 152 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:18,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 54 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:35:18,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-03-15 19:35:18,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 128. [2022-03-15 19:35:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.5354330708661417) internal successors, (322), 127 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 322 transitions. [2022-03-15 19:35:18,030 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 322 transitions. Word has length 18 [2022-03-15 19:35:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:18,030 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 322 transitions. [2022-03-15 19:35:18,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 29 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:18,030 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 322 transitions. [2022-03-15 19:35:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:35:18,031 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:18,031 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:18,052 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:35:18,231 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,SelfDestructingSolverStorable13 [2022-03-15 19:35:18,232 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:18,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:18,232 INFO L85 PathProgramCache]: Analyzing trace with hash 345618237, now seen corresponding path program 13 times [2022-03-15 19:35:18,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:18,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860500284] [2022-03-15 19:35:18,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:18,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:18,380 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:18,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860500284] [2022-03-15 19:35:18,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860500284] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:18,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571921368] [2022-03-15 19:35:18,380 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:35:18,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:18,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:18,382 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:35:18,383 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:35:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:18,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:35:18,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:18,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:18,928 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:35:18,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571921368] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:18,929 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:18,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:35:18,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [65300705] [2022-03-15 19:35:18,929 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:18,930 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:18,936 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 124 transitions. [2022-03-15 19:35:18,936 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:20,596 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [7886#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0))), 7884#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 7888#(and (or (<= 0 ~counter~0) (< 3 ~M1~0) (not (< 2 ~M1~0))) (or (<= (+ ~counter~0 3) ~M1~0) (< 3 ~M1~0) (not (< 2 ~M1~0)))), 7876#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 7887#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 7882#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 7880#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 7883#(and (or (< 3 ~M1~0) (not (< 2 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (< 3 ~M1~0) (not (< 2 ~M1~0))) (or (<= (+ ~counter~0 3) ~M1~0) (< 3 ~M1~0) (not (< 2 ~M1~0)))), 7875#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 7879#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 7881#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 7877#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 7878#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 7885#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))] [2022-03-15 19:35:20,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:35:20,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:20,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:35:20,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1799, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 19:35:20,597 INFO L87 Difference]: Start difference. First operand 128 states and 322 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:35:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:23,035 INFO L93 Difference]: Finished difference Result 290 states and 687 transitions. [2022-03-15 19:35:23,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 19:35:23,035 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 19 [2022-03-15 19:35:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:23,037 INFO L225 Difference]: With dead ends: 290 [2022-03-15 19:35:23,037 INFO L226 Difference]: Without dead ends: 280 [2022-03-15 19:35:23,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2111 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=984, Invalid=6156, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 19:35:23,039 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 175 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:23,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 46 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:35:23,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-03-15 19:35:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 152. [2022-03-15 19:35:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.629139072847682) internal successors, (397), 151 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 397 transitions. [2022-03-15 19:35:23,043 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 397 transitions. Word has length 19 [2022-03-15 19:35:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:23,043 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 397 transitions. [2022-03-15 19:35:23,043 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:35:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 397 transitions. [2022-03-15 19:35:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:35:23,044 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:23,044 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:23,062 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:35:23,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:23,258 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:23,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:23,258 INFO L85 PathProgramCache]: Analyzing trace with hash 474276015, now seen corresponding path program 14 times [2022-03-15 19:35:23,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:23,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910776678] [2022-03-15 19:35:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:23,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:23,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:23,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910776678] [2022-03-15 19:35:23,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910776678] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:23,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573461280] [2022-03-15 19:35:23,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:35:23,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:23,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:23,413 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:35:23,414 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:35:23,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:35:23,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:23,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:35:23,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:23,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:23,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573461280] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:23,919 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:23,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-03-15 19:35:23,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1584809499] [2022-03-15 19:35:23,919 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:23,921 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:23,925 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 93 transitions. [2022-03-15 19:35:23,926 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:24,670 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [8707#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 8706#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 8709#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 8701#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 8705#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 8702#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 8703#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 8704#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 8708#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0))))] [2022-03-15 19:35:24,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 19:35:24,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:24,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 19:35:24,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1396, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 19:35:24,671 INFO L87 Difference]: Start difference. First operand 152 states and 397 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:25,233 INFO L93 Difference]: Finished difference Result 330 states and 805 transitions. [2022-03-15 19:35:25,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:35:25,234 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:35:25,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:25,235 INFO L225 Difference]: With dead ends: 330 [2022-03-15 19:35:25,235 INFO L226 Difference]: Without dead ends: 300 [2022-03-15 19:35:25,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=491, Invalid=2701, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:35:25,236 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 124 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:25,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 24 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:35:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-03-15 19:35:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 180. [2022-03-15 19:35:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.782122905027933) internal successors, (498), 179 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 498 transitions. [2022-03-15 19:35:25,240 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 498 transitions. Word has length 19 [2022-03-15 19:35:25,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:25,241 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 498 transitions. [2022-03-15 19:35:25,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 498 transitions. [2022-03-15 19:35:25,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:35:25,241 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:25,241 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:25,284 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:35:25,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 19:35:25,442 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:25,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:25,442 INFO L85 PathProgramCache]: Analyzing trace with hash 560066749, now seen corresponding path program 15 times [2022-03-15 19:35:25,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:25,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42085577] [2022-03-15 19:35:25,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:25,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:25,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:25,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42085577] [2022-03-15 19:35:25,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42085577] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:25,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075643899] [2022-03-15 19:35:25,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:35:25,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:25,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:25,587 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:35:25,588 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:35:25,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:35:25,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:25,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:35:25,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:25,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:26,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075643899] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:26,096 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:26,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 28 [2022-03-15 19:35:26,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1329839934] [2022-03-15 19:35:26,096 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:26,098 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:26,102 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 84 transitions. [2022-03-15 19:35:26,102 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:26,628 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [9572#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 9574#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 9576#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 9577#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 9573#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 9570#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 9571#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 9575#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:35:26,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:35:26,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:26,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:35:26,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1212, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:35:26,630 INFO L87 Difference]: Start difference. First operand 180 states and 498 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:27,269 INFO L93 Difference]: Finished difference Result 445 states and 1096 transitions. [2022-03-15 19:35:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:35:27,269 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 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:35:27,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:27,276 INFO L225 Difference]: With dead ends: 445 [2022-03-15 19:35:27,276 INFO L226 Difference]: Without dead ends: 432 [2022-03-15 19:35:27,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=471, Invalid=2721, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:35:27,277 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 97 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:27,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 27 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:35:27,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-03-15 19:35:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 236. [2022-03-15 19:35:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 2.9617021276595743) internal successors, (696), 235 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:27,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 696 transitions. [2022-03-15 19:35:27,284 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 696 transitions. Word has length 19 [2022-03-15 19:35:27,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:27,284 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 696 transitions. [2022-03-15 19:35:27,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:27,285 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 696 transitions. [2022-03-15 19:35:27,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:35:27,285 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:27,285 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:27,306 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:35:27,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-15 19:35:27,506 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:27,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2113345798, now seen corresponding path program 16 times [2022-03-15 19:35:27,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:27,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049880337] [2022-03-15 19:35:27,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:27,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:27,619 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:27,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:27,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049880337] [2022-03-15 19:35:27,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049880337] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:27,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842140197] [2022-03-15 19:35:27,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:35:27,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:27,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:27,626 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:35:27,655 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:35:27,678 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:35:27,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:27,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:35:27,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:27,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:28,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842140197] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:28,150 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:28,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 27 [2022-03-15 19:35:28,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1210876526] [2022-03-15 19:35:28,150 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:28,151 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:28,156 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 85 transitions. [2022-03-15 19:35:28,156 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:28,658 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [10676#(or (= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread2Thread1of1ForFork1_~i~1 ~M2~0)), 10670#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 10672#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 10675#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 10674#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 10633#(or (and (<= thread1Thread1of1ForFork0_~i~0 (+ ~counter~0 ~M2~0)) (<= (+ ~counter~0 ~M2~0) thread1Thread1of1ForFork0_~i~0)) (< thread2Thread1of1ForFork1_~i~1 ~M2~0)), 10671#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 10677#(and (or (<= thread1Thread1of1ForFork0_~i~0 (+ ~counter~0 ~M2~0)) (= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread2Thread1of1ForFork1_~i~1 ~M2~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread2Thread1of1ForFork1_~i~1 ~M2~0))), 10673#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:35:28,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:35:28,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:28,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:35:28,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1135, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 19:35:28,660 INFO L87 Difference]: Start difference. First operand 236 states and 696 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:29,294 INFO L93 Difference]: Finished difference Result 377 states and 997 transitions. [2022-03-15 19:35:29,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:35:29,295 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 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:35:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:29,296 INFO L225 Difference]: With dead ends: 377 [2022-03-15 19:35:29,296 INFO L226 Difference]: Without dead ends: 364 [2022-03-15 19:35:29,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=470, Invalid=2722, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:35:29,299 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 76 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:29,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 28 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:35:29,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-03-15 19:35:29,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 238. [2022-03-15 19:35:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 2.9240506329113924) internal successors, (693), 237 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 693 transitions. [2022-03-15 19:35:29,305 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 693 transitions. Word has length 19 [2022-03-15 19:35:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:29,306 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 693 transitions. [2022-03-15 19:35:29,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 693 transitions. [2022-03-15 19:35:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:35:29,307 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:29,307 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:29,325 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:35:29,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 19:35:29,525 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:29,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:29,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1600373801, now seen corresponding path program 17 times [2022-03-15 19:35:29,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:29,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089039564] [2022-03-15 19:35:29,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:29,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:29,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:29,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089039564] [2022-03-15 19:35:29,645 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089039564] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:29,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753553832] [2022-03-15 19:35:29,645 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:35:29,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:29,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:29,646 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:35:29,648 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:35:29,698 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:35:29,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:29,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:35:29,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:29,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:30,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753553832] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:30,105 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:30,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 29 [2022-03-15 19:35:30,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [800377849] [2022-03-15 19:35:30,105 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:30,106 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:30,111 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 84 transitions. [2022-03-15 19:35:30,111 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:30,920 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [11711#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 11716#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 11714#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 11710#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 11715#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 11713#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 11712#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:35:30,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:35:30,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:30,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:35:30,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1200, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:35:30,921 INFO L87 Difference]: Start difference. First operand 238 states and 693 transitions. Second operand has 20 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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:35:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:31,723 INFO L93 Difference]: Finished difference Result 456 states and 1172 transitions. [2022-03-15 19:35:31,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:35:31,723 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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 19 [2022-03-15 19:35:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:31,725 INFO L225 Difference]: With dead ends: 456 [2022-03-15 19:35:31,725 INFO L226 Difference]: Without dead ends: 422 [2022-03-15 19:35:31,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=516, Invalid=2906, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:35:31,726 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 119 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:31,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 14 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:35:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-03-15 19:35:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 162. [2022-03-15 19:35:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.7888198757763973) internal successors, (449), 161 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 449 transitions. [2022-03-15 19:35:31,732 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 449 transitions. Word has length 19 [2022-03-15 19:35:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:31,732 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 449 transitions. [2022-03-15 19:35:31,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 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:35:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 449 transitions. [2022-03-15 19:35:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:35:31,734 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:31,734 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:31,751 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:35:31,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:31,947 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:31,948 INFO L85 PathProgramCache]: Analyzing trace with hash 106971682, now seen corresponding path program 18 times [2022-03-15 19:35:31,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:31,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715178785] [2022-03-15 19:35:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:31,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:32,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:32,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715178785] [2022-03-15 19:35:32,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715178785] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:32,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120802689] [2022-03-15 19:35:32,059 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:35:32,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:32,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:32,061 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:35:32,076 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:35:32,129 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:35:32,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:32,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:35:32,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:32,343 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:32,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:35:32,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120802689] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:32,630 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:32,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 26 [2022-03-15 19:35:32,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1142728153] [2022-03-15 19:35:32,630 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:32,631 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:32,635 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2022-03-15 19:35:32,635 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:33,184 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [12675#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 12676#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 12677#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 12679#(and (or (<= thread1Thread1of1ForFork0_~i~0 (+ ~counter~0 ~M2~0)) (= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread2Thread1of1ForFork1_~i~1 ~M2~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread2Thread1of1ForFork1_~i~1 ~M2~0))), 12639#(or (and (<= thread1Thread1of1ForFork0_~i~0 (+ ~counter~0 ~M2~0)) (<= (+ ~counter~0 ~M2~0) thread1Thread1of1ForFork0_~i~0)) (< thread2Thread1of1ForFork1_~i~1 ~M2~0)), 12680#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 12678#(or (= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread2Thread1of1ForFork1_~i~1 ~M2~0))] [2022-03-15 19:35:33,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 19:35:33,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:33,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 19:35:33,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 19:35:33,185 INFO L87 Difference]: Start difference. First operand 162 states and 449 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:33,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:33,931 INFO L93 Difference]: Finished difference Result 243 states and 611 transitions. [2022-03-15 19:35:33,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:35:33,931 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 19:35:33,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:33,932 INFO L225 Difference]: With dead ends: 243 [2022-03-15 19:35:33,932 INFO L226 Difference]: Without dead ends: 224 [2022-03-15 19:35:33,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=396, Invalid=2154, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 19:35:33,933 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 73 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:33,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 16 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:35:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-03-15 19:35:33,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 102. [2022-03-15 19:35:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.4752475247524752) internal successors, (250), 101 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:35:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 250 transitions. [2022-03-15 19:35:33,936 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 250 transitions. Word has length 19 [2022-03-15 19:35:33,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:33,936 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 250 transitions. [2022-03-15 19:35:33,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 250 transitions. [2022-03-15 19:35:33,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:35:33,937 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:33,937 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:33,956 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:35:34,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:34,147 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:34,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:34,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2123493700, now seen corresponding path program 19 times [2022-03-15 19:35:34,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:34,149 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444477439] [2022-03-15 19:35:34,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:34,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:34,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:34,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444477439] [2022-03-15 19:35:34,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444477439] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:34,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950027326] [2022-03-15 19:35:34,221 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:35:34,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:34,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:34,222 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:35:34,223 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:35:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:34,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-15 19:35:34,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:34,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:34,384 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:35:34,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950027326] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:34,385 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:34,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-03-15 19:35:34,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1598189933] [2022-03-15 19:35:34,385 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:34,387 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:34,394 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 136 transitions. [2022-03-15 19:35:34,394 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:34,842 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:35:34,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:35:34,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:34,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:35:34,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:35:34,843 INFO L87 Difference]: Start difference. First operand 102 states and 250 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:34,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:34,940 INFO L93 Difference]: Finished difference Result 236 states and 575 transitions. [2022-03-15 19:35:34,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-15 19:35:34,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 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:35:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:34,941 INFO L225 Difference]: With dead ends: 236 [2022-03-15 19:35:34,941 INFO L226 Difference]: Without dead ends: 194 [2022-03-15 19:35:34,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 83 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:35:34,943 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:34,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 28 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:35:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-03-15 19:35:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 140. [2022-03-15 19:35:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.431654676258993) internal successors, (338), 139 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 338 transitions. [2022-03-15 19:35:34,955 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 338 transitions. Word has length 20 [2022-03-15 19:35:34,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:34,955 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 338 transitions. [2022-03-15 19:35:34,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:34,955 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 338 transitions. [2022-03-15 19:35:34,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:35:34,955 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:34,955 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:34,972 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:35:35,170 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,SelfDestructingSolverStorable20 [2022-03-15 19:35:35,171 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:35,171 INFO L85 PathProgramCache]: Analyzing trace with hash 980596629, now seen corresponding path program 20 times [2022-03-15 19:35:35,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:35,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098102565] [2022-03-15 19:35:35,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:35,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:35,319 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:35,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:35,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098102565] [2022-03-15 19:35:35,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098102565] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:35,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863367851] [2022-03-15 19:35:35,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:35:35,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:35,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:35,322 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:35:35,322 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:35:35,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:35:35,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:35,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 19:35:35,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:35,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:35,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863367851] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:35,769 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:35,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2022-03-15 19:35:35,769 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1004325220] [2022-03-15 19:35:35,769 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:35,776 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:35,787 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 136 transitions. [2022-03-15 19:35:35,787 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:37,396 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [13977#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 13973#(and (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 4 ~counter~0) (<= ~counter~0 ~M1~0)), 13961#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 13960#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 13971#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0) (< 4 ~M1~0)) (or (not (< 3 ~M1~0)) (< 4 ~M1~0) (<= (+ ~counter~0 4) ~M1~0)) (or (not (< 3 ~M1~0)) (< 4 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0))), 13963#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 13978#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0) (< 4 ~M1~0)) (or (not (< 3 ~M1~0)) (< 4 ~M1~0) (<= (+ ~counter~0 4) ~M1~0))), 13968#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= 2 ~counter~0) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 13966#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 3 ~counter~0))), 13962#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 13975#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= 2 ~counter~0) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))), 13980#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 13959#(and (<= ~M1~0 ~counter~0) (<= 4 ~counter~0) (<= ~counter~0 ~M1~0)), 13976#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 13979#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 2 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 13965#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 13964#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 13967#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 3 ~counter~0))), 13974#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 3 ~counter~0)), 13972#(and (= thread2Thread1of1ForFork1_~i~1 0) (= ~counter~0 0)), 13969#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 13970#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:35:37,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:35:37,398 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:37,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:35:37,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=2696, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:35:37,398 INFO L87 Difference]: Start difference. First operand 140 states and 338 transitions. Second operand has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 35 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:38,997 INFO L93 Difference]: Finished difference Result 316 states and 717 transitions. [2022-03-15 19:35:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 19:35:38,997 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 35 states have internal predecessors, (102), 0 states have call successors, (0), 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:35:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:38,998 INFO L225 Difference]: With dead ends: 316 [2022-03-15 19:35:38,998 INFO L226 Difference]: Without dead ends: 306 [2022-03-15 19:35:38,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=905, Invalid=5575, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 19:35:39,000 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 207 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:39,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 60 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:35:39,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-03-15 19:35:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 124. [2022-03-15 19:35:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 2.3902439024390243) internal successors, (294), 123 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:35:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 294 transitions. [2022-03-15 19:35:39,020 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 294 transitions. Word has length 20 [2022-03-15 19:35:39,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:39,020 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 294 transitions. [2022-03-15 19:35:39,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 35 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 294 transitions. [2022-03-15 19:35:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:35:39,020 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:39,020 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:39,037 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:35:39,237 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,SelfDestructingSolverStorable21 [2022-03-15 19:35:39,237 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:39,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:39,237 INFO L85 PathProgramCache]: Analyzing trace with hash -625411608, now seen corresponding path program 21 times [2022-03-15 19:35:39,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:39,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643627493] [2022-03-15 19:35:39,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:39,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:39,376 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:35:39,376 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:39,376 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643627493] [2022-03-15 19:35:39,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643627493] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:39,376 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021456076] [2022-03-15 19:35:39,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:35:39,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:39,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:39,377 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:35:39,378 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:35:39,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:35:39,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:39,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 19:35:39,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:39,593 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:39,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:39,831 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:35:39,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021456076] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:39,832 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:39,832 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2022-03-15 19:35:39,832 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [646165165] [2022-03-15 19:35:39,832 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:39,845 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:39,854 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 148 transitions. [2022-03-15 19:35:39,855 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:41,494 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [14755#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 14758#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 14769#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0) (< 4 ~M1~0)) (or (not (< 3 ~M1~0)) (< 4 ~M1~0) (<= (+ ~counter~0 4) ~M1~0))), 14764#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 14756#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 14768#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0) (< 4 ~M1~0)) (or (not (< 3 ~M1~0)) (< 4 ~M1~0) (<= (+ ~counter~0 4) ~M1~0)) (or (not (< 3 ~M1~0)) (< 4 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0))), 14763#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= 2 ~counter~0) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))), 14754#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 14765#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 14753#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 14767#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 14759#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 3 ~counter~0))), 14757#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 14760#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= 2 ~counter~0) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 14761#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 14766#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 14762#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 3 ~counter~0)))] [2022-03-15 19:35:41,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 19:35:41,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:41,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 19:35:41,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=2597, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 19:35:41,495 INFO L87 Difference]: Start difference. First operand 124 states and 294 transitions. Second operand has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 31 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:44,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:44,216 INFO L93 Difference]: Finished difference Result 324 states and 740 transitions. [2022-03-15 19:35:44,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 19:35:44,216 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 31 states have internal predecessors, (96), 0 states have call successors, (0), 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:35:44,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:44,217 INFO L225 Difference]: With dead ends: 324 [2022-03-15 19:35:44,217 INFO L226 Difference]: Without dead ends: 310 [2022-03-15 19:35:44,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3198 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1436, Invalid=8866, Unknown=0, NotChecked=0, Total=10302 [2022-03-15 19:35:44,219 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 189 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:44,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 60 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:35:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-03-15 19:35:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 154. [2022-03-15 19:35:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.4836601307189543) internal successors, (380), 153 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 380 transitions. [2022-03-15 19:35:44,222 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 380 transitions. Word has length 21 [2022-03-15 19:35:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:44,222 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 380 transitions. [2022-03-15 19:35:44,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.096774193548387) internal successors, (96), 31 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 380 transitions. [2022-03-15 19:35:44,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:35:44,223 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:44,223 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:44,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 19:35:44,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:44,435 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:44,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash -931987786, now seen corresponding path program 22 times [2022-03-15 19:35:44,437 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:44,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302238120] [2022-03-15 19:35:44,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:44,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:44,596 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:44,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302238120] [2022-03-15 19:35:44,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302238120] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:44,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80278341] [2022-03-15 19:35:44,597 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:35:44,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:44,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:44,599 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:35:44,599 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:35:44,665 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:35:44,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:44,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 19:35:44,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:44,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:45,302 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:35:45,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80278341] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:45,302 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:45,302 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2022-03-15 19:35:45,303 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2139612435] [2022-03-15 19:35:45,303 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:45,304 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:45,311 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 117 transitions. [2022-03-15 19:35:45,311 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:46,741 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [15662#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 15665#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 15657#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 15660#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 15659#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 15664#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 15655#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 15656#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 15658#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 15663#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (not (< 2 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 15661#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 15654#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:35:46,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 19:35:46,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:46,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 19:35:46,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=2096, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 19:35:46,742 INFO L87 Difference]: Start difference. First operand 154 states and 380 transitions. Second operand has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:47,535 INFO L93 Difference]: Finished difference Result 283 states and 636 transitions. [2022-03-15 19:35:47,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 19:35:47,536 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 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:35:47,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:47,537 INFO L225 Difference]: With dead ends: 283 [2022-03-15 19:35:47,537 INFO L226 Difference]: Without dead ends: 262 [2022-03-15 19:35:47,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1437 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=657, Invalid=3765, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:35:47,538 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 122 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:47,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 34 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:35:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-03-15 19:35:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 156. [2022-03-15 19:35:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.4838709677419355) internal successors, (385), 155 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 385 transitions. [2022-03-15 19:35:47,541 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 385 transitions. Word has length 21 [2022-03-15 19:35:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:47,541 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 385 transitions. [2022-03-15 19:35:47,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 26 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 385 transitions. [2022-03-15 19:35:47,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:35:47,541 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:47,542 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:47,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-15 19:35:47,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:47,742 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:47,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:47,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1727524968, now seen corresponding path program 23 times [2022-03-15 19:35:47,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:47,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871020219] [2022-03-15 19:35:47,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:47,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:47,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:47,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871020219] [2022-03-15 19:35:47,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871020219] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:47,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294938998] [2022-03-15 19:35:47,894 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:35:47,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:47,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:47,895 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:35:47,897 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:35:47,949 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:35:47,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:47,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 19:35:47,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:48,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:48,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294938998] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:48,485 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:48,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2022-03-15 19:35:48,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1321057386] [2022-03-15 19:35:48,486 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:48,487 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:48,494 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 108 transitions. [2022-03-15 19:35:48,494 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:49,303 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [16463#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 16453#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 16459#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 16454#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 16462#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 16460#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (not (< 2 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 16458#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 16461#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 16456#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 16457#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 16455#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:35:49,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:35:49,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:49,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:35:49,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=2012, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 19:35:49,304 INFO L87 Difference]: Start difference. First operand 156 states and 385 transitions. Second operand has 26 states, 25 states have (on average 2.88) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:49,912 INFO L93 Difference]: Finished difference Result 321 states and 729 transitions. [2022-03-15 19:35:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:35:49,912 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-03-15 19:35:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:49,913 INFO L225 Difference]: With dead ends: 321 [2022-03-15 19:35:49,913 INFO L226 Difference]: Without dead ends: 304 [2022-03-15 19:35:49,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=733, Invalid=3959, Unknown=0, NotChecked=0, Total=4692 [2022-03-15 19:35:49,914 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 107 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:49,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 27 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:35:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-03-15 19:35:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 162. [2022-03-15 19:35:49,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.5093167701863353) internal successors, (404), 161 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:49,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 404 transitions. [2022-03-15 19:35:49,918 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 404 transitions. Word has length 21 [2022-03-15 19:35:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:49,918 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 404 transitions. [2022-03-15 19:35:49,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 25 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 404 transitions. [2022-03-15 19:35:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:35:49,919 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:49,919 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:49,947 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:35:50,136 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,SelfDestructingSolverStorable24 [2022-03-15 19:35:50,136 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:50,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:50,136 INFO L85 PathProgramCache]: Analyzing trace with hash -821622642, now seen corresponding path program 24 times [2022-03-15 19:35:50,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:50,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077964889] [2022-03-15 19:35:50,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:50,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:50,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:50,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077964889] [2022-03-15 19:35:50,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077964889] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:50,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171780808] [2022-03-15 19:35:50,295 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:35:50,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:50,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:50,308 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:35:50,343 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:35:50,381 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:35:50,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:50,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 19:35:50,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:50,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:50,914 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:35:50,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171780808] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:50,915 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:50,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 35 [2022-03-15 19:35:50,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1924776348] [2022-03-15 19:35:50,915 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:50,917 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:50,923 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 108 transitions. [2022-03-15 19:35:50,923 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:51,804 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [17311#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 17309#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 17310#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 17313#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 17308#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 17315#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 17312#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 17306#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 17307#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 17314#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0))))] [2022-03-15 19:35:51,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:35:51,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:51,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:35:51,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1854, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 19:35:51,805 INFO L87 Difference]: Start difference. First operand 162 states and 404 transitions. Second operand has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:52,544 INFO L93 Difference]: Finished difference Result 333 states and 762 transitions. [2022-03-15 19:35:52,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-03-15 19:35:52,544 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 0 states have call successors, (0), 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:35:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:52,545 INFO L225 Difference]: With dead ends: 333 [2022-03-15 19:35:52,545 INFO L226 Difference]: Without dead ends: 308 [2022-03-15 19:35:52,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=636, Invalid=3654, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:35:52,546 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 104 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:52,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 20 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:35:52,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-03-15 19:35:52,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 170. [2022-03-15 19:35:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 2.5207100591715976) internal successors, (426), 169 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 426 transitions. [2022-03-15 19:35:52,551 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 426 transitions. Word has length 21 [2022-03-15 19:35:52,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:52,551 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 426 transitions. [2022-03-15 19:35:52,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 426 transitions. [2022-03-15 19:35:52,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:35:52,551 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:52,551 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:52,568 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:35:52,767 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,SelfDestructingSolverStorable25 [2022-03-15 19:35:52,768 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:52,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1695270474, now seen corresponding path program 25 times [2022-03-15 19:35:52,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:52,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032689752] [2022-03-15 19:35:52,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:52,916 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:35:52,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:52,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032689752] [2022-03-15 19:35:52,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032689752] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:52,917 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577780200] [2022-03-15 19:35:52,917 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:35:52,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:52,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:52,918 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:35:52,921 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:35:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:52,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 19:35:52,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:53,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:53,665 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:35:53,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577780200] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:53,665 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:53,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 35 [2022-03-15 19:35:53,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [332169089] [2022-03-15 19:35:53,665 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:53,667 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:53,673 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 99 transitions. [2022-03-15 19:35:53,673 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:54,453 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [18186#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 18189#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 18191#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 18187#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 18188#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 18190#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 18185#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 18184#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:35:54,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 19:35:54,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:54,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 19:35:54,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1693, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 19:35:54,455 INFO L87 Difference]: Start difference. First operand 170 states and 426 transitions. Second operand has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:55,537 INFO L93 Difference]: Finished difference Result 399 states and 911 transitions. [2022-03-15 19:35:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:35:55,537 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 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:35:55,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:55,539 INFO L225 Difference]: With dead ends: 399 [2022-03-15 19:35:55,539 INFO L226 Difference]: Without dead ends: 374 [2022-03-15 19:35:55,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=731, Invalid=4099, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 19:35:55,540 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 110 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:55,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 22 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:35:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-03-15 19:35:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 170. [2022-03-15 19:35:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 2.5207100591715976) internal successors, (426), 169 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 426 transitions. [2022-03-15 19:35:55,543 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 426 transitions. Word has length 21 [2022-03-15 19:35:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:55,543 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 426 transitions. [2022-03-15 19:35:55,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 426 transitions. [2022-03-15 19:35:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:35:55,544 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:55,544 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:55,560 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:35:55,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 19:35:55,744 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:55,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:55,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2086339577, now seen corresponding path program 26 times [2022-03-15 19:35:55,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:55,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474170265] [2022-03-15 19:35:55,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:55,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:55,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:55,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474170265] [2022-03-15 19:35:55,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474170265] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:55,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490978050] [2022-03-15 19:35:55,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:35:55,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:55,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:55,842 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:35:55,843 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:35:55,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:35:55,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:55,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:35:55,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:55,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:56,120 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:35:56,120 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490978050] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:56,120 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:56,120 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2022-03-15 19:35:56,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [676145778] [2022-03-15 19:35:56,120 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:56,122 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:56,139 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 160 transitions. [2022-03-15 19:35:56,139 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:35:56,891 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:35:56,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:35:56,892 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:35:56,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:35:56,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-15 19:35:56,893 INFO L87 Difference]: Start difference. First operand 170 states and 426 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:35:57,082 INFO L93 Difference]: Finished difference Result 370 states and 917 transitions. [2022-03-15 19:35:57,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:35:57,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-03-15 19:35:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:35:57,083 INFO L225 Difference]: With dead ends: 370 [2022-03-15 19:35:57,083 INFO L226 Difference]: Without dead ends: 320 [2022-03-15 19:35:57,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:35:57,084 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:35:57,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 40 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:35:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-03-15 19:35:57,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 230. [2022-03-15 19:35:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 2.541484716157205) internal successors, (582), 229 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 582 transitions. [2022-03-15 19:35:57,103 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 582 transitions. Word has length 22 [2022-03-15 19:35:57,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:35:57,103 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 582 transitions. [2022-03-15 19:35:57,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:35:57,103 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 582 transitions. [2022-03-15 19:35:57,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:35:57,104 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:35:57,104 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:35:57,120 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:35:57,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-15 19:35:57,319 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:35:57,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:35:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1146646286, now seen corresponding path program 27 times [2022-03-15 19:35:57,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:35:57,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189284631] [2022-03-15 19:35:57,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:35:57,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:35:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:35:57,514 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:57,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:35:57,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189284631] [2022-03-15 19:35:57,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189284631] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:35:57,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089929761] [2022-03-15 19:35:57,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:35:57,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:35:57,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:35:57,516 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:35:57,520 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:35:57,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:35:57,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:35:57,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 19:35:57,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:35:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:57,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:35:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:35:58,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089929761] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:35:58,311 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:35:58,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2022-03-15 19:35:58,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [467986667] [2022-03-15 19:35:58,311 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:35:58,313 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:35:58,322 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 160 transitions. [2022-03-15 19:35:58,322 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:00,315 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [20144#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 20139#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0))), 20151#(and (= thread2Thread1of1ForFork1_~i~1 0) (= ~counter~0 0)), 20138#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0))), 20145#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 20130#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0)) (or (<= thread2Thread1of1ForFork1_~i~1 1) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 20146#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 20129#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= thread2Thread1of1ForFork1_~i~1 2)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= (+ ~counter~0 2) ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 20127#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= (+ (- 4) thread2Thread1of1ForFork1_~i~1) 0)) (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= (+ ~counter~0 4) ~M1~0))), 20128#(and (or (<= (+ ~counter~0 3) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= thread2Thread1of1ForFork1_~i~1 3) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 20131#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0))), 20148#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 20149#(and (or (< 5 ~M1~0) (<= (+ ~counter~0 5) ~M1~0) (not (< 4 ~M1~0))) (or (< 5 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M1~0))) (or (< 5 ~M1~0) (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 20141#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (<= 2 ~counter~0) (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 20133#(and (<= ~M1~0 ~counter~0) (<= ~counter~0 ~M1~0) (<= 5 ~counter~0)), 20142#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (<= 2 ~counter~0) (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 20132#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 20136#(and (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= ~counter~0 ~M1~0) (<= 5 ~counter~0)), 20126#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 20134#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0))), 20143#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 2 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 20140#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 3 ~counter~0)), 20147#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 20137#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 4 ~counter~0)), 20150#(and (or (< 5 ~M1~0) (<= (+ ~counter~0 5) ~M1~0) (not (< 4 ~M1~0))) (or (< 5 ~M1~0) (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 20135#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))] [2022-03-15 19:36:00,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:36:00,315 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:00,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:36:00,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=3796, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:36:00,316 INFO L87 Difference]: Start difference. First operand 230 states and 582 transitions. Second operand has 42 states, 41 states have (on average 2.902439024390244) internal successors, (119), 41 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:02,409 INFO L93 Difference]: Finished difference Result 444 states and 1044 transitions. [2022-03-15 19:36:02,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 19:36:02,410 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.902439024390244) internal successors, (119), 41 states have internal predecessors, (119), 0 states have call successors, (0), 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:36:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:02,411 INFO L225 Difference]: With dead ends: 444 [2022-03-15 19:36:02,411 INFO L226 Difference]: Without dead ends: 434 [2022-03-15 19:36:02,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2838 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1002, Invalid=7008, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 19:36:02,412 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 227 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 3319 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:02,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 97 Invalid, 3387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3319 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:36:02,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-03-15 19:36:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 208. [2022-03-15 19:36:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.5169082125603865) internal successors, (521), 207 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 521 transitions. [2022-03-15 19:36:02,416 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 521 transitions. Word has length 22 [2022-03-15 19:36:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:02,416 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 521 transitions. [2022-03-15 19:36:02,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.902439024390244) internal successors, (119), 41 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 521 transitions. [2022-03-15 19:36:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:36:02,417 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:02,417 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:02,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-03-15 19:36:02,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-15 19:36:02,633 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:02,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1793225629, now seen corresponding path program 28 times [2022-03-15 19:36:02,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:02,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564899589] [2022-03-15 19:36:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:02,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:02,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564899589] [2022-03-15 19:36:02,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564899589] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:02,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11589901] [2022-03-15 19:36:02,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:36:02,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:02,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:02,832 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:36:02,833 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:36:02,889 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:36:02,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:02,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:36:02,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:03,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:03,376 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:36:03,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11589901] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:03,377 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:03,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2022-03-15 19:36:03,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2031696050] [2022-03-15 19:36:03,377 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:03,379 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:03,389 INFO L252 McrAutomatonBuilder]: Finished intersection with 92 states and 172 transitions. [2022-03-15 19:36:03,389 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:06,064 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [21251#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0))), 21237#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 21253#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 21240#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 21242#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0))), 21245#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (<= 2 ~counter~0) (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 21243#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 21236#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 21241#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 21255#(and (or (< 5 ~M1~0) (<= (+ ~counter~0 5) ~M1~0) (not (< 4 ~M1~0))) (or (< 5 ~M1~0) (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 21247#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 21238#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 21252#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (<= 2 ~counter~0) (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 21249#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0))), 21248#(and (or (< 5 ~M1~0) (<= (+ ~counter~0 5) ~M1~0) (not (< 4 ~M1~0))) (or (< 5 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M1~0))) (or (< 5 ~M1~0) (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 21239#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 21246#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 21244#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0))), 21254#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 21250#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))] [2022-03-15 19:36:06,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:36:06,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:06,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:36:06,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=3536, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 19:36:06,066 INFO L87 Difference]: Start difference. First operand 208 states and 521 transitions. Second operand has 37 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:09,632 INFO L93 Difference]: Finished difference Result 456 states and 1075 transitions. [2022-03-15 19:36:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 19:36:09,632 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 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:36:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:09,634 INFO L225 Difference]: With dead ends: 456 [2022-03-15 19:36:09,634 INFO L226 Difference]: Without dead ends: 442 [2022-03-15 19:36:09,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4546 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2040, Invalid=12722, Unknown=0, NotChecked=0, Total=14762 [2022-03-15 19:36:09,635 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 232 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:09,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 58 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:36:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-03-15 19:36:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 246. [2022-03-15 19:36:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.5755102040816324) internal successors, (631), 245 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 631 transitions. [2022-03-15 19:36:09,652 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 631 transitions. Word has length 23 [2022-03-15 19:36:09,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:09,652 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 631 transitions. [2022-03-15 19:36:09,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 631 transitions. [2022-03-15 19:36:09,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:36:09,658 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:09,658 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:09,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-03-15 19:36:09,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:09,878 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:09,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:09,878 INFO L85 PathProgramCache]: Analyzing trace with hash 879298703, now seen corresponding path program 29 times [2022-03-15 19:36:09,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:09,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996453283] [2022-03-15 19:36:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:10,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:10,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996453283] [2022-03-15 19:36:10,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996453283] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:10,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948897513] [2022-03-15 19:36:10,093 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:36:10,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:10,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:10,094 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:36:10,095 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:36:10,155 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:36:10,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:10,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:36:10,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:10,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:10,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948897513] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:10,746 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:10,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2022-03-15 19:36:10,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1268220761] [2022-03-15 19:36:10,747 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:10,748 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:10,757 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 141 transitions. [2022-03-15 19:36:10,758 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:12,539 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [22502#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 22510#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 22505#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 22507#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 22504#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 22500#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 22496#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 22509#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 22497#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 22498#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 22499#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 22508#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 22506#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 22503#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 22501#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:36:12,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 19:36:12,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:12,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 19:36:12,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=2934, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:36:12,540 INFO L87 Difference]: Start difference. First operand 246 states and 631 transitions. Second operand has 32 states, 31 states have (on average 2.967741935483871) internal successors, (92), 31 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:36:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:13,573 INFO L93 Difference]: Finished difference Result 411 states and 959 transitions. [2022-03-15 19:36:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 19:36:13,573 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.967741935483871) internal successors, (92), 31 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) Word has length 23 [2022-03-15 19:36:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:13,574 INFO L225 Difference]: With dead ends: 411 [2022-03-15 19:36:13,574 INFO L226 Difference]: Without dead ends: 386 [2022-03-15 19:36:13,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2092 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=900, Invalid=5262, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 19:36:13,575 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 123 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:13,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 44 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:36:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-03-15 19:36:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 248. [2022-03-15 19:36:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 2.5506072874493926) internal successors, (630), 247 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 630 transitions. [2022-03-15 19:36:13,579 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 630 transitions. Word has length 23 [2022-03-15 19:36:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:13,580 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 630 transitions. [2022-03-15 19:36:13,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.967741935483871) internal successors, (92), 31 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:36:13,580 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 630 transitions. [2022-03-15 19:36:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:36:13,580 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:13,580 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:13,603 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 19:36:13,796 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,SelfDestructingSolverStorable30 [2022-03-15 19:36:13,797 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:13,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:13,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1719815453, now seen corresponding path program 30 times [2022-03-15 19:36:13,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:13,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536415383] [2022-03-15 19:36:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:13,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:14,003 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:14,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536415383] [2022-03-15 19:36:14,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536415383] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:14,003 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518365325] [2022-03-15 19:36:14,003 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:36:14,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:14,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:14,004 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:14,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-03-15 19:36:14,068 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:36:14,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:14,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:36:14,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:14,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:14,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518365325] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:14,852 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:14,852 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2022-03-15 19:36:14,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2028923402] [2022-03-15 19:36:14,853 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:14,855 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:14,875 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 132 transitions. [2022-03-15 19:36:14,875 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:16,355 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [23644#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 23636#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 23635#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 23640#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 23637#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 23647#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 23643#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 23638#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 23645#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 23641#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 23634#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 23646#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 23639#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 23642#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:36:16,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 19:36:16,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:16,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 19:36:16,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=2841, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 19:36:16,358 INFO L87 Difference]: Start difference. First operand 248 states and 630 transitions. Second operand has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:17,187 INFO L93 Difference]: Finished difference Result 481 states and 1125 transitions. [2022-03-15 19:36:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 19:36:17,187 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 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:36:17,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:17,189 INFO L225 Difference]: With dead ends: 481 [2022-03-15 19:36:17,189 INFO L226 Difference]: Without dead ends: 460 [2022-03-15 19:36:17,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2165 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=979, Invalid=5501, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 19:36:17,190 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 132 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:17,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 31 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:36:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2022-03-15 19:36:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 262. [2022-03-15 19:36:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.586206896551724) internal successors, (675), 261 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 675 transitions. [2022-03-15 19:36:17,194 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 675 transitions. Word has length 23 [2022-03-15 19:36:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:17,194 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 675 transitions. [2022-03-15 19:36:17,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:17,194 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 675 transitions. [2022-03-15 19:36:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:36:17,195 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:17,195 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:17,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:17,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:17,410 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:17,410 INFO L85 PathProgramCache]: Analyzing trace with hash 84360911, now seen corresponding path program 31 times [2022-03-15 19:36:17,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:17,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120855631] [2022-03-15 19:36:17,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:17,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:17,614 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:17,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:17,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120855631] [2022-03-15 19:36:17,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120855631] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:17,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863176558] [2022-03-15 19:36:17,614 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:36:17,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:17,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:17,616 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:17,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-03-15 19:36:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:17,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:36:17,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:17,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:18,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863176558] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:18,350 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:18,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 42 [2022-03-15 19:36:18,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [615292970] [2022-03-15 19:36:18,350 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:18,352 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:18,360 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 123 transitions. [2022-03-15 19:36:18,360 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:19,270 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [24883#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 24884#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 24881#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 24886#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 24882#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 24887#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 24877#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 24885#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 24879#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 24880#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 24878#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 24876#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 24875#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:36:19,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 19:36:19,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:19,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 19:36:19,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=2735, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 19:36:19,271 INFO L87 Difference]: Start difference. First operand 262 states and 675 transitions. Second operand has 30 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 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:36:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:20,070 INFO L93 Difference]: Finished difference Result 501 states and 1176 transitions. [2022-03-15 19:36:20,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-03-15 19:36:20,070 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 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 23 [2022-03-15 19:36:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:20,072 INFO L225 Difference]: With dead ends: 501 [2022-03-15 19:36:20,072 INFO L226 Difference]: Without dead ends: 476 [2022-03-15 19:36:20,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2243 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1126, Invalid=6014, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 19:36:20,073 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 176 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:20,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 28 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:36:20,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-03-15 19:36:20,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 198. [2022-03-15 19:36:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.5228426395939088) internal successors, (497), 197 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 497 transitions. [2022-03-15 19:36:20,076 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 497 transitions. Word has length 23 [2022-03-15 19:36:20,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:20,077 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 497 transitions. [2022-03-15 19:36:20,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 29 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:36:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 497 transitions. [2022-03-15 19:36:20,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:36:20,077 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:20,077 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:20,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:20,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:20,293 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:20,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:20,294 INFO L85 PathProgramCache]: Analyzing trace with hash 5650871, now seen corresponding path program 32 times [2022-03-15 19:36:20,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:20,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312224482] [2022-03-15 19:36:20,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:20,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:20,440 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:20,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312224482] [2022-03-15 19:36:20,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312224482] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:20,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758724118] [2022-03-15 19:36:20,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:36:20,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:20,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:20,442 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:20,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-03-15 19:36:20,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:36:20,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:20,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:36:20,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:20,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:21,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758724118] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:21,046 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:21,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 41 [2022-03-15 19:36:21,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2097594771] [2022-03-15 19:36:21,047 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:21,049 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:21,057 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 132 transitions. [2022-03-15 19:36:21,057 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:22,209 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [26021#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 26027#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 26025#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 26020#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 26024#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (not (< 2 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 26028#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 26017#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 26023#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 26018#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 26022#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 26016#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 26026#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 26019#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:36:22,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-03-15 19:36:22,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:22,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-03-15 19:36:22,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=2651, Unknown=0, NotChecked=0, Total=3080 [2022-03-15 19:36:22,210 INFO L87 Difference]: Start difference. First operand 198 states and 497 transitions. Second operand has 30 states, 29 states have (on average 2.9655172413793105) internal successors, (86), 29 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:23,148 INFO L93 Difference]: Finished difference Result 405 states and 935 transitions. [2022-03-15 19:36:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-03-15 19:36:23,149 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.9655172413793105) internal successors, (86), 29 states have internal predecessors, (86), 0 states have call successors, (0), 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:36:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:23,150 INFO L225 Difference]: With dead ends: 405 [2022-03-15 19:36:23,150 INFO L226 Difference]: Without dead ends: 376 [2022-03-15 19:36:23,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=870, Invalid=5136, Unknown=0, NotChecked=0, Total=6006 [2022-03-15 19:36:23,151 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 138 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:23,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 31 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:36:23,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-03-15 19:36:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 216. [2022-03-15 19:36:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 2.558139534883721) internal successors, (550), 215 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 550 transitions. [2022-03-15 19:36:23,155 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 550 transitions. Word has length 23 [2022-03-15 19:36:23,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:23,155 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 550 transitions. [2022-03-15 19:36:23,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.9655172413793105) internal successors, (86), 29 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 550 transitions. [2022-03-15 19:36:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:36:23,157 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:23,157 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:23,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:23,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-03-15 19:36:23,357 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:23,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1307628145, now seen corresponding path program 33 times [2022-03-15 19:36:23,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:23,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901366484] [2022-03-15 19:36:23,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:23,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:23,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:23,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901366484] [2022-03-15 19:36:23,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901366484] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:23,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641517992] [2022-03-15 19:36:23,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:36:23,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:23,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:23,600 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:23,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-03-15 19:36:23,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:36:23,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:23,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 19:36:23,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:24,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:24,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641517992] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:24,758 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:24,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 41 [2022-03-15 19:36:24,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [175668887] [2022-03-15 19:36:24,759 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:24,761 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:24,768 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 123 transitions. [2022-03-15 19:36:24,769 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:26,145 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [27093#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 27092#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 27095#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 27089#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 27087#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 27086#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 27091#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 27090#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 27085#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 27088#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 27094#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0))))] [2022-03-15 19:36:26,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 19:36:26,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:26,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 19:36:26,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=2499, Unknown=0, NotChecked=0, Total=2862 [2022-03-15 19:36:26,146 INFO L87 Difference]: Start difference. First operand 216 states and 550 transitions. Second operand has 28 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:27,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:27,153 INFO L93 Difference]: Finished difference Result 503 states and 1187 transitions. [2022-03-15 19:36:27,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-15 19:36:27,153 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:36:27,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:27,154 INFO L225 Difference]: With dead ends: 503 [2022-03-15 19:36:27,154 INFO L226 Difference]: Without dead ends: 470 [2022-03-15 19:36:27,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=813, Invalid=5349, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 19:36:27,155 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 128 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:27,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 19 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:36:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-03-15 19:36:27,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 236. [2022-03-15 19:36:27,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 2.6042553191489364) internal successors, (612), 235 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 612 transitions. [2022-03-15 19:36:27,159 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 612 transitions. Word has length 23 [2022-03-15 19:36:27,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:27,159 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 612 transitions. [2022-03-15 19:36:27,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:27,159 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 612 transitions. [2022-03-15 19:36:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:36:27,160 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:27,160 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:27,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-03-15 19:36:27,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-03-15 19:36:27,378 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash 930395319, now seen corresponding path program 34 times [2022-03-15 19:36:27,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:27,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492485099] [2022-03-15 19:36:27,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:27,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:27,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:27,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492485099] [2022-03-15 19:36:27,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492485099] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:27,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536541925] [2022-03-15 19:36:27,629 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:36:27,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:27,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:27,630 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:27,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-03-15 19:36:27,696 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:36:27,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:27,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjunts are in the unsatisfiable core [2022-03-15 19:36:27,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:27,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:28,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536541925] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:28,487 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:28,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 41 [2022-03-15 19:36:28,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1362252742] [2022-03-15 19:36:28,487 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:28,489 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:28,496 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 114 transitions. [2022-03-15 19:36:28,496 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:29,423 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [28304#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 28301#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 28296#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 28299#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 28297#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 28303#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 28298#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 28300#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 28302#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0))))] [2022-03-15 19:36:29,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:36:29,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:29,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:36:29,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=2265, Unknown=0, NotChecked=0, Total=2652 [2022-03-15 19:36:29,424 INFO L87 Difference]: Start difference. First operand 236 states and 612 transitions. Second operand has 26 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:30,402 INFO L93 Difference]: Finished difference Result 615 states and 1444 transitions. [2022-03-15 19:36:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:36:30,402 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-03-15 19:36:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:30,404 INFO L225 Difference]: With dead ends: 615 [2022-03-15 19:36:30,404 INFO L226 Difference]: Without dead ends: 582 [2022-03-15 19:36:30,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2139 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1057, Invalid=5749, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 19:36:30,405 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 117 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:30,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 20 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:36:30,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-03-15 19:36:30,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 250. [2022-03-15 19:36:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 2.63855421686747) internal successors, (657), 249 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 657 transitions. [2022-03-15 19:36:30,424 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 657 transitions. Word has length 23 [2022-03-15 19:36:30,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:30,424 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 657 transitions. [2022-03-15 19:36:30,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 657 transitions. [2022-03-15 19:36:30,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:36:30,425 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:30,425 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:30,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:30,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-03-15 19:36:30,649 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:30,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:30,650 INFO L85 PathProgramCache]: Analyzing trace with hash -245317404, now seen corresponding path program 35 times [2022-03-15 19:36:30,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:30,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456080279] [2022-03-15 19:36:30,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:30,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:30,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:30,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456080279] [2022-03-15 19:36:30,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456080279] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:30,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729194035] [2022-03-15 19:36:30,719 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:36:30,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:30,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:30,720 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:30,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-03-15 19:36:30,807 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-03-15 19:36:30,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:30,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 19:36:30,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:30,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:30,998 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:36:30,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729194035] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:30,998 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:30,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-03-15 19:36:30,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [536478954] [2022-03-15 19:36:30,998 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:31,000 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:31,013 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 184 transitions. [2022-03-15 19:36:31,013 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:31,865 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:36:31,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:36:31,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:31,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:36:31,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:36:31,866 INFO L87 Difference]: Start difference. First operand 250 states and 657 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:32,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:32,146 INFO L93 Difference]: Finished difference Result 514 states and 1340 transitions. [2022-03-15 19:36:32,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 19:36:32,146 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 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:36:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:32,148 INFO L225 Difference]: With dead ends: 514 [2022-03-15 19:36:32,148 INFO L226 Difference]: Without dead ends: 456 [2022-03-15 19:36:32,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 111 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:36:32,148 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:32,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 54 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:36:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-03-15 19:36:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 342. [2022-03-15 19:36:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 2.6686217008797652) internal successors, (910), 341 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 910 transitions. [2022-03-15 19:36:32,153 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 910 transitions. Word has length 24 [2022-03-15 19:36:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:32,153 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 910 transitions. [2022-03-15 19:36:32,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 910 transitions. [2022-03-15 19:36:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-15 19:36:32,154 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:32,154 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:32,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:32,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:32,371 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:32,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1427727925, now seen corresponding path program 36 times [2022-03-15 19:36:32,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:32,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542522839] [2022-03-15 19:36:32,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:32,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:32,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:32,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542522839] [2022-03-15 19:36:32,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542522839] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:32,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002280518] [2022-03-15 19:36:32,575 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:36:32,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:32,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:32,576 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:32,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-03-15 19:36:32,649 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:36:32,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:32,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:36:32,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:32,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:33,373 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:33,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002280518] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:33,373 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:33,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2022-03-15 19:36:33,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1087442303] [2022-03-15 19:36:33,374 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:33,376 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:33,400 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 184 transitions. [2022-03-15 19:36:33,400 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:36,103 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [31035#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 31029#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 31041#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 31034#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 31057#(and (or (not (< 5 ~M1~0)) (< 6 ~M1~0) (<= (+ ~counter~0 6) ~M1~0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)) (< 6 ~M1~0))), 31056#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 31045#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 31036#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 5 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 31058#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 31031#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 31043#(and (= thread2Thread1of1ForFork1_~i~1 0) (= ~counter~0 0)), 31047#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0))), 31054#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 2 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 31037#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 31030#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 31038#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 31053#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 31039#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 31033#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 31048#(and (<= 6 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= ~counter~0 ~M1~0)), 31032#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 31051#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 31046#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 5 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 31052#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 3 ~counter~0)), 31044#(and (<= 6 ~counter~0) (<= ~M1~0 ~counter~0) (<= ~counter~0 ~M1~0)), 31050#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 4 ~counter~0)), 31040#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 31049#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 5 ~counter~0)), 31042#(and (or (not (< 5 ~M1~0)) (< 6 ~M1~0) (<= (+ ~counter~0 6) ~M1~0)) (or (not (< 5 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< 6 ~M1~0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)) (< 6 ~M1~0))), 31055#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))] [2022-03-15 19:36:36,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-15 19:36:36,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:36,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-15 19:36:36,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=707, Invalid=4993, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 19:36:36,105 INFO L87 Difference]: Start difference. First operand 342 states and 910 transitions. Second operand has 48 states, 47 states have (on average 2.893617021276596) internal successors, (136), 47 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:39,049 INFO L93 Difference]: Finished difference Result 618 states and 1524 transitions. [2022-03-15 19:36:39,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 19:36:39,056 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.893617021276596) internal successors, (136), 47 states have internal predecessors, (136), 0 states have call successors, (0), 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:36:39,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:39,058 INFO L225 Difference]: With dead ends: 618 [2022-03-15 19:36:39,058 INFO L226 Difference]: Without dead ends: 608 [2022-03-15 19:36:39,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4393 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1665, Invalid=10545, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 19:36:39,059 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 331 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:39,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 97 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:36:39,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-03-15 19:36:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 316. [2022-03-15 19:36:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 2.6634920634920634) internal successors, (839), 315 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 839 transitions. [2022-03-15 19:36:39,068 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 839 transitions. Word has length 24 [2022-03-15 19:36:39,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:39,068 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 839 transitions. [2022-03-15 19:36:39,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.893617021276596) internal successors, (136), 47 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 839 transitions. [2022-03-15 19:36:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:36:39,068 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:39,069 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:39,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:39,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-03-15 19:36:39,276 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:39,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:39,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1540020104, now seen corresponding path program 37 times [2022-03-15 19:36:39,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:39,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415018286] [2022-03-15 19:36:39,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:39,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:39,492 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:36:39,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:39,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415018286] [2022-03-15 19:36:39,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415018286] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:39,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225446027] [2022-03-15 19:36:39,492 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:36:39,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:39,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:39,494 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:39,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-03-15 19:36:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:39,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:36:39,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:39,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:40,404 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:36:40,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225446027] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:40,404 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:40,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 48 [2022-03-15 19:36:40,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1133033617] [2022-03-15 19:36:40,404 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:40,407 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:40,420 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 196 transitions. [2022-03-15 19:36:40,420 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:43,752 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [32594#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 32591#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 32587#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 32582#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 32590#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 32588#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 32576#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 32578#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 32585#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0))), 32595#(and (or (not (< 5 ~M1~0)) (< 6 ~M1~0) (<= (+ ~counter~0 6) ~M1~0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)) (< 6 ~M1~0))), 32584#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 32592#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 32575#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 32574#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 32583#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 5 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 32579#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 32577#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 32580#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 32586#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 32593#(and (or (not (< 5 ~M1~0)) (< 6 ~M1~0) (<= (+ ~counter~0 6) ~M1~0)) (or (not (< 5 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< 6 ~M1~0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)) (< 6 ~M1~0))), 32573#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 32581#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 5 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 32589#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:36:43,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:36:43,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:43,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:36:43,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=4616, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 19:36:43,753 INFO L87 Difference]: Start difference. First operand 316 states and 839 transitions. Second operand has 42 states, 41 states have (on average 3.073170731707317) internal successors, (126), 41 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:49,363 INFO L93 Difference]: Finished difference Result 612 states and 1508 transitions. [2022-03-15 19:36:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 19:36:49,363 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.073170731707317) internal successors, (126), 41 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-03-15 19:36:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:49,365 INFO L225 Difference]: With dead ends: 612 [2022-03-15 19:36:49,365 INFO L226 Difference]: Without dead ends: 598 [2022-03-15 19:36:49,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6482 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2794, Invalid=17512, Unknown=0, NotChecked=0, Total=20306 [2022-03-15 19:36:49,367 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 316 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:49,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 76 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:36:49,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-03-15 19:36:49,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 362. [2022-03-15 19:36:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 2.6952908587257616) internal successors, (973), 361 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:49,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 973 transitions. [2022-03-15 19:36:49,372 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 973 transitions. Word has length 25 [2022-03-15 19:36:49,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:49,372 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 973 transitions. [2022-03-15 19:36:49,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.073170731707317) internal successors, (126), 41 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 973 transitions. [2022-03-15 19:36:49,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:36:49,373 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:49,373 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:49,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:49,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-03-15 19:36:49,589 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:49,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:49,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1021910826, now seen corresponding path program 38 times [2022-03-15 19:36:49,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:49,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373642233] [2022-03-15 19:36:49,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:49,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:49,804 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:49,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:49,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373642233] [2022-03-15 19:36:49,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373642233] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:49,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785357479] [2022-03-15 19:36:49,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:36:49,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:49,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:49,806 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:49,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-03-15 19:36:49,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:36:49,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:49,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:36:49,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:50,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:50,654 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:36:50,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785357479] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:50,654 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:50,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 48 [2022-03-15 19:36:50,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [885348717] [2022-03-15 19:36:50,655 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:50,657 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:50,668 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 165 transitions. [2022-03-15 19:36:50,668 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:52,510 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [34271#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 34272#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 34277#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 34268#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 34275#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 34274#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 34276#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M1~0))) (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 34278#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 34273#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 34281#(and (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 34282#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 34267#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 34280#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 34269#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 34279#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 34266#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 34283#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 34270#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))))] [2022-03-15 19:36:52,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:36:52,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:52,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:36:52,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=3910, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:36:52,511 INFO L87 Difference]: Start difference. First operand 362 states and 973 transitions. Second operand has 37 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 36 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:53,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:53,484 INFO L93 Difference]: Finished difference Result 577 states and 1425 transitions. [2022-03-15 19:36:53,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-15 19:36:53,484 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 36 states have internal predecessors, (107), 0 states have call successors, (0), 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:36:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:53,486 INFO L225 Difference]: With dead ends: 577 [2022-03-15 19:36:53,486 INFO L226 Difference]: Without dead ends: 548 [2022-03-15 19:36:53,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3019 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1185, Invalid=7005, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 19:36:53,487 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 142 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:53,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 51 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:36:53,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-03-15 19:36:53,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 376. [2022-03-15 19:36:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 2.6826666666666665) internal successors, (1006), 375 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1006 transitions. [2022-03-15 19:36:53,515 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1006 transitions. Word has length 25 [2022-03-15 19:36:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:53,515 INFO L470 AbstractCegarLoop]: Abstraction has 376 states and 1006 transitions. [2022-03-15 19:36:53,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 36 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1006 transitions. [2022-03-15 19:36:53,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:36:53,516 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:53,516 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:53,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-03-15 19:36:53,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-03-15 19:36:53,716 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:53,717 INFO L85 PathProgramCache]: Analyzing trace with hash -735695352, now seen corresponding path program 39 times [2022-03-15 19:36:53,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:53,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127731028] [2022-03-15 19:36:53,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:53,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:53,941 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:53,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127731028] [2022-03-15 19:36:53,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127731028] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:53,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517790445] [2022-03-15 19:36:53,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:36:53,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:53,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:53,943 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:53,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-03-15 19:36:54,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:36:54,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:54,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-15 19:36:54,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:54,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:55,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517790445] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:55,224 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:55,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 48 [2022-03-15 19:36:55,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [856325351] [2022-03-15 19:36:55,224 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:55,226 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:55,238 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 156 transitions. [2022-03-15 19:36:55,239 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:36:57,056 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [35867#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 35856#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 35854#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 35865#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 35864#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 35863#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 35857#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 35866#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 35861#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 35855#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 35868#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M1~0))) (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 35858#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 35860#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 35853#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 35869#(and (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 35862#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 35859#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:36:57,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:36:57,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:36:57,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:36:57,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=3877, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:36:57,058 INFO L87 Difference]: Start difference. First operand 376 states and 1006 transitions. Second operand has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 35 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:36:58,477 INFO L93 Difference]: Finished difference Result 691 states and 1715 transitions. [2022-03-15 19:36:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 19:36:58,477 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 35 states have internal predecessors, (102), 0 states have call successors, (0), 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:36:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:36:58,480 INFO L225 Difference]: With dead ends: 691 [2022-03-15 19:36:58,480 INFO L226 Difference]: Without dead ends: 666 [2022-03-15 19:36:58,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2631 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1099, Invalid=7457, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 19:36:58,481 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 141 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:36:58,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 44 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:36:58,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-03-15 19:36:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 394. [2022-03-15 19:36:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 2.704834605597964) internal successors, (1063), 393 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1063 transitions. [2022-03-15 19:36:58,487 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1063 transitions. Word has length 25 [2022-03-15 19:36:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:36:58,487 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 1063 transitions. [2022-03-15 19:36:58,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.914285714285714) internal successors, (102), 35 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:36:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1063 transitions. [2022-03-15 19:36:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:36:58,488 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:36:58,488 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:36:58,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-03-15 19:36:58,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-03-15 19:36:58,693 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:36:58,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:36:58,693 INFO L85 PathProgramCache]: Analyzing trace with hash 104821398, now seen corresponding path program 40 times [2022-03-15 19:36:58,694 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:36:58,694 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334035144] [2022-03-15 19:36:58,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:36:58,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:36:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:36:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:58,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:36:58,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334035144] [2022-03-15 19:36:58,939 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334035144] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:36:58,939 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037561364] [2022-03-15 19:36:58,939 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:36:58,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:36:58,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:36:58,940 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:36:58,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-03-15 19:36:59,007 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:36:59,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:36:59,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:36:59,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:36:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:59,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:36:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:36:59,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037561364] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:36:59,580 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:36:59,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 48 [2022-03-15 19:36:59,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [573220855] [2022-03-15 19:36:59,580 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:36:59,594 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:36:59,627 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 147 transitions. [2022-03-15 19:36:59,627 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:01,063 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [37595#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 37596#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 37598#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 37606#(and (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 37597#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 37608#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 37601#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 37603#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 37602#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 37609#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 37607#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 37610#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 37604#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 37600#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 37599#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 37605#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M1~0))) (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0))))] [2022-03-15 19:37:01,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:37:01,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:01,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:37:01,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=3693, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:37:01,064 INFO L87 Difference]: Start difference. First operand 394 states and 1063 transitions. Second operand has 35 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:02,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:02,238 INFO L93 Difference]: Finished difference Result 733 states and 1801 transitions. [2022-03-15 19:37:02,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-15 19:37:02,238 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 0 states have call successors, (0), 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:37:02,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:02,240 INFO L225 Difference]: With dead ends: 733 [2022-03-15 19:37:02,240 INFO L226 Difference]: Without dead ends: 704 [2022-03-15 19:37:02,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3017 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1423, Invalid=7889, Unknown=0, NotChecked=0, Total=9312 [2022-03-15 19:37:02,241 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 105 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:02,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 53 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:37:02,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-03-15 19:37:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 360. [2022-03-15 19:37:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 2.6462395543175488) internal successors, (950), 359 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 950 transitions. [2022-03-15 19:37:02,262 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 950 transitions. Word has length 25 [2022-03-15 19:37:02,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:02,263 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 950 transitions. [2022-03-15 19:37:02,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.8529411764705883) internal successors, (97), 34 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 950 transitions. [2022-03-15 19:37:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:37:02,263 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:02,263 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:02,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:02,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:02,489 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:02,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:02,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1530633144, now seen corresponding path program 41 times [2022-03-15 19:37:02,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:02,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299141128] [2022-03-15 19:37:02,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:02,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:02,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:02,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299141128] [2022-03-15 19:37:02,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299141128] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:02,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846563592] [2022-03-15 19:37:02,720 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:37:02,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:02,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:02,721 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:37:02,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-03-15 19:37:02,813 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:37:02,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:02,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:37:02,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:03,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:03,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846563592] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:03,421 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:03,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 48 [2022-03-15 19:37:03,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [854535932] [2022-03-15 19:37:03,421 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:03,424 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:03,434 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 138 transitions. [2022-03-15 19:37:03,434 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:04,573 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [39322#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 39326#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 39330#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 39327#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 39325#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M1~0))) (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 39324#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 39320#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 39331#(and (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 39332#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 39334#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 39333#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 39323#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 39321#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 39328#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 39329#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:37:04,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:37:04,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:04,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:37:04,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=3565, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 19:37:04,574 INFO L87 Difference]: Start difference. First operand 360 states and 950 transitions. Second operand has 34 states, 33 states have (on average 2.787878787878788) internal successors, (92), 33 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:37:05,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:05,728 INFO L93 Difference]: Finished difference Result 701 states and 1690 transitions. [2022-03-15 19:37:05,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 19:37:05,728 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.787878787878788) internal successors, (92), 33 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) Word has length 25 [2022-03-15 19:37:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:05,730 INFO L225 Difference]: With dead ends: 701 [2022-03-15 19:37:05,730 INFO L226 Difference]: Without dead ends: 668 [2022-03-15 19:37:05,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3183 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1607, Invalid=8493, Unknown=0, NotChecked=0, Total=10100 [2022-03-15 19:37:05,731 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 182 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:05,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 45 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:37:05,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-03-15 19:37:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 236. [2022-03-15 19:37:05,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 2.5319148936170213) internal successors, (595), 235 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 595 transitions. [2022-03-15 19:37:05,736 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 595 transitions. Word has length 25 [2022-03-15 19:37:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:05,736 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 595 transitions. [2022-03-15 19:37:05,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.787878787878788) internal successors, (92), 33 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:37:05,736 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 595 transitions. [2022-03-15 19:37:05,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:37:05,737 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:05,737 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:05,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:05,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:05,953 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:05,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:05,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1959777454, now seen corresponding path program 42 times [2022-03-15 19:37:05,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:05,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941821579] [2022-03-15 19:37:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:05,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:06,172 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:06,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941821579] [2022-03-15 19:37:06,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941821579] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:06,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688918814] [2022-03-15 19:37:06,172 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:37:06,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:06,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:06,177 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:37:06,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-03-15 19:37:06,255 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 19:37:06,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:06,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:37:06,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:06,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:07,068 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:37:07,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688918814] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:07,068 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:07,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 47 [2022-03-15 19:37:07,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1393062447] [2022-03-15 19:37:07,069 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:07,079 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:07,094 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 156 transitions. [2022-03-15 19:37:07,094 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:08,790 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [40776#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 40778#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 40782#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 40781#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 40788#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 40784#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 40774#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 40787#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 40786#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 40775#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 40785#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 40779#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 40780#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 40777#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 40773#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 40783#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:37:08,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:37:08,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:08,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:37:08,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=3586, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 19:37:08,791 INFO L87 Difference]: Start difference. First operand 236 states and 595 transitions. Second operand has 35 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 34 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:37:10,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:10,020 INFO L93 Difference]: Finished difference Result 479 states and 1113 transitions. [2022-03-15 19:37:10,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 19:37:10,020 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 34 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 25 [2022-03-15 19:37:10,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:10,022 INFO L225 Difference]: With dead ends: 479 [2022-03-15 19:37:10,022 INFO L226 Difference]: Without dead ends: 446 [2022-03-15 19:37:10,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2893 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1146, Invalid=6864, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 19:37:10,023 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 146 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:10,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 29 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:37:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-03-15 19:37:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 254. [2022-03-15 19:37:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 2.561264822134387) internal successors, (648), 253 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 648 transitions. [2022-03-15 19:37:10,027 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 648 transitions. Word has length 25 [2022-03-15 19:37:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:10,027 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 648 transitions. [2022-03-15 19:37:10,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 34 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:37:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 648 transitions. [2022-03-15 19:37:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:37:10,028 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:10,028 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:10,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-03-15 19:37:10,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-03-15 19:37:10,241 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:10,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash -97166378, now seen corresponding path program 43 times [2022-03-15 19:37:10,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:10,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256686374] [2022-03-15 19:37:10,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:10,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:10,476 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:10,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:10,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256686374] [2022-03-15 19:37:10,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256686374] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:10,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453642679] [2022-03-15 19:37:10,476 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:37:10,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:10,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:10,477 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:37:10,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-03-15 19:37:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:10,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:37:10,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:10,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:11,426 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:37:11,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453642679] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:11,426 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:11,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 47 [2022-03-15 19:37:11,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1492888945] [2022-03-15 19:37:11,427 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:11,429 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:11,439 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 147 transitions. [2022-03-15 19:37:11,439 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:13,392 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [42027#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 42021#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 42031#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 42022#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 42024#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 42025#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (not (< 2 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 42028#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 42030#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 42032#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 42029#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 42019#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 42023#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 42026#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 42020#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:37:13,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 19:37:13,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:13,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 19:37:13,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=3370, Unknown=0, NotChecked=0, Total=3906 [2022-03-15 19:37:13,392 INFO L87 Difference]: Start difference. First operand 254 states and 648 transitions. Second operand has 33 states, 32 states have (on average 2.96875) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:14,803 INFO L93 Difference]: Finished difference Result 589 states and 1396 transitions. [2022-03-15 19:37:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-15 19:37:14,803 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.96875) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 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:37:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:14,805 INFO L225 Difference]: With dead ends: 589 [2022-03-15 19:37:14,805 INFO L226 Difference]: Without dead ends: 552 [2022-03-15 19:37:14,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2805 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1210, Invalid=6980, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 19:37:14,806 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 143 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:14,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 36 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:37:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-03-15 19:37:14,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 288. [2022-03-15 19:37:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.6236933797909407) internal successors, (753), 287 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 753 transitions. [2022-03-15 19:37:14,813 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 753 transitions. Word has length 25 [2022-03-15 19:37:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:14,813 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 753 transitions. [2022-03-15 19:37:14,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.96875) internal successors, (95), 32 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:14,813 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 753 transitions. [2022-03-15 19:37:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:37:14,814 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:14,814 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:14,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:15,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-03-15 19:37:15,019 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash 562084270, now seen corresponding path program 44 times [2022-03-15 19:37:15,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:15,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530032230] [2022-03-15 19:37:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:15,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:15,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:15,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530032230] [2022-03-15 19:37:15,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530032230] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:15,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172326986] [2022-03-15 19:37:15,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:37:15,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:15,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:15,262 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:37:15,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-03-15 19:37:15,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:37:15,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:15,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:37:15,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:15,678 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:15,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:16,072 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:37:16,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172326986] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:16,072 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:16,072 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 47 [2022-03-15 19:37:16,072 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470069271] [2022-03-15 19:37:16,072 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:16,074 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:16,084 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 138 transitions. [2022-03-15 19:37:16,084 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:17,194 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [43457#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 43454#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 43455#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 43449#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 43453#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 43458#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 43447#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 43452#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 43456#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 43450#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 43448#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 43451#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:37:17,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 19:37:17,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:17,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 19:37:17,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=3145, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 19:37:17,195 INFO L87 Difference]: Start difference. First operand 288 states and 753 transitions. Second operand has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 30 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:37:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:18,268 INFO L93 Difference]: Finished difference Result 701 states and 1686 transitions. [2022-03-15 19:37:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 19:37:18,268 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 30 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) Word has length 25 [2022-03-15 19:37:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:18,270 INFO L225 Difference]: With dead ends: 701 [2022-03-15 19:37:18,270 INFO L226 Difference]: Without dead ends: 660 [2022-03-15 19:37:18,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2824 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1297, Invalid=7075, Unknown=0, NotChecked=0, Total=8372 [2022-03-15 19:37:18,271 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 137 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:18,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 28 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:37:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-03-15 19:37:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 314. [2022-03-15 19:37:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.6645367412140577) internal successors, (834), 313 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:18,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 834 transitions. [2022-03-15 19:37:18,276 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 834 transitions. Word has length 25 [2022-03-15 19:37:18,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:18,276 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 834 transitions. [2022-03-15 19:37:18,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 30 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:37:18,276 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 834 transitions. [2022-03-15 19:37:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-15 19:37:18,277 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:18,277 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:18,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:18,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-03-15 19:37:18,478 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:18,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:18,478 INFO L85 PathProgramCache]: Analyzing trace with hash -475982122, now seen corresponding path program 45 times [2022-03-15 19:37:18,478 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:18,478 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264242596] [2022-03-15 19:37:18,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:18,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:18,671 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:37:18,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:18,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264242596] [2022-03-15 19:37:18,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264242596] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:18,672 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585194252] [2022-03-15 19:37:18,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:37:18,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:18,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:18,675 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:37:18,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-03-15 19:37:18,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 19:37:18,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:18,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 44 conjunts are in the unsatisfiable core [2022-03-15 19:37:18,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:18,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:19,352 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:37:19,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585194252] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:19,353 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:19,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 47 [2022-03-15 19:37:19,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [969827661] [2022-03-15 19:37:19,353 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:19,355 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:19,364 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 129 transitions. [2022-03-15 19:37:19,364 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:20,828 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [45046#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 45047#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 45048#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 45045#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 45049#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 45052#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 45044#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 45050#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 45043#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 45051#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:37:20,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 19:37:20,829 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:20,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 19:37:20,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=2916, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 19:37:20,829 INFO L87 Difference]: Start difference. First operand 314 states and 834 transitions. Second operand has 29 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 28 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:22,029 INFO L93 Difference]: Finished difference Result 879 states and 2103 transitions. [2022-03-15 19:37:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 19:37:22,029 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 28 states have internal predecessors, (83), 0 states have call successors, (0), 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:37:22,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:22,032 INFO L225 Difference]: With dead ends: 879 [2022-03-15 19:37:22,032 INFO L226 Difference]: Without dead ends: 838 [2022-03-15 19:37:22,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3031 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1450, Invalid=7670, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 19:37:22,033 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 146 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:22,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 19 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:37:22,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-03-15 19:37:22,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 348. [2022-03-15 19:37:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 2.717579250720461) internal successors, (943), 347 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 943 transitions. [2022-03-15 19:37:22,041 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 943 transitions. Word has length 25 [2022-03-15 19:37:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:22,041 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 943 transitions. [2022-03-15 19:37:22,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 28 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 943 transitions. [2022-03-15 19:37:22,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:37:22,042 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:22,042 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:22,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-03-15 19:37:22,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:22,264 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash 495245913, now seen corresponding path program 46 times [2022-03-15 19:37:22,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:22,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540077019] [2022-03-15 19:37:22,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:22,361 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:22,361 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:22,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540077019] [2022-03-15 19:37:22,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540077019] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:22,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353335299] [2022-03-15 19:37:22,362 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:37:22,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:22,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:22,372 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:37:22,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-03-15 19:37:22,448 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:37:22,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:22,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 19:37:22,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:22,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:23,107 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:23,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353335299] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:23,107 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:23,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15] total 28 [2022-03-15 19:37:23,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [548808017] [2022-03-15 19:37:23,107 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:23,109 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:23,125 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 208 transitions. [2022-03-15 19:37:23,125 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:23,940 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:37:23,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:37:23,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:23,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:37:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2022-03-15 19:37:23,940 INFO L87 Difference]: Start difference. First operand 348 states and 943 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:24,302 INFO L93 Difference]: Finished difference Result 686 states and 1853 transitions. [2022-03-15 19:37:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 19:37:24,303 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 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:37:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:24,305 INFO L225 Difference]: With dead ends: 686 [2022-03-15 19:37:24,305 INFO L226 Difference]: Without dead ends: 620 [2022-03-15 19:37:24,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 113 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=292, Invalid=968, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:37:24,305 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:24,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 70 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:37:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-03-15 19:37:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 480. [2022-03-15 19:37:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 2.7536534446764094) internal successors, (1319), 479 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1319 transitions. [2022-03-15 19:37:24,312 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 1319 transitions. Word has length 26 [2022-03-15 19:37:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:24,312 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 1319 transitions. [2022-03-15 19:37:24,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 1319 transitions. [2022-03-15 19:37:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-15 19:37:24,313 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:24,313 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:24,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:24,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-03-15 19:37:24,522 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:24,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:24,522 INFO L85 PathProgramCache]: Analyzing trace with hash 2104832878, now seen corresponding path program 47 times [2022-03-15 19:37:24,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:24,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067879921] [2022-03-15 19:37:24,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:24,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:24,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:24,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067879921] [2022-03-15 19:37:24,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067879921] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:24,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456415891] [2022-03-15 19:37:24,795 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:37:24,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:24,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:24,796 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:37:24,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-03-15 19:37:24,870 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:37:24,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:24,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 48 conjunts are in the unsatisfiable core [2022-03-15 19:37:24,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:25,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:25,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456415891] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:25,707 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:25,707 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2022-03-15 19:37:25,707 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1699173007] [2022-03-15 19:37:25,707 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:25,709 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:25,724 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 208 transitions. [2022-03-15 19:37:25,724 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:28,335 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [48770#(and (= thread2Thread1of1ForFork1_~i~1 0) (= ~counter~0 0)), 48771#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 6 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 48743#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 48748#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 48762#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 48765#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 48757#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 48773#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 4 ~counter~0)), 48761#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 48758#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 48744#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 48763#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 48772#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 5 ~counter~0)), 48769#(and (or (< 7 ~M1~0) (<= (+ ~counter~0 7) ~M1~0) (not (< 6 ~M1~0))) (or (< 7 ~M1~0) (<= 0 ~counter~0) (not (< 6 ~M1~0)))), 48766#(and (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 48755#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 48756#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))), 48752#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 48767#(and (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 7 ~counter~0) (<= ~counter~0 ~M1~0)), 48759#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 48776#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 48768#(and (or (< 7 ~M1~0) (<= (+ ~counter~0 7) ~M1~0) (not (< 6 ~M1~0))) (or (< 7 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< 6 ~M1~0))) (or (< 7 ~M1~0) (<= 0 ~counter~0) (not (< 6 ~M1~0)))), 48746#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 48754#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0))), 48745#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 48747#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 48751#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 48753#(and (<= ~M1~0 ~counter~0) (<= 7 ~counter~0) (<= ~counter~0 ~M1~0)), 48749#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 48760#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 48775#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 2 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 48764#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 48750#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0))), 48774#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 3 ~counter~0))] [2022-03-15 19:37:28,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 19:37:28,335 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:28,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 19:37:28,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=909, Invalid=6401, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 19:37:28,336 INFO L87 Difference]: Start difference. First operand 480 states and 1319 transitions. Second operand has 54 states, 53 states have (on average 2.8867924528301887) internal successors, (153), 53 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:32,805 INFO L93 Difference]: Finished difference Result 816 states and 2082 transitions. [2022-03-15 19:37:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-15 19:37:32,805 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.8867924528301887) internal successors, (153), 53 states have internal predecessors, (153), 0 states have call successors, (0), 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:37:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:32,807 INFO L225 Difference]: With dead ends: 816 [2022-03-15 19:37:32,807 INFO L226 Difference]: Without dead ends: 806 [2022-03-15 19:37:32,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5765 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2138, Invalid=13612, Unknown=0, NotChecked=0, Total=15750 [2022-03-15 19:37:32,808 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 343 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 3011 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 3011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:32,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 97 Invalid, 3134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 3011 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 19:37:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-03-15 19:37:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 450. [2022-03-15 19:37:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 2.757238307349666) internal successors, (1238), 449 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1238 transitions. [2022-03-15 19:37:32,815 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1238 transitions. Word has length 26 [2022-03-15 19:37:32,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:32,815 INFO L470 AbstractCegarLoop]: Abstraction has 450 states and 1238 transitions. [2022-03-15 19:37:32,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.8867924528301887) internal successors, (153), 53 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1238 transitions. [2022-03-15 19:37:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:37:32,816 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:32,816 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:32,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:33,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-03-15 19:37:33,034 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:33,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1782327299, now seen corresponding path program 48 times [2022-03-15 19:37:33,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:33,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266217703] [2022-03-15 19:37:33,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:33,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:33,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266217703] [2022-03-15 19:37:33,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266217703] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:33,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346300974] [2022-03-15 19:37:33,298 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:37:33,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:33,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:33,299 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:37:33,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-03-15 19:37:33,410 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:37:33,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:33,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:37:33,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:33,819 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:33,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:34,401 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:37:34,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346300974] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:34,401 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:34,401 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 54 [2022-03-15 19:37:34,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [704336878] [2022-03-15 19:37:34,401 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:34,404 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:34,420 INFO L252 McrAutomatonBuilder]: Finished intersection with 116 states and 220 transitions. [2022-03-15 19:37:34,420 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:37,496 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [50796#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0))), 50801#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 50792#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 50805#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 50793#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0))), 50786#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 50802#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 50800#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 50795#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 50787#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 50794#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 50797#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 50804#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 50810#(and (or (< 7 ~M1~0) (<= (+ ~counter~0 7) ~M1~0) (not (< 6 ~M1~0))) (or (< 7 ~M1~0) (<= 0 ~counter~0) (not (< 6 ~M1~0)))), 50788#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 50789#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 50790#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 50806#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 50808#(and (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 50798#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 50807#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 50785#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 50791#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 50803#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 50809#(and (or (< 7 ~M1~0) (<= (+ ~counter~0 7) ~M1~0) (not (< 6 ~M1~0))) (or (< 7 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< 6 ~M1~0))) (or (< 7 ~M1~0) (<= 0 ~counter~0) (not (< 6 ~M1~0)))), 50799#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))))] [2022-03-15 19:37:37,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 19:37:37,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:37,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 19:37:37,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=805, Invalid=5837, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 19:37:37,497 INFO L87 Difference]: Start difference. First operand 450 states and 1238 transitions. Second operand has 47 states, 46 states have (on average 3.0652173913043477) internal successors, (141), 46 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:44,290 INFO L93 Difference]: Finished difference Result 796 states and 2029 transitions. [2022-03-15 19:37:44,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 19:37:44,290 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.0652173913043477) internal successors, (141), 46 states have internal predecessors, (141), 0 states have call successors, (0), 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:37:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:44,292 INFO L225 Difference]: With dead ends: 796 [2022-03-15 19:37:44,293 INFO L226 Difference]: Without dead ends: 782 [2022-03-15 19:37:44,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8660 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=3715, Invalid=23345, Unknown=0, NotChecked=0, Total=27060 [2022-03-15 19:37:44,295 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 307 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:44,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 82 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:37:44,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-03-15 19:37:44,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 504. [2022-03-15 19:37:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 2.775347912524851) internal successors, (1396), 503 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1396 transitions. [2022-03-15 19:37:44,324 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1396 transitions. Word has length 27 [2022-03-15 19:37:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:44,324 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 1396 transitions. [2022-03-15 19:37:44,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.0652173913043477) internal successors, (141), 46 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1396 transitions. [2022-03-15 19:37:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:37:44,325 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:44,325 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:44,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:44,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-03-15 19:37:44,539 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:44,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:44,540 INFO L85 PathProgramCache]: Analyzing trace with hash 402192495, now seen corresponding path program 49 times [2022-03-15 19:37:44,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:44,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846305553] [2022-03-15 19:37:44,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:44,759 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:44,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846305553] [2022-03-15 19:37:44,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846305553] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:44,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137607444] [2022-03-15 19:37:44,759 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:37:44,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:44,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:44,764 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:37:44,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-03-15 19:37:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:44,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:37:44,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:45,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:45,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137607444] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:45,762 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:45,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 54 [2022-03-15 19:37:45,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1341881373] [2022-03-15 19:37:45,762 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:45,765 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:45,781 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 189 transitions. [2022-03-15 19:37:45,781 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:47,579 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [53009#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 52999#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 52997#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 53012#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 53002#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 53003#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 53001#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 53004#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 53005#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (not (< 5 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 52993#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 53008#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 53011#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 52994#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 53000#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 52998#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 53006#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 53010#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 53007#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 53013#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 52996#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 52995#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:37:47,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:37:47,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:47,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:37:47,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=828, Invalid=5024, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 19:37:47,580 INFO L87 Difference]: Start difference. First operand 504 states and 1396 transitions. Second operand has 42 states, 41 states have (on average 2.975609756097561) internal successors, (122), 41 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:48,503 INFO L93 Difference]: Finished difference Result 773 states and 1986 transitions. [2022-03-15 19:37:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 19:37:48,503 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.975609756097561) internal successors, (122), 41 states have internal predecessors, (122), 0 states have call successors, (0), 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:37:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:48,505 INFO L225 Difference]: With dead ends: 773 [2022-03-15 19:37:48,505 INFO L226 Difference]: Without dead ends: 740 [2022-03-15 19:37:48,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3760 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1512, Invalid=8994, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 19:37:48,508 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 177 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:48,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 54 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:37:48,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-03-15 19:37:48,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 536. [2022-03-15 19:37:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 2.770093457943925) internal successors, (1482), 535 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1482 transitions. [2022-03-15 19:37:48,516 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1482 transitions. Word has length 27 [2022-03-15 19:37:48,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:48,516 INFO L470 AbstractCegarLoop]: Abstraction has 536 states and 1482 transitions. [2022-03-15 19:37:48,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.975609756097561) internal successors, (122), 41 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1482 transitions. [2022-03-15 19:37:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:37:48,517 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:48,517 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:48,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:48,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2022-03-15 19:37:48,731 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:48,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash 684937597, now seen corresponding path program 50 times [2022-03-15 19:37:48,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:48,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938647040] [2022-03-15 19:37:48,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:48,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:48,974 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:48,974 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938647040] [2022-03-15 19:37:48,974 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938647040] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:48,974 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912497062] [2022-03-15 19:37:48,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:37:48,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:48,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:48,976 INFO L229 MonitoredProcess]: Starting monitored process 52 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:37:48,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-03-15 19:37:49,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:37:49,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:49,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:37:49,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:49,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 11 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:49,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912497062] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:49,751 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:49,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 54 [2022-03-15 19:37:49,751 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [791342276] [2022-03-15 19:37:49,751 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:49,753 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:49,767 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 180 transitions. [2022-03-15 19:37:49,768 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:51,573 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [55135#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 55125#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 55138#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 55140#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 55130#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 55131#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 55139#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (not (< 5 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 55141#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 55137#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 55124#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 55123#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 55132#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 55128#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 55127#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 55126#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 55129#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 55133#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 55142#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 55134#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 55136#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:37:51,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:37:51,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:51,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:37:51,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=4913, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 19:37:51,574 INFO L87 Difference]: Start difference. First operand 536 states and 1482 transitions. Second operand has 41 states, 40 states have (on average 2.925) internal successors, (117), 40 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:52,682 INFO L93 Difference]: Finished difference Result 947 states and 2458 transitions. [2022-03-15 19:37:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 19:37:52,683 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.925) internal successors, (117), 40 states have internal predecessors, (117), 0 states have call successors, (0), 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:37:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:52,684 INFO L225 Difference]: With dead ends: 947 [2022-03-15 19:37:52,684 INFO L226 Difference]: Without dead ends: 918 [2022-03-15 19:37:52,685 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3818 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1597, Invalid=9323, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 19:37:52,686 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 171 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:52,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 55 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:37:52,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-03-15 19:37:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 568. [2022-03-15 19:37:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 2.797178130511464) internal successors, (1586), 567 states have internal predecessors, (1586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1586 transitions. [2022-03-15 19:37:52,695 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1586 transitions. Word has length 27 [2022-03-15 19:37:52,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:52,695 INFO L470 AbstractCegarLoop]: Abstraction has 568 states and 1586 transitions. [2022-03-15 19:37:52,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.925) internal successors, (117), 40 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1586 transitions. [2022-03-15 19:37:52,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:37:52,696 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:52,696 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:52,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:52,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:52,912 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:52,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:52,912 INFO L85 PathProgramCache]: Analyzing trace with hash 971153071, now seen corresponding path program 51 times [2022-03-15 19:37:52,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:52,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52943178] [2022-03-15 19:37:52,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:52,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:53,127 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:53,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52943178] [2022-03-15 19:37:53,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52943178] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:53,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28114508] [2022-03-15 19:37:53,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:37:53,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:53,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:53,129 INFO L229 MonitoredProcess]: Starting monitored process 53 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:37:53,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-03-15 19:37:53,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:37:53,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:53,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:37:53,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:53,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:53,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28114508] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:53,968 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:53,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 54 [2022-03-15 19:37:53,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [670018368] [2022-03-15 19:37:53,968 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:53,970 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:53,984 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 171 transitions. [2022-03-15 19:37:53,984 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:55,725 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [57504#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 57496#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 57509#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 57505#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 57514#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 57499#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 57500#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 57512#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 57513#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (not (< 5 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 57507#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 57511#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 57502#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 57501#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 57497#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 57510#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 57508#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 57498#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 57506#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 57503#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:37:55,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 19:37:55,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:55,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 19:37:55,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=4789, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 19:37:55,726 INFO L87 Difference]: Start difference. First operand 568 states and 1586 transitions. Second operand has 40 states, 39 states have (on average 2.871794871794872) internal successors, (112), 39 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:37:57,283 INFO L93 Difference]: Finished difference Result 1009 states and 2604 transitions. [2022-03-15 19:37:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 19:37:57,283 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.871794871794872) internal successors, (112), 39 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-03-15 19:37:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:37:57,285 INFO L225 Difference]: With dead ends: 1009 [2022-03-15 19:37:57,285 INFO L226 Difference]: Without dead ends: 976 [2022-03-15 19:37:57,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3981 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1762, Invalid=10010, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 19:37:57,286 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 152 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:37:57,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 50 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:37:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2022-03-15 19:37:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 538. [2022-03-15 19:37:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 2.7579143389199254) internal successors, (1481), 537 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1481 transitions. [2022-03-15 19:37:57,294 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1481 transitions. Word has length 27 [2022-03-15 19:37:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:37:57,294 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 1481 transitions. [2022-03-15 19:37:57,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.871794871794872) internal successors, (112), 39 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:37:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1481 transitions. [2022-03-15 19:37:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:37:57,295 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:37:57,295 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:37:57,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-03-15 19:37:57,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-03-15 19:37:57,512 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:37:57,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:37:57,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1811669821, now seen corresponding path program 52 times [2022-03-15 19:37:57,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:37:57,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274606317] [2022-03-15 19:37:57,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:37:57,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:37:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:37:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:57,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:37:57,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274606317] [2022-03-15 19:37:57,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274606317] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:37:57,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144042758] [2022-03-15 19:37:57,786 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:37:57,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:37:57,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:37:57,787 INFO L229 MonitoredProcess]: Starting monitored process 54 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:37:57,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-03-15 19:37:57,869 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:37:57,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:37:57,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:37:57,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:37:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:58,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:37:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:37:58,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144042758] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:37:58,563 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:37:58,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 54 [2022-03-15 19:37:58,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [13264624] [2022-03-15 19:37:58,564 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:37:58,566 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:37:58,580 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 162 transitions. [2022-03-15 19:37:58,580 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:37:59,937 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [59895#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 59886#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 59890#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 59885#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 59880#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 59883#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 59887#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 59897#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 59881#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 59882#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 59893#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 59892#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 59896#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (not (< 5 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 59889#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 59884#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 59888#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 59894#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 59891#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:37:59,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:37:59,938 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:37:59,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:37:59,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=4652, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 19:37:59,939 INFO L87 Difference]: Start difference. First operand 538 states and 1481 transitions. Second operand has 39 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:01,236 INFO L93 Difference]: Finished difference Result 1009 states and 2545 transitions. [2022-03-15 19:38:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 19:38:01,237 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 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:38:01,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:01,238 INFO L225 Difference]: With dead ends: 1009 [2022-03-15 19:38:01,239 INFO L226 Difference]: Without dead ends: 972 [2022-03-15 19:38:01,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4176 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1955, Invalid=10701, Unknown=0, NotChecked=0, Total=12656 [2022-03-15 19:38:01,240 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 173 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:01,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 42 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:38:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2022-03-15 19:38:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 472. [2022-03-15 19:38:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 2.6878980891719744) internal successors, (1266), 471 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1266 transitions. [2022-03-15 19:38:01,248 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1266 transitions. Word has length 27 [2022-03-15 19:38:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:01,248 INFO L470 AbstractCegarLoop]: Abstraction has 472 states and 1266 transitions. [2022-03-15 19:38:01,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.8157894736842106) internal successors, (107), 38 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:01,248 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1266 transitions. [2022-03-15 19:38:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:38:01,249 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:01,249 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:01,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-03-15 19:38:01,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:01,455 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:01,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:01,456 INFO L85 PathProgramCache]: Analyzing trace with hash 176215279, now seen corresponding path program 53 times [2022-03-15 19:38:01,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:01,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033299372] [2022-03-15 19:38:01,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:01,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:01,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:01,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033299372] [2022-03-15 19:38:01,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033299372] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:01,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012225658] [2022-03-15 19:38:01,715 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:38:01,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:01,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:01,716 INFO L229 MonitoredProcess]: Starting monitored process 55 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:38:01,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-03-15 19:38:01,819 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:38:01,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:01,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:38:01,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:02,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 11 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:02,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012225658] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:02,576 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:02,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 54 [2022-03-15 19:38:02,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [899992975] [2022-03-15 19:38:02,576 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:02,579 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:02,591 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 153 transitions. [2022-03-15 19:38:02,591 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:03,897 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [62150#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 62141#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 62147#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 62148#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 62151#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 62144#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 62153#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 62152#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 62142#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 62145#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 62157#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 62149#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 62155#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (not (< 5 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 62156#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 62146#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 62143#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 62154#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))))] [2022-03-15 19:38:03,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:38:03,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:03,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:38:03,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=754, Invalid=4502, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 19:38:03,898 INFO L87 Difference]: Start difference. First operand 472 states and 1266 transitions. Second operand has 38 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:05,386 INFO L93 Difference]: Finished difference Result 923 states and 2269 transitions. [2022-03-15 19:38:05,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 19:38:05,386 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 0 states have call successors, (0), 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:38:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:05,388 INFO L225 Difference]: With dead ends: 923 [2022-03-15 19:38:05,388 INFO L226 Difference]: Without dead ends: 882 [2022-03-15 19:38:05,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4309 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2176, Invalid=11396, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 19:38:05,390 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 174 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:05,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 53 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:38:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-03-15 19:38:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 276. [2022-03-15 19:38:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 2.538181818181818) internal successors, (698), 275 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 698 transitions. [2022-03-15 19:38:05,399 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 698 transitions. Word has length 27 [2022-03-15 19:38:05,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:05,400 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 698 transitions. [2022-03-15 19:38:05,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:05,400 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 698 transitions. [2022-03-15 19:38:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:38:05,400 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:05,400 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:05,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-03-15 19:38:05,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:05,604 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:05,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:05,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1654751337, now seen corresponding path program 54 times [2022-03-15 19:38:05,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:05,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697057311] [2022-03-15 19:38:05,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:05,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:05,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:05,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697057311] [2022-03-15 19:38:05,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697057311] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:05,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383098304] [2022-03-15 19:38:05,871 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:38:05,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:05,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:05,888 INFO L229 MonitoredProcess]: Starting monitored process 56 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:38:05,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-03-15 19:38:05,972 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:38:05,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:05,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:38:05,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:06,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:06,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383098304] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:06,699 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:06,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 53 [2022-03-15 19:38:06,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [599491634] [2022-03-15 19:38:06,700 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:06,702 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:06,716 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 180 transitions. [2022-03-15 19:38:06,716 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:08,409 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [63941#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 63943#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 63932#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 63939#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 63938#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 63944#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 63934#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 63950#(and (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 63947#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 63937#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 63933#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 63936#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 63942#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 63940#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 63948#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 63949#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M1~0))) (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 63945#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 63946#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 63935#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:38:08,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 19:38:08,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:08,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 19:38:08,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=4659, Unknown=0, NotChecked=0, Total=5402 [2022-03-15 19:38:08,410 INFO L87 Difference]: Start difference. First operand 276 states and 698 transitions. Second operand has 40 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 39 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:38:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:09,316 INFO L93 Difference]: Finished difference Result 555 states and 1296 transitions. [2022-03-15 19:38:09,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 19:38:09,316 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 39 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) Word has length 27 [2022-03-15 19:38:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:09,317 INFO L225 Difference]: With dead ends: 555 [2022-03-15 19:38:09,317 INFO L226 Difference]: Without dead ends: 518 [2022-03-15 19:38:09,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3688 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1464, Invalid=8838, Unknown=0, NotChecked=0, Total=10302 [2022-03-15 19:38:09,318 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 169 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:09,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 37 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:38:09,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-03-15 19:38:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 294. [2022-03-15 19:38:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.5631399317406145) internal successors, (751), 293 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 751 transitions. [2022-03-15 19:38:09,323 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 751 transitions. Word has length 27 [2022-03-15 19:38:09,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:09,324 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 751 transitions. [2022-03-15 19:38:09,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 39 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:38:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 751 transitions. [2022-03-15 19:38:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:38:09,324 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:09,324 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:09,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-03-15 19:38:09,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:09,539 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:09,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:09,540 INFO L85 PathProgramCache]: Analyzing trace with hash -995500689, now seen corresponding path program 55 times [2022-03-15 19:38:09,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:09,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598048623] [2022-03-15 19:38:09,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:09,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:09,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:09,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598048623] [2022-03-15 19:38:09,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598048623] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:09,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599814189] [2022-03-15 19:38:09,793 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:38:09,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:09,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:09,794 INFO L229 MonitoredProcess]: Starting monitored process 57 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:38:09,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-03-15 19:38:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:09,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:38:09,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:10,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:10,855 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:10,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599814189] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:10,855 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:10,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 53 [2022-03-15 19:38:10,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [318659374] [2022-03-15 19:38:10,856 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:10,858 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:10,871 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 171 transitions. [2022-03-15 19:38:10,871 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:12,582 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [65361#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 65368#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 65372#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 65363#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 65362#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 65369#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 65377#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 65371#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 65370#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 65364#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 65376#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 65374#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 65375#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 65366#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 65365#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 65367#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 65373#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:38:12,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:38:12,583 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:12,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:38:12,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=4418, Unknown=0, NotChecked=0, Total=5112 [2022-03-15 19:38:12,583 INFO L87 Difference]: Start difference. First operand 294 states and 751 transitions. Second operand has 38 states, 37 states have (on average 2.972972972972973) internal successors, (110), 37 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:13,679 INFO L93 Difference]: Finished difference Result 677 states and 1610 transitions. [2022-03-15 19:38:13,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 19:38:13,680 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.972972972972973) internal successors, (110), 37 states have internal predecessors, (110), 0 states have call successors, (0), 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:38:13,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:13,681 INFO L225 Difference]: With dead ends: 677 [2022-03-15 19:38:13,681 INFO L226 Difference]: Without dead ends: 636 [2022-03-15 19:38:13,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3834 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1529, Invalid=8977, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 19:38:13,683 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 168 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:13,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 37 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:38:13,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-03-15 19:38:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 328. [2022-03-15 19:38:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.617737003058104) internal successors, (856), 327 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 856 transitions. [2022-03-15 19:38:13,688 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 856 transitions. Word has length 27 [2022-03-15 19:38:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:13,689 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 856 transitions. [2022-03-15 19:38:13,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.972972972972973) internal successors, (110), 37 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 856 transitions. [2022-03-15 19:38:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:38:13,689 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:13,689 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:13,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-03-15 19:38:13,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:13,908 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:13,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:13,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2033567081, now seen corresponding path program 56 times [2022-03-15 19:38:13,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:13,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685667153] [2022-03-15 19:38:13,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:13,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:14,172 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:14,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685667153] [2022-03-15 19:38:14,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685667153] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:14,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190155951] [2022-03-15 19:38:14,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:38:14,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:14,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:14,184 INFO L229 MonitoredProcess]: Starting monitored process 58 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:38:14,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-03-15 19:38:14,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:38:14,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:14,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:38:14,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:14,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:15,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190155951] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:15,295 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:15,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 53 [2022-03-15 19:38:15,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2142939146] [2022-03-15 19:38:15,303 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:15,318 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:15,330 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 162 transitions. [2022-03-15 19:38:15,331 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:17,539 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [66993#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 66998#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 66995#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 66990#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 66989#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 66987#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 66986#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 66997#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 66988#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 66991#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 66992#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 66996#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 66985#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 66994#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (not (< 2 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 66984#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))] [2022-03-15 19:38:17,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 19:38:17,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:17,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 19:38:17,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=662, Invalid=4168, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 19:38:17,540 INFO L87 Difference]: Start difference. First operand 328 states and 856 transitions. Second operand has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 35 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:19,255 INFO L93 Difference]: Finished difference Result 801 states and 1931 transitions. [2022-03-15 19:38:19,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 19:38:19,256 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 35 states have internal predecessors, (104), 0 states have call successors, (0), 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:38:19,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:19,257 INFO L225 Difference]: With dead ends: 801 [2022-03-15 19:38:19,257 INFO L226 Difference]: Without dead ends: 756 [2022-03-15 19:38:19,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3724 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1617, Invalid=9095, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 19:38:19,259 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 163 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:19,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 32 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:38:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-03-15 19:38:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 372. [2022-03-15 19:38:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 2.673854447439353) internal successors, (992), 371 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 992 transitions. [2022-03-15 19:38:19,273 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 992 transitions. Word has length 27 [2022-03-15 19:38:19,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:19,273 INFO L470 AbstractCegarLoop]: Abstraction has 372 states and 992 transitions. [2022-03-15 19:38:19,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 35 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 992 transitions. [2022-03-15 19:38:19,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:38:19,274 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:19,274 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:19,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-03-15 19:38:19,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-03-15 19:38:19,488 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:19,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash 146113135, now seen corresponding path program 57 times [2022-03-15 19:38:19,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:19,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118038491] [2022-03-15 19:38:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:19,729 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:19,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118038491] [2022-03-15 19:38:19,729 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118038491] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:19,729 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409324464] [2022-03-15 19:38:19,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:38:19,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:19,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:19,731 INFO L229 MonitoredProcess]: Starting monitored process 59 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:38:19,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-03-15 19:38:19,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:38:19,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:19,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:38:19,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:20,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:20,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409324464] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:20,839 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:20,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 53 [2022-03-15 19:38:20,839 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [294251104] [2022-03-15 19:38:20,839 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:20,842 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:20,854 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 153 transitions. [2022-03-15 19:38:20,855 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:22,579 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [68829#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 68825#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 68827#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 68832#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 68826#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 68831#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 68824#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 68823#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 68835#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 68833#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 68828#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 68830#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 68834#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:38:22,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 19:38:22,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:22,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 19:38:22,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=3909, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 19:38:22,580 INFO L87 Difference]: Start difference. First operand 372 states and 992 transitions. Second operand has 34 states, 33 states have (on average 2.9696969696969697) internal successors, (98), 33 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:24,419 INFO L93 Difference]: Finished difference Result 927 states and 2259 transitions. [2022-03-15 19:38:24,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 19:38:24,419 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.9696969696969697) internal successors, (98), 33 states have internal predecessors, (98), 0 states have call successors, (0), 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:38:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:24,421 INFO L225 Difference]: With dead ends: 927 [2022-03-15 19:38:24,421 INFO L226 Difference]: Without dead ends: 878 [2022-03-15 19:38:24,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3594 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1728, Invalid=9192, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 19:38:24,422 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 176 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:24,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 32 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:38:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-03-15 19:38:24,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 404. [2022-03-15 19:38:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 2.7096774193548385) internal successors, (1092), 403 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1092 transitions. [2022-03-15 19:38:24,429 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1092 transitions. Word has length 27 [2022-03-15 19:38:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:24,429 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 1092 transitions. [2022-03-15 19:38:24,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.9696969696969697) internal successors, (98), 33 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:24,429 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1092 transitions. [2022-03-15 19:38:24,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-03-15 19:38:24,430 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:24,430 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:24,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-03-15 19:38:24,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-03-15 19:38:24,643 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:24,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:24,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1003276905, now seen corresponding path program 58 times [2022-03-15 19:38:24,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:24,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711884169] [2022-03-15 19:38:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:24,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:24,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:24,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711884169] [2022-03-15 19:38:24,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711884169] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:24,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008657989] [2022-03-15 19:38:24,892 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:38:24,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:24,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:24,893 INFO L229 MonitoredProcess]: Starting monitored process 60 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:38:24,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-03-15 19:38:24,972 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:38:24,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:24,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 49 conjunts are in the unsatisfiable core [2022-03-15 19:38:24,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:25,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 15 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:26,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008657989] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:26,054 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:26,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 53 [2022-03-15 19:38:26,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [159418739] [2022-03-15 19:38:26,054 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:26,057 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:26,070 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 144 transitions. [2022-03-15 19:38:26,070 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:27,317 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [70865#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 70859#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 70860#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 70861#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 70863#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 70866#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 70857#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 70858#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 70856#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 70862#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 70864#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:38:27,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 19:38:27,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:27,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 19:38:27,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=3646, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 19:38:27,318 INFO L87 Difference]: Start difference. First operand 404 states and 1092 transitions. Second operand has 32 states, 31 states have (on average 2.967741935483871) internal successors, (92), 31 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:38:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:28,803 INFO L93 Difference]: Finished difference Result 1191 states and 2888 transitions. [2022-03-15 19:38:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 19:38:28,803 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.967741935483871) internal successors, (92), 31 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) Word has length 27 [2022-03-15 19:38:28,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:28,805 INFO L225 Difference]: With dead ends: 1191 [2022-03-15 19:38:28,805 INFO L226 Difference]: Without dead ends: 1142 [2022-03-15 19:38:28,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3896 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1910, Invalid=9862, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 19:38:28,806 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 152 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:28,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 23 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:38:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-03-15 19:38:28,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 464. [2022-03-15 19:38:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 2.773218142548596) internal successors, (1284), 463 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:28,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1284 transitions. [2022-03-15 19:38:28,814 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1284 transitions. Word has length 27 [2022-03-15 19:38:28,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:28,814 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 1284 transitions. [2022-03-15 19:38:28,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.967741935483871) internal successors, (92), 31 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:38:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1284 transitions. [2022-03-15 19:38:28,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:38:28,815 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:28,815 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:28,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-03-15 19:38:29,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-03-15 19:38:29,031 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:29,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash 581691524, now seen corresponding path program 59 times [2022-03-15 19:38:29,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:29,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186920284] [2022-03-15 19:38:29,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:29,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:29,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:29,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186920284] [2022-03-15 19:38:29,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186920284] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:29,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176542453] [2022-03-15 19:38:29,135 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:38:29,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:29,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:29,136 INFO L229 MonitoredProcess]: Starting monitored process 61 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:38:29,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-03-15 19:38:29,230 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:38:29,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:29,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 19:38:29,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:29,300 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:29,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:29,453 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:38:29,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176542453] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:29,453 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:29,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2022-03-15 19:38:29,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856780620] [2022-03-15 19:38:29,454 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:29,456 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:29,475 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 232 transitions. [2022-03-15 19:38:29,475 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:30,513 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:38:30,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:38:30,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:30,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:38:30,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:38:30,514 INFO L87 Difference]: Start difference. First operand 464 states and 1284 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:30,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:30,811 INFO L93 Difference]: Finished difference Result 886 states and 2456 transitions. [2022-03-15 19:38:30,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:38:30,811 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 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:38:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:30,813 INFO L225 Difference]: With dead ends: 886 [2022-03-15 19:38:30,813 INFO L226 Difference]: Without dead ends: 812 [2022-03-15 19:38:30,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 139 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:38:30,814 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:30,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 88 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:38:30,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-03-15 19:38:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 644. [2022-03-15 19:38:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 2.8133748055987557) internal successors, (1809), 643 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1809 transitions. [2022-03-15 19:38:30,822 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1809 transitions. Word has length 28 [2022-03-15 19:38:30,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:30,822 INFO L470 AbstractCegarLoop]: Abstraction has 644 states and 1809 transitions. [2022-03-15 19:38:30,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 11 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1809 transitions. [2022-03-15 19:38:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-03-15 19:38:30,823 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:30,823 INFO L514 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:30,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-03-15 19:38:31,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:31,044 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:31,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:31,045 INFO L85 PathProgramCache]: Analyzing trace with hash 966200533, now seen corresponding path program 60 times [2022-03-15 19:38:31,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:31,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914478446] [2022-03-15 19:38:31,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:31,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:31,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:31,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914478446] [2022-03-15 19:38:31,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914478446] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:31,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845994663] [2022-03-15 19:38:31,369 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:38:31,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:31,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:31,384 INFO L229 MonitoredProcess]: Starting monitored process 62 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:38:31,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-03-15 19:38:31,483 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:38:31,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:31,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 53 conjunts are in the unsatisfiable core [2022-03-15 19:38:31,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:31,937 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:31,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:32,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845994663] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:32,616 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:32,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 56 [2022-03-15 19:38:32,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [445458195] [2022-03-15 19:38:32,616 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:32,618 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:32,657 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 232 transitions. [2022-03-15 19:38:32,657 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:35,400 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 38 new interpolants: [75692#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 75680#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 6 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 75698#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 75663#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 75666#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 75690#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 75694#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 75684#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 75688#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 75687#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 75697#(and (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 75686#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 4 ~counter~0)), 75695#(and (or (not (< 7 ~M1~0)) (<= (+ ~counter~0 8) ~M1~0) (< 8 ~M1~0)) (or (not (< 7 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< 8 ~M1~0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0) (< 8 ~M1~0))), 75678#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 75677#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 7 ~counter~0)), 75671#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 75691#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 75674#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 75665#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 75664#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 75670#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 75681#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 75679#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))), 75683#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 5 ~counter~0)), 75673#(and (<= ~M1~0 ~counter~0) (<= 8 ~counter~0) (<= ~counter~0 ~M1~0)), 75685#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 75700#(and (or (not (< 7 ~M1~0)) (<= (+ ~counter~0 8) ~M1~0) (< 8 ~M1~0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0) (< 8 ~M1~0))), 75689#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 3 ~counter~0)), 75667#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 75669#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 75672#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 7 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 75682#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 75675#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 7 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 75696#(and (= thread2Thread1of1ForFork1_~i~1 0) (= ~counter~0 0)), 75668#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 75699#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 75693#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 2 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 75676#(and (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 8 ~counter~0) (<= ~counter~0 ~M1~0))] [2022-03-15 19:38:35,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 19:38:35,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:35,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 19:38:35,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1138, Invalid=7982, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 19:38:35,402 INFO L87 Difference]: Start difference. First operand 644 states and 1809 transitions. Second operand has 60 states, 59 states have (on average 2.8813559322033897) internal successors, (170), 59 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:40,470 INFO L93 Difference]: Finished difference Result 1044 states and 2733 transitions. [2022-03-15 19:38:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 19:38:40,470 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.8813559322033897) internal successors, (170), 59 states have internal predecessors, (170), 0 states have call successors, (0), 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:38:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:40,472 INFO L225 Difference]: With dead ends: 1044 [2022-03-15 19:38:40,472 INFO L226 Difference]: Without dead ends: 1034 [2022-03-15 19:38:40,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7570 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2673, Invalid=17067, Unknown=0, NotChecked=0, Total=19740 [2022-03-15 19:38:40,473 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 355 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 3840 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 3840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:40,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 114 Invalid, 3975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 3840 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:38:40,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-03-15 19:38:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 610. [2022-03-15 19:38:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 609 states have (on average 2.8210180623973726) internal successors, (1718), 609 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1718 transitions. [2022-03-15 19:38:40,484 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1718 transitions. Word has length 28 [2022-03-15 19:38:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:40,484 INFO L470 AbstractCegarLoop]: Abstraction has 610 states and 1718 transitions. [2022-03-15 19:38:40,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.8813559322033897) internal successors, (170), 59 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1718 transitions. [2022-03-15 19:38:40,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:38:40,485 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:40,485 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:40,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-03-15 19:38:40,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:40,702 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:40,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:40,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2027811544, now seen corresponding path program 61 times [2022-03-15 19:38:40,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:40,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386226422] [2022-03-15 19:38:40,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:40,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:40,994 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:38:40,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:40,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386226422] [2022-03-15 19:38:40,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386226422] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:40,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125702170] [2022-03-15 19:38:40,995 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:38:40,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:40,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:40,996 INFO L229 MonitoredProcess]: Starting monitored process 63 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:38:40,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-03-15 19:38:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:41,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:38:41,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:41,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:42,348 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:38:42,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125702170] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:42,348 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:42,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 60 [2022-03-15 19:38:42,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1082261811] [2022-03-15 19:38:42,348 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:42,350 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:42,370 INFO L252 McrAutomatonBuilder]: Finished intersection with 128 states and 244 transitions. [2022-03-15 19:38:42,371 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:46,055 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [78288#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 78305#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 78302#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 7 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 78311#(and (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 78310#(and (or (not (< 7 ~M1~0)) (<= (+ ~counter~0 8) ~M1~0) (< 8 ~M1~0)) (or (not (< 7 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< 8 ~M1~0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0) (< 8 ~M1~0))), 78289#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 78291#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 78293#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 78292#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 78301#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 78313#(and (or (not (< 7 ~M1~0)) (<= (+ ~counter~0 8) ~M1~0) (< 8 ~M1~0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0) (< 8 ~M1~0))), 78298#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 78306#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 78300#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 78285#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 78308#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 78294#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 78295#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 78296#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 7 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 78297#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 78303#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))), 78290#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 78304#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 78309#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 78287#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 78299#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 78312#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 78307#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 78286#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:38:46,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 19:38:46,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:46,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 19:38:46,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=7199, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 19:38:46,056 INFO L87 Difference]: Start difference. First operand 610 states and 1718 transitions. Second operand has 52 states, 51 states have (on average 3.0588235294117645) internal successors, (156), 51 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:54,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:38:54,060 INFO L93 Difference]: Finished difference Result 1008 states and 2638 transitions. [2022-03-15 19:38:54,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-03-15 19:38:54,061 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 3.0588235294117645) internal successors, (156), 51 states have internal predecessors, (156), 0 states have call successors, (0), 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:38:54,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:38:54,063 INFO L225 Difference]: With dead ends: 1008 [2022-03-15 19:38:54,063 INFO L226 Difference]: Without dead ends: 994 [2022-03-15 19:38:54,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11345 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=4821, Invalid=30335, Unknown=0, NotChecked=0, Total=35156 [2022-03-15 19:38:54,064 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 358 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 3057 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 3258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 3057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:38:54,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 145 Invalid, 3258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 3057 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:38:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2022-03-15 19:38:54,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 672. [2022-03-15 19:38:54,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 2.831594634873323) internal successors, (1900), 671 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1900 transitions. [2022-03-15 19:38:54,073 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1900 transitions. Word has length 29 [2022-03-15 19:38:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:38:54,073 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 1900 transitions. [2022-03-15 19:38:54,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.0588235294117645) internal successors, (156), 51 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:38:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1900 transitions. [2022-03-15 19:38:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:38:54,074 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:38:54,074 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:38:54,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-03-15 19:38:54,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:54,291 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:38:54,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:38:54,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1267792630, now seen corresponding path program 62 times [2022-03-15 19:38:54,291 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:38:54,291 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510417585] [2022-03-15 19:38:54,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:38:54,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:38:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:38:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:54,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:38:54,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510417585] [2022-03-15 19:38:54,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510417585] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:38:54,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528004962] [2022-03-15 19:38:54,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:38:54,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:38:54,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:38:54,581 INFO L229 MonitoredProcess]: Starting monitored process 64 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:38:54,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-03-15 19:38:54,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:38:54,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:38:54,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:38:54,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:38:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:38:55,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:38:55,953 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:38:55,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528004962] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:38:55,953 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:38:55,953 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 60 [2022-03-15 19:38:55,953 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1034568379] [2022-03-15 19:38:55,953 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:38:55,955 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:38:55,974 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 213 transitions. [2022-03-15 19:38:55,974 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:38:59,072 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [81096#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 81101#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 81100#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 81107#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 81112#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 6 ~M1~0))) (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 81110#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 81099#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 81093#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 81090#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 81106#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 81097#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 81092#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 81111#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 81109#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 81105#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 81094#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 81104#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 81102#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 81095#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 81103#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 81108#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 81098#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 81091#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 81113#(and (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0))))] [2022-03-15 19:38:59,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 19:38:59,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:38:59,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 19:38:59,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1034, Invalid=6276, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 19:38:59,073 INFO L87 Difference]: Start difference. First operand 672 states and 1900 transitions. Second operand has 47 states, 46 states have (on average 2.9782608695652173) internal successors, (137), 46 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:00,744 INFO L93 Difference]: Finished difference Result 999 states and 2642 transitions. [2022-03-15 19:39:00,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 19:39:00,744 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.9782608695652173) internal successors, (137), 46 states have internal predecessors, (137), 0 states have call successors, (0), 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:39:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:00,747 INFO L225 Difference]: With dead ends: 999 [2022-03-15 19:39:00,747 INFO L226 Difference]: Without dead ends: 962 [2022-03-15 19:39:00,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4784 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1881, Invalid=11229, Unknown=0, NotChecked=0, Total=13110 [2022-03-15 19:39:00,748 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 188 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:00,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 56 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:39:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-03-15 19:39:00,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 726. [2022-03-15 19:39:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 2.8289655172413792) internal successors, (2051), 725 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 2051 transitions. [2022-03-15 19:39:00,758 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 2051 transitions. Word has length 29 [2022-03-15 19:39:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:00,758 INFO L470 AbstractCegarLoop]: Abstraction has 726 states and 2051 transitions. [2022-03-15 19:39:00,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.9782608695652173) internal successors, (137), 46 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 2051 transitions. [2022-03-15 19:39:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:39:00,759 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:00,759 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:00,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-03-15 19:39:00,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-03-15 19:39:00,959 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:00,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:00,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1442956200, now seen corresponding path program 63 times [2022-03-15 19:39:00,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:00,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922088550] [2022-03-15 19:39:00,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:00,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:01,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:01,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922088550] [2022-03-15 19:39:01,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922088550] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:01,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539312989] [2022-03-15 19:39:01,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:39:01,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:01,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:01,249 INFO L229 MonitoredProcess]: Starting monitored process 65 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:39:01,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-03-15 19:39:01,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:39:01,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:01,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:39:01,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:01,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:02,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539312989] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:02,600 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:02,600 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 60 [2022-03-15 19:39:02,600 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1765131043] [2022-03-15 19:39:02,600 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:02,602 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:02,620 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 204 transitions. [2022-03-15 19:39:02,620 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:04,807 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [83874#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 83869#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 83872#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 83859#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 83858#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 83870#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 83863#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 83857#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 83871#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 83854#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 83862#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 83856#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 83853#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 83864#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 83875#(and (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 83861#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 83873#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 83867#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 6 ~M1~0))) (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 83855#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 83860#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 83865#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 83868#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 83866#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:39:04,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 19:39:04,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:04,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 19:39:04,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=6156, Unknown=0, NotChecked=0, Total=7140 [2022-03-15 19:39:04,808 INFO L87 Difference]: Start difference. First operand 726 states and 2051 transitions. Second operand has 46 states, 45 states have (on average 2.933333333333333) internal successors, (132), 45 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:06,064 INFO L93 Difference]: Finished difference Result 1243 states and 3329 transitions. [2022-03-15 19:39:06,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 19:39:06,064 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.933333333333333) internal successors, (132), 45 states have internal predecessors, (132), 0 states have call successors, (0), 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:39:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:06,066 INFO L225 Difference]: With dead ends: 1243 [2022-03-15 19:39:06,066 INFO L226 Difference]: Without dead ends: 1210 [2022-03-15 19:39:06,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4857 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1969, Invalid=11603, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 19:39:06,068 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 179 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:06,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 45 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:39:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2022-03-15 19:39:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 776. [2022-03-15 19:39:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 775 states have (on average 2.8593548387096774) internal successors, (2216), 775 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 2216 transitions. [2022-03-15 19:39:06,098 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 2216 transitions. Word has length 29 [2022-03-15 19:39:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:06,098 INFO L470 AbstractCegarLoop]: Abstraction has 776 states and 2216 transitions. [2022-03-15 19:39:06,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.933333333333333) internal successors, (132), 45 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 2216 transitions. [2022-03-15 19:39:06,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:39:06,100 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:06,100 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:06,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-03-15 19:39:06,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:06,322 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:06,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:06,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1725701302, now seen corresponding path program 64 times [2022-03-15 19:39:06,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:06,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53235410] [2022-03-15 19:39:06,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:06,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:06,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:06,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53235410] [2022-03-15 19:39:06,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53235410] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:06,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769771301] [2022-03-15 19:39:06,595 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:39:06,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:06,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:06,596 INFO L229 MonitoredProcess]: Starting monitored process 66 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:39:06,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-03-15 19:39:06,692 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:39:06,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:06,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:39:06,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:07,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:07,732 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 13 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:07,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769771301] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:07,732 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:07,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 60 [2022-03-15 19:39:07,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1932644536] [2022-03-15 19:39:07,733 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:07,735 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:07,752 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 195 transitions. [2022-03-15 19:39:07,752 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:09,589 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [86979#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 86965#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 86973#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 86966#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 86974#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 86972#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 86985#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 86982#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 86968#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 86981#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 86977#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 6 ~M1~0))) (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 86984#(and (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 86983#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 86970#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 86978#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 86971#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 86976#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 86967#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 86969#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 86975#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 86980#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 86986#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0)))] [2022-03-15 19:39:09,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 19:39:09,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:09,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 19:39:09,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=6023, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 19:39:09,590 INFO L87 Difference]: Start difference. First operand 776 states and 2216 transitions. Second operand has 45 states, 44 states have (on average 2.8863636363636362) internal successors, (127), 44 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:11,340 INFO L93 Difference]: Finished difference Result 1333 states and 3571 transitions. [2022-03-15 19:39:11,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 19:39:11,341 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.8863636363636362) internal successors, (127), 44 states have internal predecessors, (127), 0 states have call successors, (0), 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:39:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:11,343 INFO L225 Difference]: With dead ends: 1333 [2022-03-15 19:39:11,343 INFO L226 Difference]: Without dead ends: 1296 [2022-03-15 19:39:11,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4946 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2143, Invalid=12377, Unknown=0, NotChecked=0, Total=14520 [2022-03-15 19:39:11,344 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 193 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:11,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 74 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:39:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2022-03-15 19:39:11,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 746. [2022-03-15 19:39:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 2.8335570469798657) internal successors, (2111), 745 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 2111 transitions. [2022-03-15 19:39:11,371 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 2111 transitions. Word has length 29 [2022-03-15 19:39:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:11,372 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 2111 transitions. [2022-03-15 19:39:11,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.8863636363636362) internal successors, (127), 44 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 2111 transitions. [2022-03-15 19:39:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:39:11,373 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:11,373 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:11,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-03-15 19:39:11,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-03-15 19:39:11,589 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:11,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:11,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2011916776, now seen corresponding path program 65 times [2022-03-15 19:39:11,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:11,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949422170] [2022-03-15 19:39:11,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:11,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:11,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:11,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949422170] [2022-03-15 19:39:11,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949422170] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:11,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424092540] [2022-03-15 19:39:11,868 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:39:11,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:11,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:11,880 INFO L229 MonitoredProcess]: Starting monitored process 67 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:39:11,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-03-15 19:39:11,966 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:39:11,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:11,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:39:11,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:12,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:13,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424092540] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:13,129 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:13,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 60 [2022-03-15 19:39:13,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [124543218] [2022-03-15 19:39:13,129 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:13,132 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:13,148 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 186 transitions. [2022-03-15 19:39:13,149 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:15,171 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [90135#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 90122#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 90120#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 90129#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 90133#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 6 ~M1~0))) (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 90117#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 90119#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 90136#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 90130#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 90123#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 90126#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 90134#(and (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 90128#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 90131#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 90132#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 90118#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 90121#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 90125#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 90116#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 90127#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 90124#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)))] [2022-03-15 19:39:15,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 19:39:15,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:15,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 19:39:15,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=5877, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 19:39:15,172 INFO L87 Difference]: Start difference. First operand 746 states and 2111 transitions. Second operand has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:16,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:16,800 INFO L93 Difference]: Finished difference Result 1345 states and 3540 transitions. [2022-03-15 19:39:16,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-15 19:39:16,801 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 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:39:16,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:16,803 INFO L225 Difference]: With dead ends: 1345 [2022-03-15 19:39:16,803 INFO L226 Difference]: Without dead ends: 1304 [2022-03-15 19:39:16,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5206 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2345, Invalid=13155, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 19:39:16,804 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 192 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:16,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 66 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:39:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-03-15 19:39:16,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 704. [2022-03-15 19:39:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 2.793741109530583) internal successors, (1964), 703 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1964 transitions. [2022-03-15 19:39:16,814 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1964 transitions. Word has length 29 [2022-03-15 19:39:16,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:16,815 INFO L470 AbstractCegarLoop]: Abstraction has 704 states and 1964 transitions. [2022-03-15 19:39:16,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1964 transitions. [2022-03-15 19:39:16,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:39:16,816 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:16,816 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:16,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2022-03-15 19:39:17,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-03-15 19:39:17,027 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:17,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:17,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1442533770, now seen corresponding path program 66 times [2022-03-15 19:39:17,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:17,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106248250] [2022-03-15 19:39:17,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:17,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:17,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:17,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106248250] [2022-03-15 19:39:17,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106248250] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:17,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365645404] [2022-03-15 19:39:17,303 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:39:17,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:17,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:17,304 INFO L229 MonitoredProcess]: Starting monitored process 68 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:39:17,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-03-15 19:39:17,399 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:39:17,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:17,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:39:17,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:17,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 13 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:18,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365645404] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:18,226 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:18,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 60 [2022-03-15 19:39:18,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [408931427] [2022-03-15 19:39:18,226 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:18,228 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:18,245 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 177 transitions. [2022-03-15 19:39:18,246 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:20,458 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [93221#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 93223#(and (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 93214#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 93218#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 93207#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 93213#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 93222#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 6 ~M1~0))) (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 93210#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 93211#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 93216#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 93215#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 93206#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 93219#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 93208#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 93204#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 93209#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 93212#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 93220#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 93217#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 93205#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:39:20,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:39:20,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:20,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:39:20,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=924, Invalid=5718, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 19:39:20,459 INFO L87 Difference]: Start difference. First operand 704 states and 1964 transitions. Second operand has 43 states, 42 states have (on average 2.7857142857142856) internal successors, (117), 42 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:22,372 INFO L93 Difference]: Finished difference Result 1323 states and 3402 transitions. [2022-03-15 19:39:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 19:39:22,372 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.7857142857142856) internal successors, (117), 42 states have internal predecessors, (117), 0 states have call successors, (0), 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:39:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:22,374 INFO L225 Difference]: With dead ends: 1323 [2022-03-15 19:39:22,374 INFO L226 Difference]: Without dead ends: 1278 [2022-03-15 19:39:22,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5496 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2575, Invalid=13937, Unknown=0, NotChecked=0, Total=16512 [2022-03-15 19:39:22,376 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 214 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:22,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 59 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:39:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2022-03-15 19:39:22,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 598. [2022-03-15 19:39:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 2.7185929648241207) internal successors, (1623), 597 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1623 transitions. [2022-03-15 19:39:22,386 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1623 transitions. Word has length 29 [2022-03-15 19:39:22,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:22,386 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 1623 transitions. [2022-03-15 19:39:22,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.7857142857142856) internal successors, (117), 42 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:22,386 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1623 transitions. [2022-03-15 19:39:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:39:22,387 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:22,387 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:22,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2022-03-15 19:39:22,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-03-15 19:39:22,599 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:22,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:22,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1216978984, now seen corresponding path program 67 times [2022-03-15 19:39:22,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:22,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117661702] [2022-03-15 19:39:22,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:22,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:22,894 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:22,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:22,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117661702] [2022-03-15 19:39:22,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117661702] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:22,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619861047] [2022-03-15 19:39:22,894 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:39:22,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:22,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:22,896 INFO L229 MonitoredProcess]: Starting monitored process 69 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:39:22,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-03-15 19:39:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:23,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:39:23,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:23,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:23,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619861047] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:23,846 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:23,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 60 [2022-03-15 19:39:23,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [354580978] [2022-03-15 19:39:23,846 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:23,848 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:23,865 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 168 transitions. [2022-03-15 19:39:23,865 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:25,297 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [96077#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 96071#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 96084#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 6 ~M1~0))) (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 96078#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 96083#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 96070#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 96082#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 96080#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 96073#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 96076#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 96081#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 96075#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 96074#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 96079#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 96067#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 96085#(and (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 96068#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 96069#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 96072#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:39:25,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:39:25,297 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:25,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:39:25,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=934, Invalid=5546, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 19:39:25,298 INFO L87 Difference]: Start difference. First operand 598 states and 1623 transitions. Second operand has 42 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:27,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:27,067 INFO L93 Difference]: Finished difference Result 1167 states and 2913 transitions. [2022-03-15 19:39:27,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 19:39:27,067 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-03-15 19:39:27,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:27,069 INFO L225 Difference]: With dead ends: 1167 [2022-03-15 19:39:27,069 INFO L226 Difference]: Without dead ends: 1118 [2022-03-15 19:39:27,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5609 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2833, Invalid=14723, Unknown=0, NotChecked=0, Total=17556 [2022-03-15 19:39:27,083 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 253 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:27,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 65 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:39:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2022-03-15 19:39:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 318. [2022-03-15 19:39:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 2.5425867507886437) internal successors, (806), 317 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 806 transitions. [2022-03-15 19:39:27,090 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 806 transitions. Word has length 29 [2022-03-15 19:39:27,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:27,090 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 806 transitions. [2022-03-15 19:39:27,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.731707317073171) internal successors, (112), 41 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 806 transitions. [2022-03-15 19:39:27,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:39:27,091 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:27,091 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:27,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-03-15 19:39:27,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-03-15 19:39:27,321 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:27,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1927043278, now seen corresponding path program 68 times [2022-03-15 19:39:27,322 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:27,322 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014733079] [2022-03-15 19:39:27,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:27,607 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:27,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:27,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014733079] [2022-03-15 19:39:27,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014733079] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:27,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458409745] [2022-03-15 19:39:27,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:39:27,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:27,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:27,609 INFO L229 MonitoredProcess]: Starting monitored process 70 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:39:27,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-03-15 19:39:27,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:39:27,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:27,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:39:27,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:28,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:28,911 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:39:28,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458409745] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:28,912 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:28,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 59 [2022-03-15 19:39:28,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1748289329] [2022-03-15 19:39:28,912 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:28,914 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:28,932 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 204 transitions. [2022-03-15 19:39:28,932 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:31,839 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [98226#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 98230#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 98222#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 98237#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 98239#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 98236#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 98241#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 98223#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 98240#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 98229#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 98225#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 98224#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 98238#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 98233#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 98228#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 98234#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 98231#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (not (< 5 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 98232#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 98235#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 98242#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 98243#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 98227#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:39:31,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 19:39:31,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:31,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 19:39:31,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=936, Invalid=5870, Unknown=0, NotChecked=0, Total=6806 [2022-03-15 19:39:31,840 INFO L87 Difference]: Start difference. First operand 318 states and 806 transitions. Second operand has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 44 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:33,406 INFO L93 Difference]: Finished difference Result 633 states and 1484 transitions. [2022-03-15 19:39:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-15 19:39:33,406 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 44 states have internal predecessors, (131), 0 states have call successors, (0), 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:39:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:33,407 INFO L225 Difference]: With dead ends: 633 [2022-03-15 19:39:33,407 INFO L226 Difference]: Without dead ends: 592 [2022-03-15 19:39:33,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4709 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1824, Invalid=11058, Unknown=0, NotChecked=0, Total=12882 [2022-03-15 19:39:33,409 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 195 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:33,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 50 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:39:33,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-03-15 19:39:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 336. [2022-03-15 19:39:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.564179104477612) internal successors, (859), 335 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 859 transitions. [2022-03-15 19:39:33,413 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 859 transitions. Word has length 29 [2022-03-15 19:39:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:33,413 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 859 transitions. [2022-03-15 19:39:33,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 44 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:33,413 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 859 transitions. [2022-03-15 19:39:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:39:33,414 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:33,414 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:33,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-03-15 19:39:33,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:33,614 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:33,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash 888976886, now seen corresponding path program 69 times [2022-03-15 19:39:33,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:33,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801729312] [2022-03-15 19:39:33,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:33,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:33,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:33,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801729312] [2022-03-15 19:39:33,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801729312] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:33,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647982223] [2022-03-15 19:39:33,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:39:33,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:33,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:33,937 INFO L229 MonitoredProcess]: Starting monitored process 71 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:39:33,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-03-15 19:39:34,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-15 19:39:34,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:34,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:39:34,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:34,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:35,230 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:39:35,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647982223] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:35,230 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:35,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 59 [2022-03-15 19:39:35,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1388137] [2022-03-15 19:39:35,230 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:35,232 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:35,260 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 195 transitions. [2022-03-15 19:39:35,260 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:38,159 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [99854#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 99844#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 99849#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 99843#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 99859#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 99850#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M1~0))) (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 99853#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 99855#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 99851#(and (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 99858#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 99848#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 99841#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 99852#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 99845#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 99842#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 99846#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 99847#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 99857#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 99840#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 99856#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0)))] [2022-03-15 19:39:38,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:39:38,159 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:38,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:39:38,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=876, Invalid=5604, Unknown=0, NotChecked=0, Total=6480 [2022-03-15 19:39:38,160 INFO L87 Difference]: Start difference. First operand 336 states and 859 transitions. Second operand has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 42 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:39,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:39,585 INFO L93 Difference]: Finished difference Result 767 states and 1829 transitions. [2022-03-15 19:39:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 19:39:39,586 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 42 states have internal predecessors, (125), 0 states have call successors, (0), 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:39:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:39,587 INFO L225 Difference]: With dead ends: 767 [2022-03-15 19:39:39,587 INFO L226 Difference]: Without dead ends: 722 [2022-03-15 19:39:39,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4814 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1890, Invalid=11220, Unknown=0, NotChecked=0, Total=13110 [2022-03-15 19:39:39,588 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 221 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:39,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 40 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:39:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-03-15 19:39:39,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 370. [2022-03-15 19:39:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 369 states have (on average 2.6124661246612466) internal successors, (964), 369 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 964 transitions. [2022-03-15 19:39:39,593 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 964 transitions. Word has length 29 [2022-03-15 19:39:39,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:39,593 INFO L470 AbstractCegarLoop]: Abstraction has 370 states and 964 transitions. [2022-03-15 19:39:39,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 42 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:39,593 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 964 transitions. [2022-03-15 19:39:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:39:39,594 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:39,594 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:39,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2022-03-15 19:39:39,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:39,803 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:39,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:39,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1226310194, now seen corresponding path program 70 times [2022-03-15 19:39:39,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:39,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235067665] [2022-03-15 19:39:39,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:39,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:40,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:40,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235067665] [2022-03-15 19:39:40,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235067665] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:40,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193758268] [2022-03-15 19:39:40,052 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:39:40,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:40,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:40,053 INFO L229 MonitoredProcess]: Starting monitored process 72 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:39:40,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-03-15 19:39:40,147 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:39:40,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:40,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:39:40,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:40,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:41,048 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:39:41,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193758268] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:41,049 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:41,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 59 [2022-03-15 19:39:41,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1899955332] [2022-03-15 19:39:41,049 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:41,051 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:41,070 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 186 transitions. [2022-03-15 19:39:41,071 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:42,846 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [101670#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 101671#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 101664#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 101680#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 101681#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 101674#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 101665#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 101677#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 101676#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 101675#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 101673#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 101668#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 101667#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 101678#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 101666#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 101679#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 101669#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 101672#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:39:42,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:39:42,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:42,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:39:42,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=833, Invalid=5329, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 19:39:42,847 INFO L87 Difference]: Start difference. First operand 370 states and 964 transitions. Second operand has 41 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:44,333 INFO L93 Difference]: Finished difference Result 903 states and 2181 transitions. [2022-03-15 19:39:44,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 19:39:44,334 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 0 states have call successors, (0), 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:39:44,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:44,335 INFO L225 Difference]: With dead ends: 903 [2022-03-15 19:39:44,335 INFO L226 Difference]: Without dead ends: 854 [2022-03-15 19:39:44,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4577 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1979, Invalid=11361, Unknown=0, NotChecked=0, Total=13340 [2022-03-15 19:39:44,337 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 147 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:44,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 45 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:39:44,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-03-15 19:39:44,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 414. [2022-03-15 19:39:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 2.6634382566585955) internal successors, (1100), 413 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1100 transitions. [2022-03-15 19:39:44,342 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1100 transitions. Word has length 29 [2022-03-15 19:39:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:44,343 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 1100 transitions. [2022-03-15 19:39:44,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1100 transitions. [2022-03-15 19:39:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:39:44,343 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:44,343 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:44,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2022-03-15 19:39:44,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:44,565 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:44,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1919267062, now seen corresponding path program 71 times [2022-03-15 19:39:44,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:44,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075284968] [2022-03-15 19:39:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:44,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:44,825 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:44,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075284968] [2022-03-15 19:39:44,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075284968] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:44,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180569916] [2022-03-15 19:39:44,825 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:39:44,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:44,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:44,826 INFO L229 MonitoredProcess]: Starting monitored process 73 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:39:44,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-03-15 19:39:44,915 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-03-15 19:39:44,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:44,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:39:44,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:45,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:45,779 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:39:45,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180569916] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:45,779 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:45,779 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 59 [2022-03-15 19:39:45,779 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [926689736] [2022-03-15 19:39:45,780 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:45,782 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:45,798 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 177 transitions. [2022-03-15 19:39:45,798 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:47,957 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [103720#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 103731#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 103718#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 103716#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 103726#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (not (< 2 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 103719#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 103724#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 103722#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 103725#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 103721#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 103717#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 103729#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 103727#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 103728#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 103723#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 103730#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:39:47,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-03-15 19:39:47,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:47,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-03-15 19:39:47,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=5045, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 19:39:47,958 INFO L87 Difference]: Start difference. First operand 414 states and 1100 transitions. Second operand has 39 states, 38 states have (on average 2.973684210526316) internal successors, (113), 38 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:49,461 INFO L93 Difference]: Finished difference Result 1041 states and 2540 transitions. [2022-03-15 19:39:49,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 19:39:49,462 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.973684210526316) internal successors, (113), 38 states have internal predecessors, (113), 0 states have call successors, (0), 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:39:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:49,463 INFO L225 Difference]: With dead ends: 1041 [2022-03-15 19:39:49,463 INFO L226 Difference]: Without dead ends: 988 [2022-03-15 19:39:49,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4507 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2091, Invalid=11481, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 19:39:49,464 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 175 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1830 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:49,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 32 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1830 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:39:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2022-03-15 19:39:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 468. [2022-03-15 19:39:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 2.7130620985010707) internal successors, (1267), 467 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1267 transitions. [2022-03-15 19:39:49,471 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1267 transitions. Word has length 29 [2022-03-15 19:39:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:49,471 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 1267 transitions. [2022-03-15 19:39:49,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.973684210526316) internal successors, (113), 38 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1267 transitions. [2022-03-15 19:39:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:39:49,472 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:49,472 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:49,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-03-15 19:39:49,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-03-15 19:39:49,692 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:49,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:49,692 INFO L85 PathProgramCache]: Analyzing trace with hash 647914190, now seen corresponding path program 72 times [2022-03-15 19:39:49,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:49,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236620798] [2022-03-15 19:39:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:49,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:49,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:49,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236620798] [2022-03-15 19:39:49,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236620798] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:49,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580788181] [2022-03-15 19:39:49,997 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:39:49,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:49,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:49,998 INFO L229 MonitoredProcess]: Starting monitored process 74 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:39:50,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-03-15 19:39:50,108 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-03-15 19:39:50,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:39:50,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:39:50,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:50,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:51,358 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:39:51,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580788181] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:51,358 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:51,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 59 [2022-03-15 19:39:51,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [22106270] [2022-03-15 19:39:51,359 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:51,361 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:51,375 INFO L252 McrAutomatonBuilder]: Finished intersection with 94 states and 168 transitions. [2022-03-15 19:39:51,375 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:52,926 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [106029#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 106024#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 106021#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 106020#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 106030#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 106027#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 106019#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 106026#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 106023#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 106028#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 106025#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 106022#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 106031#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 106018#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:39:52,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 19:39:52,927 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:52,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 19:39:52,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=798, Invalid=4752, Unknown=0, NotChecked=0, Total=5550 [2022-03-15 19:39:52,927 INFO L87 Difference]: Start difference. First operand 468 states and 1267 transitions. Second operand has 37 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 36 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:54,487 INFO L93 Difference]: Finished difference Result 1181 states and 2906 transitions. [2022-03-15 19:39:54,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 19:39:54,488 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 36 states have internal predecessors, (107), 0 states have call successors, (0), 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:39:54,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:54,489 INFO L225 Difference]: With dead ends: 1181 [2022-03-15 19:39:54,489 INFO L226 Difference]: Without dead ends: 1124 [2022-03-15 19:39:54,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4525 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2226, Invalid=11580, Unknown=0, NotChecked=0, Total=13806 [2022-03-15 19:39:54,491 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 187 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:54,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 24 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:39:54,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2022-03-15 19:39:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 506. [2022-03-15 19:39:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 505 states have (on average 2.7445544554455448) internal successors, (1386), 505 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1386 transitions. [2022-03-15 19:39:54,498 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1386 transitions. Word has length 29 [2022-03-15 19:39:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:54,498 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 1386 transitions. [2022-03-15 19:39:54,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 36 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:54,499 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1386 transitions. [2022-03-15 19:39:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-03-15 19:39:54,499 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:54,499 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:54,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2022-03-15 19:39:54,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:54,704 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:54,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:54,704 INFO L85 PathProgramCache]: Analyzing trace with hash -109319178, now seen corresponding path program 73 times [2022-03-15 19:39:54,705 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:54,705 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579379289] [2022-03-15 19:39:54,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:54,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:54,945 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:39:54,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:54,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579379289] [2022-03-15 19:39:54,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579379289] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:54,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284211508] [2022-03-15 19:39:54,945 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:39:54,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:54,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:54,947 INFO L229 MonitoredProcess]: Starting monitored process 75 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:39:54,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-03-15 19:39:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:55,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:39:55,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:39:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:55,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:39:56,356 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:39:56,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284211508] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:39:56,356 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:39:56,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 59 [2022-03-15 19:39:56,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [665290459] [2022-03-15 19:39:56,357 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:39:56,359 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:39:56,372 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 159 transitions. [2022-03-15 19:39:56,373 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:39:57,928 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [108550#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 108545#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 108546#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 108541#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 108544#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 108542#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 108549#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 108543#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 108548#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 108547#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 108551#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 108540#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:39:57,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 19:39:57,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:39:57,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 19:39:57,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=801, Invalid=4455, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 19:39:57,930 INFO L87 Difference]: Start difference. First operand 506 states and 1386 transitions. Second operand has 35 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 34 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:39:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:39:59,618 INFO L93 Difference]: Finished difference Result 1551 states and 3799 transitions. [2022-03-15 19:39:59,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 19:39:59,618 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 34 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 29 [2022-03-15 19:39:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:39:59,620 INFO L225 Difference]: With dead ends: 1551 [2022-03-15 19:39:59,620 INFO L226 Difference]: Without dead ends: 1494 [2022-03-15 19:39:59,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4768 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2437, Invalid=12325, Unknown=0, NotChecked=0, Total=14762 [2022-03-15 19:39:59,621 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 193 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:39:59,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 23 Invalid, 1806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:39:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2022-03-15 19:39:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 598. [2022-03-15 19:39:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 2.814070351758794) internal successors, (1680), 597 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:39:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1680 transitions. [2022-03-15 19:39:59,633 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1680 transitions. Word has length 29 [2022-03-15 19:39:59,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:39:59,634 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 1680 transitions. [2022-03-15 19:39:59,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.9705882352941178) internal successors, (101), 34 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:39:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1680 transitions. [2022-03-15 19:39:59,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:39:59,635 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:39:59,635 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:39:59,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-03-15 19:39:59,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:59,852 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:39:59,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:39:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1561614521, now seen corresponding path program 74 times [2022-03-15 19:39:59,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:39:59,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007148328] [2022-03-15 19:39:59,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:39:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:39:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:39:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:39:59,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:39:59,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007148328] [2022-03-15 19:39:59,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007148328] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:39:59,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718931333] [2022-03-15 19:39:59,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:39:59,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:39:59,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:39:59,952 INFO L229 MonitoredProcess]: Starting monitored process 76 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:39:59,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-03-15 19:40:00,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:40:00,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:00,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 19:40:00,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:00,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:00,273 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:40:00,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718931333] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:00,273 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:00,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 20 [2022-03-15 19:40:00,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1430822547] [2022-03-15 19:40:00,274 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:00,276 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:00,298 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 256 transitions. [2022-03-15 19:40:00,298 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:01,244 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:40:01,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 19:40:01,245 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 19:40:01,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:40:01,245 INFO L87 Difference]: Start difference. First operand 598 states and 1680 transitions. Second operand has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:01,576 INFO L93 Difference]: Finished difference Result 1114 states and 3149 transitions. [2022-03-15 19:40:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-15 19:40:01,576 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 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:40:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:01,578 INFO L225 Difference]: With dead ends: 1114 [2022-03-15 19:40:01,578 INFO L226 Difference]: Without dead ends: 1032 [2022-03-15 19:40:01,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 148 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2022-03-15 19:40:01,579 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:01,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 100 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:40:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-03-15 19:40:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 834. [2022-03-15 19:40:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 833 states have (on average 2.857142857142857) internal successors, (2380), 833 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 2380 transitions. [2022-03-15 19:40:01,589 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 2380 transitions. Word has length 30 [2022-03-15 19:40:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:01,589 INFO L470 AbstractCegarLoop]: Abstraction has 834 states and 2380 transitions. [2022-03-15 19:40:01,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 2380 transitions. [2022-03-15 19:40:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-03-15 19:40:01,590 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:01,590 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:01,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2022-03-15 19:40:01,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2022-03-15 19:40:01,791 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:01,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:01,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1447919666, now seen corresponding path program 75 times [2022-03-15 19:40:01,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:01,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687445611] [2022-03-15 19:40:01,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:01,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:02,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:02,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687445611] [2022-03-15 19:40:02,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687445611] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:02,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468626673] [2022-03-15 19:40:02,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:40:02,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:02,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:02,150 INFO L229 MonitoredProcess]: Starting monitored process 77 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:40:02,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-03-15 19:40:02,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:40:02,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:02,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 58 conjunts are in the unsatisfiable core [2022-03-15 19:40:02,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:02,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:03,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468626673] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:03,575 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:03,575 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 62 [2022-03-15 19:40:03,575 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1371779235] [2022-03-15 19:40:03,575 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:03,577 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:03,599 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 256 transitions. [2022-03-15 19:40:03,599 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:08,062 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [114651#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 6 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 114642#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 8 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 114668#(and (or (not (< 8 ~M1~0)) (<= ~M1~0 (+ ~counter~0 9)) (< 9 ~M1~0)) (or (not (< 8 ~M1~0)) (<= (+ ~counter~0 9) ~M1~0) (< 9 ~M1~0)) (or (not (< 8 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< 9 ~M1~0))), 114652#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 114632#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 114669#(and (= thread2Thread1of1ForFork1_~i~1 0) (= ~counter~0 0)), 114650#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 114639#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 114670#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0))), 114662#(and (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 114665#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 114663#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 2 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 114649#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 114631#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 114648#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 7 ~counter~0)), 114653#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 114640#(and (<= 9 ~counter~0) (<= ~M1~0 ~counter~0) (<= ~counter~0 ~M1~0)), 114655#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 114645#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0))), 114636#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 114658#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 3 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 114667#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0))), 114664#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 114633#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 114666#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 114638#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 114654#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 5 ~counter~0)), 114634#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 114647#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 8 ~counter~0)), 114656#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 114671#(and (or (not (< 8 ~M1~0)) (<= ~M1~0 (+ ~counter~0 9)) (< 9 ~M1~0)) (or (not (< 8 ~M1~0)) (<= (+ ~counter~0 9) ~M1~0) (< 9 ~M1~0))), 114641#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 114657#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 4 ~counter~0)), 114659#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 3 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 114660#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 3 ~counter~0)), 114637#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 114661#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 114643#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 114630#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 114635#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 114646#(and (<= 9 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= ~counter~0 ~M1~0)), 114644#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:40:08,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 19:40:08,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:08,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 19:40:08,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1394, Invalid=9736, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 19:40:08,063 INFO L87 Difference]: Start difference. First operand 834 states and 2380 transitions. Second operand has 66 states, 65 states have (on average 2.876923076923077) internal successors, (187), 65 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:15,626 INFO L93 Difference]: Finished difference Result 1302 states and 3477 transitions. [2022-03-15 19:40:15,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 19:40:15,627 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 2.876923076923077) internal successors, (187), 65 states have internal predecessors, (187), 0 states have call successors, (0), 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:40:15,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:15,629 INFO L225 Difference]: With dead ends: 1302 [2022-03-15 19:40:15,629 INFO L226 Difference]: Without dead ends: 1292 [2022-03-15 19:40:15,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9328 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=3270, Invalid=20910, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 19:40:15,630 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 432 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 4040 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 4223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 4040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:15,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 123 Invalid, 4223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 4040 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 19:40:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2022-03-15 19:40:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 796. [2022-03-15 19:40:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 2.8666666666666667) internal successors, (2279), 795 states have internal predecessors, (2279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2279 transitions. [2022-03-15 19:40:15,640 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 2279 transitions. Word has length 30 [2022-03-15 19:40:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:15,641 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 2279 transitions. [2022-03-15 19:40:15,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 2.876923076923077) internal successors, (187), 65 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 2279 transitions. [2022-03-15 19:40:15,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:40:15,642 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:15,642 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:15,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-03-15 19:40:15,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-03-15 19:40:15,859 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2090067037, now seen corresponding path program 76 times [2022-03-15 19:40:15,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:15,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376040969] [2022-03-15 19:40:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:16,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:16,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376040969] [2022-03-15 19:40:16,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376040969] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:16,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121457110] [2022-03-15 19:40:16,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:40:16,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:16,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:16,151 INFO L229 MonitoredProcess]: Starting monitored process 78 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:40:16,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-03-15 19:40:16,284 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:40:16,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:16,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:40:16,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:16,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:17,207 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:40:17,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121457110] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:17,207 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:17,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 66 [2022-03-15 19:40:17,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [443000521] [2022-03-15 19:40:17,208 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:17,210 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:17,234 INFO L252 McrAutomatonBuilder]: Finished intersection with 140 states and 268 transitions. [2022-03-15 19:40:17,234 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:20,605 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [117917#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 117921#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 117945#(and (or (not (< 8 ~M1~0)) (<= ~M1~0 (+ ~counter~0 9)) (< 9 ~M1~0)) (or (not (< 8 ~M1~0)) (<= (+ ~counter~0 9) ~M1~0) (< 9 ~M1~0))), 117929#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 117925#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= 8 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 117943#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0))), 117914#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 117923#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 117918#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 117931#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 117922#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 117938#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0))), 117944#(and (or (not (< 8 ~M1~0)) (<= ~M1~0 (+ ~counter~0 9)) (< 9 ~M1~0)) (or (not (< 8 ~M1~0)) (<= (+ ~counter~0 9) ~M1~0) (< 9 ~M1~0)) (or (not (< 8 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< 9 ~M1~0))), 117934#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 117924#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 117916#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 117936#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 117920#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 117935#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 3 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 117940#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 3 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 117915#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 117932#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 117941#(and (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 117933#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 117930#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0))), 117937#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 117939#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 117919#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 117927#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 117942#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 117928#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 117926#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:40:20,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 19:40:20,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:20,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 19:40:20,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1198, Invalid=8702, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 19:40:20,607 INFO L87 Difference]: Start difference. First operand 796 states and 2279 transitions. Second operand has 57 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:32,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:32,946 INFO L93 Difference]: Finished difference Result 1248 states and 3335 transitions. [2022-03-15 19:40:32,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-03-15 19:40:32,946 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:40:32,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:32,948 INFO L225 Difference]: With dead ends: 1248 [2022-03-15 19:40:32,948 INFO L226 Difference]: Without dead ends: 1234 [2022-03-15 19:40:32,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14662 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=6131, Invalid=38601, Unknown=0, NotChecked=0, Total=44732 [2022-03-15 19:40:32,950 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 395 mSDsluCounter, 1771 mSDsCounter, 0 mSdLazyCounter, 3545 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 3780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 3545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:32,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 165 Invalid, 3780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 3545 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 19:40:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-03-15 19:40:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 866. [2022-03-15 19:40:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 865 states have (on average 2.8728323699421967) internal successors, (2485), 865 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:32,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 2485 transitions. [2022-03-15 19:40:32,960 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 2485 transitions. Word has length 31 [2022-03-15 19:40:32,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:32,961 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 2485 transitions. [2022-03-15 19:40:32,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:32,961 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 2485 transitions. [2022-03-15 19:40:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:40:32,962 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:32,962 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:32,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-03-15 19:40:33,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:33,175 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:33,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:33,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1174581327, now seen corresponding path program 77 times [2022-03-15 19:40:33,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:33,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294622295] [2022-03-15 19:40:33,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:33,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:33,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:33,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294622295] [2022-03-15 19:40:33,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294622295] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:33,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901145863] [2022-03-15 19:40:33,466 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:40:33,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:33,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:33,467 INFO L229 MonitoredProcess]: Starting monitored process 79 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:40:33,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-03-15 19:40:33,562 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:40:33,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:33,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:40:33,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:34,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:34,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901145863] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:34,826 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:34,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 66 [2022-03-15 19:40:34,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1471398525] [2022-03-15 19:40:34,827 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:34,831 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:34,853 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 237 transitions. [2022-03-15 19:40:34,853 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:37,372 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [121422#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0))), 121403#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 121406#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 121405#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 121420#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 121414#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 121424#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 121418#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 121410#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 121400#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 121412#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 121399#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 121409#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 121419#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 121417#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 121402#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 121401#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 121398#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 121413#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 121423#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 121407#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 121416#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 121411#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 121408#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 121421#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 121415#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 121404#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:40:37,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 19:40:37,372 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:37,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 19:40:37,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1264, Invalid=7666, Unknown=0, NotChecked=0, Total=8930 [2022-03-15 19:40:37,373 INFO L87 Difference]: Start difference. First operand 866 states and 2485 transitions. Second operand has 52 states, 51 states have (on average 2.980392156862745) internal successors, (152), 51 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:38,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:38,600 INFO L93 Difference]: Finished difference Result 1255 states and 3393 transitions. [2022-03-15 19:40:38,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 19:40:38,600 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.980392156862745) internal successors, (152), 51 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:40:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:38,603 INFO L225 Difference]: With dead ends: 1255 [2022-03-15 19:40:38,603 INFO L226 Difference]: Without dead ends: 1214 [2022-03-15 19:40:38,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6026 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2292, Invalid=13710, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 19:40:38,604 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 171 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:38,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 62 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:40:38,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2022-03-15 19:40:38,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 946. [2022-03-15 19:40:38,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 945 states have (on average 2.870899470899471) internal successors, (2713), 945 states have internal predecessors, (2713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 2713 transitions. [2022-03-15 19:40:38,616 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 2713 transitions. Word has length 31 [2022-03-15 19:40:38,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:38,616 INFO L470 AbstractCegarLoop]: Abstraction has 946 states and 2713 transitions. [2022-03-15 19:40:38,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.980392156862745) internal successors, (152), 51 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:38,616 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 2713 transitions. [2022-03-15 19:40:38,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:40:38,617 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:38,618 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:38,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-03-15 19:40:38,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:38,830 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:38,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:38,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1985282595, now seen corresponding path program 78 times [2022-03-15 19:40:38,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:38,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543568461] [2022-03-15 19:40:38,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:38,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:39,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:39,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543568461] [2022-03-15 19:40:39,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543568461] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:39,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861851641] [2022-03-15 19:40:39,180 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:40:39,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:39,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:39,182 INFO L229 MonitoredProcess]: Starting monitored process 80 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:40:39,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-03-15 19:40:39,279 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:40:39,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:39,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:40:39,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:39,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:40,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861851641] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:40,681 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:40,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 66 [2022-03-15 19:40:40,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [994980292] [2022-03-15 19:40:40,681 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:40,684 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:40,705 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 228 transitions. [2022-03-15 19:40:40,706 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:43,179 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [124901#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 124899#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 124906#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 124895#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 124885#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 124893#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 124900#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 124894#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 124902#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 124890#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 124888#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 124908#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 124905#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 124889#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 124897#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 124909#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0))), 124891#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 124896#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 124907#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 124892#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 124884#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 124904#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 124903#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 124898#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 124886#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 124887#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:40:43,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 19:40:43,180 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:43,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 19:40:43,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1205, Invalid=7537, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 19:40:43,180 INFO L87 Difference]: Start difference. First operand 946 states and 2713 transitions. Second operand has 51 states, 50 states have (on average 2.94) internal successors, (147), 50 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:44,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:44,782 INFO L93 Difference]: Finished difference Result 1579 states and 4328 transitions. [2022-03-15 19:40:44,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 19:40:44,782 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.94) internal successors, (147), 50 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:40:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:44,785 INFO L225 Difference]: With dead ends: 1579 [2022-03-15 19:40:44,785 INFO L226 Difference]: Without dead ends: 1542 [2022-03-15 19:40:44,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6179 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2383, Invalid=14129, Unknown=0, NotChecked=0, Total=16512 [2022-03-15 19:40:44,787 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 190 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:44,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 68 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:40:44,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2022-03-15 19:40:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1018. [2022-03-15 19:40:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 2.903638151425762) internal successors, (2953), 1017 states have internal predecessors, (2953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 2953 transitions. [2022-03-15 19:40:44,802 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 2953 transitions. Word has length 31 [2022-03-15 19:40:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:44,802 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 2953 transitions. [2022-03-15 19:40:44,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.94) internal successors, (147), 50 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 2953 transitions. [2022-03-15 19:40:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:40:44,804 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:44,804 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:44,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-03-15 19:40:45,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-03-15 19:40:45,008 INFO L402 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:45,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:45,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1810119025, now seen corresponding path program 79 times [2022-03-15 19:40:45,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:45,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293398709] [2022-03-15 19:40:45,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:45,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:45,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:45,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293398709] [2022-03-15 19:40:45,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293398709] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:45,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908448629] [2022-03-15 19:40:45,356 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:40:45,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:45,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:45,357 INFO L229 MonitoredProcess]: Starting monitored process 81 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:40:45,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-03-15 19:40:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:45,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:40:45,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:45,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:46,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908448629] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:46,752 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:46,753 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 66 [2022-03-15 19:40:46,753 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [286647187] [2022-03-15 19:40:46,753 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:46,755 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:46,778 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 219 transitions. [2022-03-15 19:40:46,778 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:49,384 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [128860#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 128866#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 128847#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 128851#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 128855#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 128852#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 128862#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 128859#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 128858#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 128848#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 128845#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 128850#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 128865#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 128849#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 128843#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 128864#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 128854#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 128846#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 128844#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 128867#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0))), 128863#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 128857#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 128856#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 128861#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 128853#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:40:49,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 19:40:49,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:49,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 19:40:49,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1161, Invalid=7395, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 19:40:49,385 INFO L87 Difference]: Start difference. First operand 1018 states and 2953 transitions. Second operand has 50 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:51,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:51,779 INFO L93 Difference]: Finished difference Result 1701 states and 4680 transitions. [2022-03-15 19:40:51,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-03-15 19:40:51,779 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:40:51,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:51,782 INFO L225 Difference]: With dead ends: 1701 [2022-03-15 19:40:51,782 INFO L226 Difference]: Without dead ends: 1660 [2022-03-15 19:40:51,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6202 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2566, Invalid=14990, Unknown=0, NotChecked=0, Total=17556 [2022-03-15 19:40:51,784 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 214 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:51,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 76 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2123 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:40:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2022-03-15 19:40:51,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 988. [2022-03-15 19:40:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 2.8855116514690984) internal successors, (2848), 987 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:51,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 2848 transitions. [2022-03-15 19:40:51,799 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 2848 transitions. Word has length 31 [2022-03-15 19:40:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:51,799 INFO L470 AbstractCegarLoop]: Abstraction has 988 states and 2848 transitions. [2022-03-15 19:40:51,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 2848 transitions. [2022-03-15 19:40:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:40:51,800 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:51,800 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:51,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-03-15 19:40:52,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:52,017 INFO L402 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:52,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:52,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1527373923, now seen corresponding path program 80 times [2022-03-15 19:40:52,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:52,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182283191] [2022-03-15 19:40:52,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:52,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:52,344 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:52,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182283191] [2022-03-15 19:40:52,344 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182283191] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:52,344 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098744148] [2022-03-15 19:40:52,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:40:52,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:52,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:52,346 INFO L229 MonitoredProcess]: Starting monitored process 82 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:40:52,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-03-15 19:40:52,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:40:52,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:52,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:40:52,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:40:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:53,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:40:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:53,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098744148] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:40:53,917 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:40:53,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 66 [2022-03-15 19:40:53,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1890575625] [2022-03-15 19:40:53,918 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:40:53,921 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:40:53,945 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 210 transitions. [2022-03-15 19:40:53,945 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:40:56,586 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [132894#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 132884#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 132891#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 132895#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 132879#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 132889#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 132893#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 132890#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 132876#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 132882#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 132874#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 132880#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 132888#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 132883#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 132878#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 132892#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 132887#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 132873#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 132881#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 132885#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 132875#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 132886#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 132896#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0))), 132877#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))))] [2022-03-15 19:40:56,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 19:40:56,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:40:56,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 19:40:56,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1132, Invalid=7240, Unknown=0, NotChecked=0, Total=8372 [2022-03-15 19:40:56,588 INFO L87 Difference]: Start difference. First operand 988 states and 2848 transitions. Second operand has 49 states, 48 states have (on average 2.8541666666666665) internal successors, (137), 48 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:40:59,250 INFO L93 Difference]: Finished difference Result 1729 states and 4703 transitions. [2022-03-15 19:40:59,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 19:40:59,251 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.8541666666666665) internal successors, (137), 48 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:40:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:40:59,254 INFO L225 Difference]: With dead ends: 1729 [2022-03-15 19:40:59,254 INFO L226 Difference]: Without dead ends: 1684 [2022-03-15 19:40:59,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6274 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2777, Invalid=15855, Unknown=0, NotChecked=0, Total=18632 [2022-03-15 19:40:59,255 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 204 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:40:59,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 82 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:40:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-03-15 19:40:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 946. [2022-03-15 19:40:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 945 states have (on average 2.8582010582010584) internal successors, (2701), 945 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 2701 transitions. [2022-03-15 19:40:59,270 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 2701 transitions. Word has length 31 [2022-03-15 19:40:59,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:40:59,271 INFO L470 AbstractCegarLoop]: Abstraction has 946 states and 2701 transitions. [2022-03-15 19:40:59,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.8541666666666665) internal successors, (137), 48 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:40:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 2701 transitions. [2022-03-15 19:40:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:40:59,279 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:40:59,279 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:40:59,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-03-15 19:40:59,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:59,496 INFO L402 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:40:59,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:40:59,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1241158449, now seen corresponding path program 81 times [2022-03-15 19:40:59,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:40:59,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717932262] [2022-03-15 19:40:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:40:59,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:40:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:40:59,842 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:40:59,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:40:59,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717932262] [2022-03-15 19:40:59,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717932262] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:40:59,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79229571] [2022-03-15 19:40:59,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:40:59,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:40:59,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:40:59,844 INFO L229 MonitoredProcess]: Starting monitored process 83 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:40:59,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-03-15 19:40:59,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:40:59,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:40:59,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:40:59,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:00,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:01,430 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:01,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79229571] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:01,430 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:01,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 66 [2022-03-15 19:41:01,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [732214314] [2022-03-15 19:41:01,431 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:01,434 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:01,456 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 201 transitions. [2022-03-15 19:41:01,457 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:03,542 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [136867#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 136870#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 136861#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 136862#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 136864#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 136857#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 136876#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 136860#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 136866#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 136856#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 136871#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 136873#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0))), 136872#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 136877#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 136858#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 136869#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 136863#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 136878#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 136859#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 136865#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 136875#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 136874#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 136868#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:41:03,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-15 19:41:03,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:03,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-15 19:41:03,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1118, Invalid=7072, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 19:41:03,543 INFO L87 Difference]: Start difference. First operand 946 states and 2701 transitions. Second operand has 48 states, 47 states have (on average 2.8085106382978724) internal successors, (132), 47 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:05,515 INFO L93 Difference]: Finished difference Result 1719 states and 4589 transitions. [2022-03-15 19:41:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-15 19:41:05,515 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.8085106382978724) internal successors, (132), 47 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:41:05,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:05,518 INFO L225 Difference]: With dead ends: 1719 [2022-03-15 19:41:05,518 INFO L226 Difference]: Without dead ends: 1670 [2022-03-15 19:41:05,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6503 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3016, Invalid=16724, Unknown=0, NotChecked=0, Total=19740 [2022-03-15 19:41:05,519 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 229 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 2103 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:05,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 70 Invalid, 2175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2103 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:41:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2022-03-15 19:41:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 892. [2022-03-15 19:41:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 2.819304152637486) internal successors, (2512), 891 states have internal predecessors, (2512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:05,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 2512 transitions. [2022-03-15 19:41:05,534 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 2512 transitions. Word has length 31 [2022-03-15 19:41:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:05,534 INFO L470 AbstractCegarLoop]: Abstraction has 892 states and 2512 transitions. [2022-03-15 19:41:05,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.8085106382978724) internal successors, (132), 47 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 2512 transitions. [2022-03-15 19:41:05,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:41:05,536 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:05,536 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:05,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-03-15 19:41:05,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable82 [2022-03-15 19:41:05,771 INFO L402 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:05,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash -400641699, now seen corresponding path program 82 times [2022-03-15 19:41:05,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:05,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674248400] [2022-03-15 19:41:05,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:05,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:06,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:06,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674248400] [2022-03-15 19:41:06,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674248400] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:06,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677265675] [2022-03-15 19:41:06,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:41:06,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:06,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:06,148 INFO L229 MonitoredProcess]: Starting monitored process 84 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:41:06,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-03-15 19:41:06,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:41:06,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:06,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:41:06,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:06,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:07,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677265675] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:07,400 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:07,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 66 [2022-03-15 19:41:07,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1412829578] [2022-03-15 19:41:07,400 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:07,402 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:07,422 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 192 transitions. [2022-03-15 19:41:07,422 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:09,258 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [140743#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 140735#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 140738#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 140730#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 140736#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 140733#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 140741#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 140745#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 140734#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 140732#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 140747#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 140742#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 140739#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 140746#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 140748#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 140731#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 140744#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 140737#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 140751#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0))), 140740#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 140749#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 140750#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:41:09,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 19:41:09,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:09,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 19:41:09,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1119, Invalid=6891, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 19:41:09,259 INFO L87 Difference]: Start difference. First operand 892 states and 2512 transitions. Second operand has 47 states, 46 states have (on average 2.760869565217391) internal successors, (127), 46 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:11,471 INFO L93 Difference]: Finished difference Result 1675 states and 4372 transitions. [2022-03-15 19:41:11,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-15 19:41:11,471 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.760869565217391) internal successors, (127), 46 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:41:11,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:11,473 INFO L225 Difference]: With dead ends: 1675 [2022-03-15 19:41:11,473 INFO L226 Difference]: Without dead ends: 1622 [2022-03-15 19:41:11,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6863 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3283, Invalid=17597, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 19:41:11,475 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 262 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:11,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 86 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:41:11,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2022-03-15 19:41:11,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 738. [2022-03-15 19:41:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 2.7421981004070557) internal successors, (2021), 737 states have internal predecessors, (2021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2021 transitions. [2022-03-15 19:41:11,487 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 2021 transitions. Word has length 31 [2022-03-15 19:41:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:11,487 INFO L470 AbstractCegarLoop]: Abstraction has 738 states and 2021 transitions. [2022-03-15 19:41:11,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.760869565217391) internal successors, (127), 46 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:11,487 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 2021 transitions. [2022-03-15 19:41:11,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:41:11,488 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:11,488 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:11,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-03-15 19:41:11,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:11,705 INFO L402 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:11,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2036096241, now seen corresponding path program 83 times [2022-03-15 19:41:11,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:11,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461846645] [2022-03-15 19:41:11,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:11,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:12,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:12,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461846645] [2022-03-15 19:41:12,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461846645] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:12,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329234813] [2022-03-15 19:41:12,041 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:41:12,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:12,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:12,050 INFO L229 MonitoredProcess]: Starting monitored process 85 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:41:12,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-03-15 19:41:12,159 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:41:12,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:12,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:41:12,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:12,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 22 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:13,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329234813] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:13,311 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:13,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 66 [2022-03-15 19:41:13,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [309131628] [2022-03-15 19:41:13,312 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:13,314 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:13,364 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 183 transitions. [2022-03-15 19:41:13,364 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:15,705 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [144265#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 144278#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 144276#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 144275#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 144264#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 144267#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 144270#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 144271#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 144261#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 144262#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 144274#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 144281#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0))), 144279#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 144280#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 144266#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 144263#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 144269#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 144277#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 144273#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 144268#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 144272#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:41:15,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 19:41:15,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:15,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 19:41:15,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=6697, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 19:41:15,706 INFO L87 Difference]: Start difference. First operand 738 states and 2021 transitions. Second operand has 46 states, 45 states have (on average 2.7111111111111112) internal successors, (122), 45 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:18,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:18,010 INFO L93 Difference]: Finished difference Result 1433 states and 3622 transitions. [2022-03-15 19:41:18,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 19:41:18,010 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.7111111111111112) internal successors, (122), 45 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:41:18,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:18,012 INFO L225 Difference]: With dead ends: 1433 [2022-03-15 19:41:18,012 INFO L226 Difference]: Without dead ends: 1376 [2022-03-15 19:41:18,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7066 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3578, Invalid=18474, Unknown=0, NotChecked=0, Total=22052 [2022-03-15 19:41:18,014 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 219 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:18,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 60 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:41:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2022-03-15 19:41:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 362. [2022-03-15 19:41:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 2.5457063711911356) internal successors, (919), 361 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 919 transitions. [2022-03-15 19:41:18,022 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 919 transitions. Word has length 31 [2022-03-15 19:41:18,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:18,022 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 919 transitions. [2022-03-15 19:41:18,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.7111111111111112) internal successors, (122), 45 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 919 transitions. [2022-03-15 19:41:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:41:18,023 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:18,023 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:18,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-03-15 19:41:18,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:18,239 INFO L402 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:18,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:18,239 INFO L85 PathProgramCache]: Analyzing trace with hash 136514935, now seen corresponding path program 84 times [2022-03-15 19:41:18,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:18,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699044107] [2022-03-15 19:41:18,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:18,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:18,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:18,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699044107] [2022-03-15 19:41:18,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699044107] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:18,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350780201] [2022-03-15 19:41:18,586 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:41:18,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:18,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:18,588 INFO L229 MonitoredProcess]: Starting monitored process 86 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:41:18,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-03-15 19:41:18,697 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:41:18,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:18,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:41:18,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:19,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:19,734 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:19,734 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350780201] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:19,734 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:19,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 65 [2022-03-15 19:41:19,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1601633287] [2022-03-15 19:41:19,735 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:19,737 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:19,759 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 228 transitions. [2022-03-15 19:41:19,759 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:22,234 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [146813#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 146814#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 146818#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 146829#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 6 ~M1~0))) (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 146820#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 146826#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 146812#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 146811#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 146821#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 146825#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 146809#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 146819#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 146822#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 146806#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 146807#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 146824#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 146808#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 146828#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 146810#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 146823#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 146815#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 146827#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 146830#(and (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 146816#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 146817#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:41:22,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 19:41:22,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:22,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 19:41:22,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1153, Invalid=7219, Unknown=0, NotChecked=0, Total=8372 [2022-03-15 19:41:22,235 INFO L87 Difference]: Start difference. First operand 362 states and 919 transitions. Second operand has 50 states, 49 states have (on average 2.979591836734694) internal successors, (146), 49 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:23,593 INFO L93 Difference]: Finished difference Result 713 states and 1677 transitions. [2022-03-15 19:41:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-15 19:41:23,594 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.979591836734694) internal successors, (146), 49 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:41:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:23,595 INFO L225 Difference]: With dead ends: 713 [2022-03-15 19:41:23,595 INFO L226 Difference]: Without dead ends: 668 [2022-03-15 19:41:23,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5964 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2226, Invalid=13524, Unknown=0, NotChecked=0, Total=15750 [2022-03-15 19:41:23,596 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 196 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:23,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 60 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:41:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-03-15 19:41:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 380. [2022-03-15 19:41:23,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 2.5646437994722957) internal successors, (972), 379 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 972 transitions. [2022-03-15 19:41:23,602 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 972 transitions. Word has length 31 [2022-03-15 19:41:23,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:23,602 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 972 transitions. [2022-03-15 19:41:23,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.979591836734694) internal successors, (146), 49 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 972 transitions. [2022-03-15 19:41:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:41:23,603 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:23,603 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:23,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2022-03-15 19:41:23,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:23,822 INFO L402 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:23,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:23,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1978772145, now seen corresponding path program 85 times [2022-03-15 19:41:23,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:23,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912224864] [2022-03-15 19:41:23,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:23,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:24,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:24,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912224864] [2022-03-15 19:41:24,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912224864] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:24,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441860016] [2022-03-15 19:41:24,067 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:41:24,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:24,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:24,068 INFO L229 MonitoredProcess]: Starting monitored process 87 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:41:24,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-03-15 19:41:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:24,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:41:24,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:24,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:25,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441860016] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:25,168 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:25,168 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 65 [2022-03-15 19:41:25,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [555615344] [2022-03-15 19:41:25,168 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:25,171 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:25,194 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 219 transitions. [2022-03-15 19:41:25,194 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:27,650 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [148637#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 148635#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 148641#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 148623#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 148629#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 148621#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 148626#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 148630#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 148631#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 148625#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 148622#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 148638#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 148639#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 148632#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 148620#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 148624#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 148640#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 148628#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 148627#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 148634#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (not (< 5 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 148619#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 148636#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 148633#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:41:27,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-15 19:41:27,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:27,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-15 19:41:27,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1082, Invalid=6928, Unknown=0, NotChecked=0, Total=8010 [2022-03-15 19:41:27,651 INFO L87 Difference]: Start difference. First operand 380 states and 972 transitions. Second operand has 48 states, 47 states have (on average 2.978723404255319) internal successors, (140), 47 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:29,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:29,073 INFO L93 Difference]: Finished difference Result 859 states and 2053 transitions. [2022-03-15 19:41:29,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 19:41:29,073 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.978723404255319) internal successors, (140), 47 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:41:29,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:29,074 INFO L225 Difference]: With dead ends: 859 [2022-03-15 19:41:29,074 INFO L226 Difference]: Without dead ends: 810 [2022-03-15 19:41:29,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5885 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2293, Invalid=13709, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 19:41:29,076 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 243 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:29,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 54 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:41:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-03-15 19:41:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 414. [2022-03-15 19:41:29,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 2.6077481840193704) internal successors, (1077), 413 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1077 transitions. [2022-03-15 19:41:29,081 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1077 transitions. Word has length 31 [2022-03-15 19:41:29,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:29,082 INFO L470 AbstractCegarLoop]: Abstraction has 414 states and 1077 transitions. [2022-03-15 19:41:29,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.978723404255319) internal successors, (140), 47 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:29,082 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1077 transitions. [2022-03-15 19:41:29,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:41:29,082 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:29,082 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:29,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2022-03-15 19:41:29,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:29,285 INFO L402 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1166805111, now seen corresponding path program 86 times [2022-03-15 19:41:29,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:29,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554238207] [2022-03-15 19:41:29,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:29,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:29,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554238207] [2022-03-15 19:41:29,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554238207] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:29,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734997207] [2022-03-15 19:41:29,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:41:29,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:29,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:29,639 INFO L229 MonitoredProcess]: Starting monitored process 88 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:41:29,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-03-15 19:41:29,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:41:29,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:29,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:41:29,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:30,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:31,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734997207] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:31,146 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:31,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 65 [2022-03-15 19:41:31,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [473707752] [2022-03-15 19:41:31,146 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:31,148 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:31,171 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 210 transitions. [2022-03-15 19:41:31,172 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:33,262 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [150661#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 150654#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 150651#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 150664#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 150653#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 150652#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 150657#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 150665#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 150655#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 150656#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 150669#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M1~0))) (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 150658#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 150668#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 150660#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 150667#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 150662#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 150659#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 150666#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 150670#(and (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 150663#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 150650#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:41:33,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 19:41:33,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:33,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 19:41:33,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1028, Invalid=6628, Unknown=0, NotChecked=0, Total=7656 [2022-03-15 19:41:33,264 INFO L87 Difference]: Start difference. First operand 414 states and 1077 transitions. Second operand has 46 states, 45 states have (on average 2.977777777777778) internal successors, (134), 45 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:34,902 INFO L93 Difference]: Finished difference Result 1007 states and 2436 transitions. [2022-03-15 19:41:34,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 19:41:34,903 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.977777777777778) internal successors, (134), 45 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:41:34,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:34,904 INFO L225 Difference]: With dead ends: 1007 [2022-03-15 19:41:34,904 INFO L226 Difference]: Without dead ends: 954 [2022-03-15 19:41:34,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5810 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2383, Invalid=13873, Unknown=0, NotChecked=0, Total=16256 [2022-03-15 19:41:34,906 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 203 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:34,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 45 Invalid, 2087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2015 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:41:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2022-03-15 19:41:34,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 458. [2022-03-15 19:41:34,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 2.6542669584245075) internal successors, (1213), 457 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1213 transitions. [2022-03-15 19:41:34,913 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1213 transitions. Word has length 31 [2022-03-15 19:41:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:34,913 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 1213 transitions. [2022-03-15 19:41:34,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.977777777777778) internal successors, (134), 45 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1213 transitions. [2022-03-15 19:41:34,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:41:34,913 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:34,914 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:34,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-03-15 19:41:35,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:35,119 INFO L402 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:35,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:35,120 INFO L85 PathProgramCache]: Analyzing trace with hash -104547761, now seen corresponding path program 87 times [2022-03-15 19:41:35,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:35,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962034240] [2022-03-15 19:41:35,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:35,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 13 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:35,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:35,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962034240] [2022-03-15 19:41:35,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962034240] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:35,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404029406] [2022-03-15 19:41:35,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:41:35,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:35,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:35,474 INFO L229 MonitoredProcess]: Starting monitored process 89 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:41:35,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-03-15 19:41:35,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:41:35,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:35,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:41:35,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:36,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:36,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404029406] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:36,643 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:36,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 65 [2022-03-15 19:41:36,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [155081117] [2022-03-15 19:41:36,644 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:36,669 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:36,707 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 201 transitions. [2022-03-15 19:41:36,707 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:38,812 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [152935#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 152923#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 152927#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 152929#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 152932#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 152933#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 152930#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 152925#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 152938#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 152939#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 152921#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 152934#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 152924#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 152928#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 152926#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 152931#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 152937#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 152936#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 152922#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:41:38,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 19:41:38,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:38,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 19:41:38,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=6319, Unknown=0, NotChecked=0, Total=7310 [2022-03-15 19:41:38,813 INFO L87 Difference]: Start difference. First operand 458 states and 1213 transitions. Second operand has 44 states, 43 states have (on average 2.9767441860465116) internal successors, (128), 43 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:40,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:40,555 INFO L93 Difference]: Finished difference Result 1157 states and 2826 transitions. [2022-03-15 19:41:40,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 19:41:40,555 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.9767441860465116) internal successors, (128), 43 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:41:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:40,557 INFO L225 Difference]: With dead ends: 1157 [2022-03-15 19:41:40,557 INFO L226 Difference]: Without dead ends: 1100 [2022-03-15 19:41:40,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5612 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2496, Invalid=14016, Unknown=0, NotChecked=0, Total=16512 [2022-03-15 19:41:40,559 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 193 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 2111 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:40,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 44 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2111 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:41:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2022-03-15 19:41:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 512. [2022-03-15 19:41:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 2.700587084148728) internal successors, (1380), 511 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1380 transitions. [2022-03-15 19:41:40,566 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1380 transitions. Word has length 31 [2022-03-15 19:41:40,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:40,566 INFO L470 AbstractCegarLoop]: Abstraction has 512 states and 1380 transitions. [2022-03-15 19:41:40,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.9767441860465116) internal successors, (128), 43 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1380 transitions. [2022-03-15 19:41:40,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:41:40,567 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:40,567 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:40,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-03-15 19:41:40,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2022-03-15 19:41:40,781 INFO L402 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:40,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:40,781 INFO L85 PathProgramCache]: Analyzing trace with hash -861781129, now seen corresponding path program 88 times [2022-03-15 19:41:40,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:40,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651835183] [2022-03-15 19:41:40,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:40,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:41,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:41,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651835183] [2022-03-15 19:41:41,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651835183] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:41,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692121275] [2022-03-15 19:41:41,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:41:41,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:41,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:41,106 INFO L229 MonitoredProcess]: Starting monitored process 90 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:41:41,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-03-15 19:41:41,212 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:41:41,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:41,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:41:41,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:41,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:42,314 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:42,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692121275] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:42,314 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:42,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 65 [2022-03-15 19:41:42,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2071812641] [2022-03-15 19:41:42,314 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:42,317 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:42,337 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 192 transitions. [2022-03-15 19:41:42,337 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:44,408 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [155462#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 155466#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 155454#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 155470#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 155460#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (not (< 2 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 155464#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 155468#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 155457#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 155458#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 155461#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 155465#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 155456#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 155467#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 155469#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 155459#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 155455#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 155463#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))))] [2022-03-15 19:41:44,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 19:41:44,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:44,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 19:41:44,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=971, Invalid=6001, Unknown=0, NotChecked=0, Total=6972 [2022-03-15 19:41:44,409 INFO L87 Difference]: Start difference. First operand 512 states and 1380 transitions. Second operand has 42 states, 41 states have (on average 2.975609756097561) internal successors, (122), 41 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:46,909 INFO L93 Difference]: Finished difference Result 1309 states and 3223 transitions. [2022-03-15 19:41:46,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 19:41:46,910 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.975609756097561) internal successors, (122), 41 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:41:46,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:46,912 INFO L225 Difference]: With dead ends: 1309 [2022-03-15 19:41:46,912 INFO L226 Difference]: Without dead ends: 1248 [2022-03-15 19:41:46,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5740 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2632, Invalid=14138, Unknown=0, NotChecked=0, Total=16770 [2022-03-15 19:41:46,914 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 173 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 2081 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:46,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 38 Invalid, 2135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2081 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:41:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-03-15 19:41:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 576. [2022-03-15 19:41:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 2.7443478260869565) internal successors, (1578), 575 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1578 transitions. [2022-03-15 19:41:46,923 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1578 transitions. Word has length 31 [2022-03-15 19:41:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:46,923 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 1578 transitions. [2022-03-15 19:41:46,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.975609756097561) internal successors, (122), 41 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1578 transitions. [2022-03-15 19:41:46,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:41:46,924 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:46,924 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:46,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2022-03-15 19:41:47,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-03-15 19:41:47,142 INFO L402 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:47,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:47,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1433788239, now seen corresponding path program 89 times [2022-03-15 19:41:47,143 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:47,143 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248115513] [2022-03-15 19:41:47,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:47,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:47,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:47,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248115513] [2022-03-15 19:41:47,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248115513] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:47,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574514312] [2022-03-15 19:41:47,398 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:41:47,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:47,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:47,399 INFO L229 MonitoredProcess]: Starting monitored process 91 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:41:47,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-03-15 19:41:47,540 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:41:47,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:47,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:41:47,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:47,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:48,755 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:48,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574514312] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:48,756 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:48,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 65 [2022-03-15 19:41:48,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1939647982] [2022-03-15 19:41:48,756 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:48,758 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:48,777 INFO L252 McrAutomatonBuilder]: Finished intersection with 102 states and 183 transitions. [2022-03-15 19:41:48,777 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:51,478 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [158281#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 158282#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 158275#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 158278#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 158272#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 158277#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 158274#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 158283#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 158284#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 158285#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 158279#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 158273#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 158276#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 158271#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 158280#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:41:51,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 19:41:51,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:51,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 19:41:51,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=968, Invalid=5674, Unknown=0, NotChecked=0, Total=6642 [2022-03-15 19:41:51,480 INFO L87 Difference]: Start difference. First operand 576 states and 1578 transitions. Second operand has 40 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 39 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:41:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:41:54,192 INFO L93 Difference]: Finished difference Result 1463 states and 3627 transitions. [2022-03-15 19:41:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 19:41:54,192 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 39 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) Word has length 31 [2022-03-15 19:41:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:41:54,194 INFO L225 Difference]: With dead ends: 1463 [2022-03-15 19:41:54,194 INFO L226 Difference]: Without dead ends: 1398 [2022-03-15 19:41:54,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5766 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2791, Invalid=14239, Unknown=0, NotChecked=0, Total=17030 [2022-03-15 19:41:54,195 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 214 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 2080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:41:54,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 26 Invalid, 2080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:41:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2022-03-15 19:41:54,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 620. [2022-03-15 19:41:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 2.7722132471728593) internal successors, (1716), 619 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:41:54,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1716 transitions. [2022-03-15 19:41:54,205 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1716 transitions. Word has length 31 [2022-03-15 19:41:54,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:41:54,205 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 1716 transitions. [2022-03-15 19:41:54,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.9743589743589745) internal successors, (116), 39 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:41:54,205 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1716 transitions. [2022-03-15 19:41:54,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-15 19:41:54,206 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:41:54,206 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:41:54,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2022-03-15 19:41:54,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:54,412 INFO L402 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:41:54,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:41:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash -418005385, now seen corresponding path program 90 times [2022-03-15 19:41:54,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:41:54,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309640507] [2022-03-15 19:41:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:41:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:41:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:41:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:54,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:41:54,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309640507] [2022-03-15 19:41:54,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309640507] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:41:54,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540726699] [2022-03-15 19:41:54,688 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:41:54,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:41:54,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:41:54,689 INFO L229 MonitoredProcess]: Starting monitored process 92 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:41:54,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-03-15 19:41:54,800 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:41:54,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:41:54,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 59 conjunts are in the unsatisfiable core [2022-03-15 19:41:54,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:41:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:55,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:41:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:41:55,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540726699] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:41:55,846 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:41:55,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 65 [2022-03-15 19:41:55,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [42994612] [2022-03-15 19:41:55,846 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:41:55,848 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:41:55,893 INFO L252 McrAutomatonBuilder]: Finished intersection with 98 states and 174 transitions. [2022-03-15 19:41:55,893 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:41:57,808 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [161334#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 161344#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 161345#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 161337#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 161335#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 161338#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 161343#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 161340#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 161341#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 161336#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 161342#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 161339#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 161346#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0))))] [2022-03-15 19:41:57,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-03-15 19:41:57,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:41:57,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-03-15 19:41:57,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=977, Invalid=5343, Unknown=0, NotChecked=0, Total=6320 [2022-03-15 19:41:57,809 INFO L87 Difference]: Start difference. First operand 620 states and 1716 transitions. Second operand has 38 states, 37 states have (on average 2.972972972972973) internal successors, (110), 37 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:00,074 INFO L93 Difference]: Finished difference Result 1959 states and 4836 transitions. [2022-03-15 19:42:00,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 19:42:00,074 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.972972972972973) internal successors, (110), 37 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-03-15 19:42:00,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:00,077 INFO L225 Difference]: With dead ends: 1959 [2022-03-15 19:42:00,077 INFO L226 Difference]: Without dead ends: 1894 [2022-03-15 19:42:00,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5878 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3031, Invalid=15059, Unknown=0, NotChecked=0, Total=18090 [2022-03-15 19:42:00,078 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 193 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:00,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 23 Invalid, 2444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2373 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:42:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2022-03-15 19:42:00,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 750. [2022-03-15 19:42:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 2.8451268357810413) internal successors, (2131), 749 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 2131 transitions. [2022-03-15 19:42:00,091 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 2131 transitions. Word has length 31 [2022-03-15 19:42:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:00,092 INFO L470 AbstractCegarLoop]: Abstraction has 750 states and 2131 transitions. [2022-03-15 19:42:00,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.972972972972973) internal successors, (110), 37 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 2131 transitions. [2022-03-15 19:42:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:42:00,093 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:00,093 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:00,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0 [2022-03-15 19:42:00,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:00,308 INFO L402 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:42:00,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash 366831652, now seen corresponding path program 91 times [2022-03-15 19:42:00,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:00,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780669880] [2022-03-15 19:42:00,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:00,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:00,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:00,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780669880] [2022-03-15 19:42:00,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780669880] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:00,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962194696] [2022-03-15 19:42:00,400 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:42:00,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:00,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:00,401 INFO L229 MonitoredProcess]: Starting monitored process 93 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:42:00,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-03-15 19:42:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:00,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 19:42:00,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:00,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:00,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962194696] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:00,869 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:00,869 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 22 [2022-03-15 19:42:00,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074479438] [2022-03-15 19:42:00,869 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:00,872 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:00,899 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 280 transitions. [2022-03-15 19:42:00,899 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:02,349 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:42:02,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:42:02,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:02,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:42:02,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:42:02,350 INFO L87 Difference]: Start difference. First operand 750 states and 2131 transitions. Second operand has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:03,034 INFO L93 Difference]: Finished difference Result 1370 states and 3932 transitions. [2022-03-15 19:42:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-15 19:42:03,034 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 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 32 [2022-03-15 19:42:03,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:03,036 INFO L225 Difference]: With dead ends: 1370 [2022-03-15 19:42:03,036 INFO L226 Difference]: Without dead ends: 1280 [2022-03-15 19:42:03,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 163 SyntacticMatches, 12 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=818, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 19:42:03,036 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:03,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 130 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:42:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-03-15 19:42:03,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1050. [2022-03-15 19:42:03,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1049 states have (on average 2.890371782650143) internal successors, (3032), 1049 states have internal predecessors, (3032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 3032 transitions. [2022-03-15 19:42:03,048 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 3032 transitions. Word has length 32 [2022-03-15 19:42:03,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:03,048 INFO L470 AbstractCegarLoop]: Abstraction has 1050 states and 3032 transitions. [2022-03-15 19:42:03,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 3032 transitions. [2022-03-15 19:42:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-15 19:42:03,050 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:03,050 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:03,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-03-15 19:42:03,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:03,267 INFO L402 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:42:03,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:03,267 INFO L85 PathProgramCache]: Analyzing trace with hash -318919819, now seen corresponding path program 92 times [2022-03-15 19:42:03,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:03,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789904476] [2022-03-15 19:42:03,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:03,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:03,529 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:03,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789904476] [2022-03-15 19:42:03,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789904476] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:03,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611530321] [2022-03-15 19:42:03,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:42:03,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:03,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:03,531 INFO L229 MonitoredProcess]: Starting monitored process 94 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:42:03,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-03-15 19:42:03,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:42:03,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:42:03,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 19:42:03,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:04,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:04,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611530321] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:04,757 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:04,757 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 68 [2022-03-15 19:42:04,757 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [947163096] [2022-03-15 19:42:04,757 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:04,759 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:04,789 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 280 transitions. [2022-03-15 19:42:04,789 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:08,484 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 46 new interpolants: [168908#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 2 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 168915#(and (or (not (< 9 ~M1~0)) (< 10 ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0) (< 10 ~M1~0))), 168893#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 9 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 168877#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 168891#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 168888#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 168914#(and (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 10)) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))), 168902#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 168885#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 168903#(and (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 168883#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 168906#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 4 ~counter~0)), 168909#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 1 ~counter~0))), 168875#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 168887#(and (or (<= 10 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 168905#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 168897#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 168894#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 8 ~counter~0)), 168879#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 168892#(and (<= 10 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= ~counter~0 ~M1~0)), 168878#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 168898#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 168890#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 168886#(and (<= 10 ~counter~0) (<= ~M1~0 ~counter~0) (<= ~counter~0 ~M1~0)), 168896#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 6 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 168872#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 168882#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 168912#(and (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 10)) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))), 168911#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 168904#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 168907#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 3 ~counter~0)), 168873#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 168880#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 168899#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 5 ~counter~0)), 168900#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 4 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 168895#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 7 ~counter~0)), 168910#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 1 ~counter~0))), 168874#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 168876#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 168913#(and (or (not (< 9 ~M1~0)) (< 10 ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0) (< 10 ~M1~0)) (or (not (< 9 ~M1~0)) (< 10 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0))), 168871#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 168889#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))), 168884#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0)) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 168881#(and (or (<= 10 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 168901#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 4 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 168916#(and (= thread2Thread1of1ForFork1_~i~1 0) (= ~counter~0 0))] [2022-03-15 19:42:08,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-03-15 19:42:08,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:08,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-03-15 19:42:08,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1677, Invalid=11663, Unknown=0, NotChecked=0, Total=13340 [2022-03-15 19:42:08,485 INFO L87 Difference]: Start difference. First operand 1050 states and 3032 transitions. Second operand has 72 states, 71 states have (on average 2.8732394366197185) internal successors, (204), 71 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:15,371 INFO L93 Difference]: Finished difference Result 1590 states and 4314 transitions. [2022-03-15 19:42:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-03-15 19:42:15,371 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 2.8732394366197185) internal successors, (204), 71 states have internal predecessors, (204), 0 states have call successors, (0), 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 32 [2022-03-15 19:42:15,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:15,374 INFO L225 Difference]: With dead ends: 1590 [2022-03-15 19:42:15,374 INFO L226 Difference]: Without dead ends: 1580 [2022-03-15 19:42:15,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11077 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=3929, Invalid=25141, Unknown=0, NotChecked=0, Total=29070 [2022-03-15 19:42:15,375 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 496 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 4413 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 4640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 4413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:15,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 119 Invalid, 4640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 4413 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:42:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2022-03-15 19:42:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1008. [2022-03-15 19:42:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1007 states have (on average 2.900695134061569) internal successors, (2921), 1007 states have internal predecessors, (2921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 2921 transitions. [2022-03-15 19:42:15,388 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 2921 transitions. Word has length 32 [2022-03-15 19:42:15,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:15,389 INFO L470 AbstractCegarLoop]: Abstraction has 1008 states and 2921 transitions. [2022-03-15 19:42:15,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 2.8732394366197185) internal successors, (204), 71 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 2921 transitions. [2022-03-15 19:42:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:42:15,390 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:15,390 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:15,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-03-15 19:42:15,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:15,608 INFO L402 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:42:15,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:15,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1403558600, now seen corresponding path program 93 times [2022-03-15 19:42:15,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:15,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947584480] [2022-03-15 19:42:15,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:15,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:15,865 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 36 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:15,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:15,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947584480] [2022-03-15 19:42:15,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947584480] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:15,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600077479] [2022-03-15 19:42:15,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:42:15,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:15,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:15,867 INFO L229 MonitoredProcess]: Starting monitored process 95 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:42:15,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-03-15 19:42:15,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:42:15,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:42:15,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:42:15,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:16,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 45 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:17,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600077479] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:17,625 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:17,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-03-15 19:42:17,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [918041781] [2022-03-15 19:42:17,625 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:17,628 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:17,658 INFO L252 McrAutomatonBuilder]: Finished intersection with 152 states and 292 transitions. [2022-03-15 19:42:17,658 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:23,610 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [172916#(and (or (<= 10 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 172912#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 172925#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 172911#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 172899#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 172924#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 172932#(and (or (not (< 9 ~M1~0)) (< 10 ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0) (< 10 ~M1~0)) (or (not (< 9 ~M1~0)) (< 10 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0))), 172906#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 172913#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0)) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 172920#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 172921#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 172904#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 172922#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 4 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 172900#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 172909#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 172930#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 1 ~counter~0))), 172933#(and (or (not (< 9 ~M1~0)) (< 10 ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0) (< 10 ~M1~0))), 172901#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 172903#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 172917#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 172928#(and (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 172914#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 172907#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 172918#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))), 172902#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 172927#(and (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 10)) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))), 172910#(and (or (<= 10 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 172931#(and (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 10)) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))), 172908#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 172915#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 172919#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 172926#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 1 ~counter~0))), 172923#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 4 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 172929#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 172905#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:42:23,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 19:42:23,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:23,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 19:42:23,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1426, Invalid=10346, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 19:42:23,612 INFO L87 Difference]: Start difference. First operand 1008 states and 2921 transitions. Second operand has 62 states, 61 states have (on average 3.0491803278688523) internal successors, (186), 61 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:39,340 INFO L93 Difference]: Finished difference Result 1516 states and 4120 transitions. [2022-03-15 19:42:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-03-15 19:42:39,341 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 3.0491803278688523) internal successors, (186), 61 states have internal predecessors, (186), 0 states have call successors, (0), 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 33 [2022-03-15 19:42:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:39,343 INFO L225 Difference]: With dead ends: 1516 [2022-03-15 19:42:39,343 INFO L226 Difference]: Without dead ends: 1502 [2022-03-15 19:42:39,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18351 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=7665, Invalid=48267, Unknown=0, NotChecked=0, Total=55932 [2022-03-15 19:42:39,346 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 379 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 3599 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 3827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 3599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:39,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 143 Invalid, 3827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 3599 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 19:42:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-03-15 19:42:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1086. [2022-03-15 19:42:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 2.904147465437788) internal successors, (3151), 1085 states have internal predecessors, (3151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 3151 transitions. [2022-03-15 19:42:39,362 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 3151 transitions. Word has length 33 [2022-03-15 19:42:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:39,362 INFO L470 AbstractCegarLoop]: Abstraction has 1086 states and 3151 transitions. [2022-03-15 19:42:39,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 3.0491803278688523) internal successors, (186), 61 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 3151 transitions. [2022-03-15 19:42:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:42:39,364 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:39,364 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:39,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2022-03-15 19:42:39,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:39,583 INFO L402 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:42:39,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:39,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1206694634, now seen corresponding path program 94 times [2022-03-15 19:42:39,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:39,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779958667] [2022-03-15 19:42:39,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:39,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 28 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:39,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:39,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779958667] [2022-03-15 19:42:39,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779958667] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:39,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141515422] [2022-03-15 19:42:39,976 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:42:39,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:39,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:39,978 INFO L229 MonitoredProcess]: Starting monitored process 96 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:42:39,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-03-15 19:42:40,095 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:42:40,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:42:40,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:42:40,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:40,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 36 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:41,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141515422] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:41,445 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:41,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-03-15 19:42:41,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1471140404] [2022-03-15 19:42:41,446 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:41,448 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:41,492 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 261 transitions. [2022-03-15 19:42:41,492 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:44,860 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [177148#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 177160#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 177170#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 177156#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 177151#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 177155#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 177159#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 177153#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 177154#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 177145#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 177147#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 177171#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 177173#(and (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 177157#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 177150#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 177158#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 177166#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 177161#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 177163#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 177146#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 177168#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 177172#(and (or (not (< 8 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 177164#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 177144#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 177162#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 177167#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 177169#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 177165#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 177152#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 177149#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0)))] [2022-03-15 19:42:44,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 19:42:44,860 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:44,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 19:42:44,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1518, Invalid=9194, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 19:42:44,862 INFO L87 Difference]: Start difference. First operand 1086 states and 3151 transitions. Second operand has 57 states, 56 states have (on average 2.982142857142857) internal successors, (167), 56 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:46,588 INFO L93 Difference]: Finished difference Result 1541 states and 4239 transitions. [2022-03-15 19:42:46,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-15 19:42:46,588 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.982142857142857) internal successors, (167), 56 states have internal predecessors, (167), 0 states have call successors, (0), 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 33 [2022-03-15 19:42:46,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:46,590 INFO L225 Difference]: With dead ends: 1541 [2022-03-15 19:42:46,591 INFO L226 Difference]: Without dead ends: 1496 [2022-03-15 19:42:46,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7404 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2745, Invalid=16437, Unknown=0, NotChecked=0, Total=19182 [2022-03-15 19:42:46,592 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 207 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 1911 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:46,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 102 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1911 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:42:46,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2022-03-15 19:42:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1196. [2022-03-15 19:42:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 2.902092050209205) internal successors, (3468), 1195 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:46,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 3468 transitions. [2022-03-15 19:42:46,608 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 3468 transitions. Word has length 33 [2022-03-15 19:42:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:46,608 INFO L470 AbstractCegarLoop]: Abstraction has 1196 states and 3468 transitions. [2022-03-15 19:42:46,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.982142857142857) internal successors, (167), 56 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 3468 transitions. [2022-03-15 19:42:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:42:46,610 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:46,610 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:46,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-03-15 19:42:46,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable95 [2022-03-15 19:42:46,824 INFO L402 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:42:46,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash -378228408, now seen corresponding path program 95 times [2022-03-15 19:42:46,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:46,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849828707] [2022-03-15 19:42:46,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:46,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 28 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:47,118 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:47,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849828707] [2022-03-15 19:42:47,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849828707] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:47,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259903169] [2022-03-15 19:42:47,118 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:42:47,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:47,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:47,119 INFO L229 MonitoredProcess]: Starting monitored process 97 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:42:47,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-03-15 19:42:47,231 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:42:47,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:42:47,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:42:47,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:47,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 29 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:48,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259903169] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:48,331 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:48,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-03-15 19:42:48,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1319155171] [2022-03-15 19:42:48,331 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:48,334 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:48,396 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 252 transitions. [2022-03-15 19:42:48,396 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:51,226 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [181445#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 181447#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 181450#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 181444#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 181449#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 181470#(and (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 181464#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 181468#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 181456#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 181461#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 181459#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 181471#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 181454#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 181443#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 181451#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 181448#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 181463#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 181469#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 181466#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 181460#(and (or (not (< 8 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 181446#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 181462#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 181457#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 181453#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 181458#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 181455#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 181467#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 181452#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 181465#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))))] [2022-03-15 19:42:51,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 19:42:51,226 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:51,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 19:42:51,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1450, Invalid=9056, Unknown=0, NotChecked=0, Total=10506 [2022-03-15 19:42:51,228 INFO L87 Difference]: Start difference. First operand 1196 states and 3468 transitions. Second operand has 56 states, 55 states have (on average 2.9454545454545453) internal successors, (162), 55 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:52,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:42:52,857 INFO L93 Difference]: Finished difference Result 1955 states and 5455 transitions. [2022-03-15 19:42:52,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 19:42:52,858 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.9454545454545453) internal successors, (162), 55 states have internal predecessors, (162), 0 states have call successors, (0), 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 33 [2022-03-15 19:42:52,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:42:52,861 INFO L225 Difference]: With dead ends: 1955 [2022-03-15 19:42:52,861 INFO L226 Difference]: Without dead ends: 1914 [2022-03-15 19:42:52,862 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7361 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2839, Invalid=16901, Unknown=0, NotChecked=0, Total=19740 [2022-03-15 19:42:52,862 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 252 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:42:52,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 66 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:42:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2022-03-15 19:42:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1294. [2022-03-15 19:42:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1293 states have (on average 2.936581593194122) internal successors, (3797), 1293 states have internal predecessors, (3797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 3797 transitions. [2022-03-15 19:42:52,881 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 3797 transitions. Word has length 33 [2022-03-15 19:42:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:42:52,881 INFO L470 AbstractCegarLoop]: Abstraction has 1294 states and 3797 transitions. [2022-03-15 19:42:52,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.9454545454545453) internal successors, (162), 55 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:42:52,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 3797 transitions. [2022-03-15 19:42:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:42:52,883 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:42:52,883 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:42:52,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2022-03-15 19:42:53,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:53,102 INFO L402 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:42:53,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:42:53,102 INFO L85 PathProgramCache]: Analyzing trace with hash 756874966, now seen corresponding path program 96 times [2022-03-15 19:42:53,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:42:53,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609724270] [2022-03-15 19:42:53,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:42:53,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:42:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:42:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 28 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:53,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:42:53,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609724270] [2022-03-15 19:42:53,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609724270] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:42:53,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568864274] [2022-03-15 19:42:53,385 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:42:53,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:42:53,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:42:53,386 INFO L229 MonitoredProcess]: Starting monitored process 98 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:42:53,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-03-15 19:42:53,471 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:42:53,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:42:53,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:42:53,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:42:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:53,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:42:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 24 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:42:54,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568864274] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:42:54,605 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:42:54,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-03-15 19:42:54,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1711286438] [2022-03-15 19:42:54,605 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:42:54,607 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:42:54,634 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 243 transitions. [2022-03-15 19:42:54,634 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:42:58,668 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [186358#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 186373#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 186367#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 186372#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 186376#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 186374#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 186383#(and (or (not (< 8 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 186366#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 186384#(and (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 186357#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 186378#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 186371#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 186360#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 186375#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 186363#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 186369#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 186377#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 186379#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 186382#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 186368#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 186380#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 186381#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 186361#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 186362#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 186359#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 186370#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 186365#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 186364#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:42:58,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-15 19:42:58,668 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:42:58,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-15 19:42:58,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1397, Invalid=8905, Unknown=0, NotChecked=0, Total=10302 [2022-03-15 19:42:58,669 INFO L87 Difference]: Start difference. First operand 1294 states and 3797 transitions. Second operand has 55 states, 54 states have (on average 2.9074074074074074) internal successors, (157), 54 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:01,215 INFO L93 Difference]: Finished difference Result 2113 states and 5931 transitions. [2022-03-15 19:43:01,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-03-15 19:43:01,216 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.9074074074074074) internal successors, (157), 54 states have internal predecessors, (157), 0 states have call successors, (0), 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 33 [2022-03-15 19:43:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:01,219 INFO L225 Difference]: With dead ends: 2113 [2022-03-15 19:43:01,219 INFO L226 Difference]: Without dead ends: 2068 [2022-03-15 19:43:01,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7392 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3031, Invalid=17849, Unknown=0, NotChecked=0, Total=20880 [2022-03-15 19:43:01,220 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 213 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1751 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:01,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 57 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1751 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:43:01,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-03-15 19:43:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1264. [2022-03-15 19:43:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1263 states have (on average 2.92319873317498) internal successors, (3692), 1263 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 3692 transitions. [2022-03-15 19:43:01,237 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 3692 transitions. Word has length 33 [2022-03-15 19:43:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:01,237 INFO L470 AbstractCegarLoop]: Abstraction has 1264 states and 3692 transitions. [2022-03-15 19:43:01,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.9074074074074074) internal successors, (157), 54 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 3692 transitions. [2022-03-15 19:43:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:43:01,239 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:01,239 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:01,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2022-03-15 19:43:01,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:01,442 INFO L402 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:01,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:01,442 INFO L85 PathProgramCache]: Analyzing trace with hash 932038536, now seen corresponding path program 97 times [2022-03-15 19:43:01,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:01,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767308600] [2022-03-15 19:43:01,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:01,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 28 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:01,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:01,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767308600] [2022-03-15 19:43:01,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767308600] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:01,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75339781] [2022-03-15 19:43:01,791 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:43:01,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:01,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:01,792 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:01,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-03-15 19:43:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:01,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:43:01,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:02,520 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:02,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 21 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:03,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75339781] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:03,551 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:03,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-03-15 19:43:03,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [966092478] [2022-03-15 19:43:03,551 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:03,554 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:03,580 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 234 transitions. [2022-03-15 19:43:03,581 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:07,142 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [191387#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 191380#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 191383#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 191381#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 191379#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 191399#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 191385#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 191395#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 191402#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 191382#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 191404#(and (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 191398#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 191386#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 191394#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 191378#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 191384#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 191391#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 191393#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 191389#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 191390#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 191388#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 191401#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 191400#(and (or (not (< 8 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 191403#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 191397#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 191392#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 191396#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)))] [2022-03-15 19:43:07,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 19:43:07,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:07,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 19:43:07,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1359, Invalid=8741, Unknown=0, NotChecked=0, Total=10100 [2022-03-15 19:43:07,144 INFO L87 Difference]: Start difference. First operand 1264 states and 3692 transitions. Second operand has 54 states, 53 states have (on average 2.8679245283018866) internal successors, (152), 53 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:09,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:09,310 INFO L93 Difference]: Finished difference Result 2157 states and 6008 transitions. [2022-03-15 19:43:09,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 19:43:09,310 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.8679245283018866) internal successors, (152), 53 states have internal predecessors, (152), 0 states have call successors, (0), 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 33 [2022-03-15 19:43:09,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:09,313 INFO L225 Difference]: With dead ends: 2157 [2022-03-15 19:43:09,313 INFO L226 Difference]: Without dead ends: 2108 [2022-03-15 19:43:09,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7652 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3251, Invalid=18801, Unknown=0, NotChecked=0, Total=22052 [2022-03-15 19:43:09,315 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 188 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 2782 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 2860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:09,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 90 Invalid, 2860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2782 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:43:09,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2022-03-15 19:43:09,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1222. [2022-03-15 19:43:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1221 states have (on average 2.9033579033579033) internal successors, (3545), 1221 states have internal predecessors, (3545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3545 transitions. [2022-03-15 19:43:09,333 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3545 transitions. Word has length 33 [2022-03-15 19:43:09,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:09,334 INFO L470 AbstractCegarLoop]: Abstraction has 1222 states and 3545 transitions. [2022-03-15 19:43:09,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.8679245283018866) internal successors, (152), 53 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:09,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3545 transitions. [2022-03-15 19:43:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:43:09,336 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:09,336 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:09,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:09,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2022-03-15 19:43:09,538 INFO L402 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:09,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:09,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1214783638, now seen corresponding path program 98 times [2022-03-15 19:43:09,539 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:09,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143662064] [2022-03-15 19:43:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:09,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 28 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:09,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:09,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143662064] [2022-03-15 19:43:09,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143662064] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:09,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596760682] [2022-03-15 19:43:09,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:43:09,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:09,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:09,846 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:09,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-03-15 19:43:09,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:43:09,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:09,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:43:09,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:10,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:11,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596760682] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:11,560 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:11,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-03-15 19:43:11,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [611575424] [2022-03-15 19:43:11,560 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:11,563 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:11,588 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 225 transitions. [2022-03-15 19:43:11,588 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:14,242 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [196377#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 196368#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 196379#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 196373#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 196382#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 196387#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 196370#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 196374#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 196386#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 196383#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 196378#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 196376#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 196390#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 196380#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 196393#(and (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 196375#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 196372#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 196388#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 196392#(and (or (not (< 8 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 196381#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 196384#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 196369#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 196385#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 196391#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 196371#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 196389#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:43:14,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 19:43:14,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:14,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 19:43:14,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1336, Invalid=8564, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 19:43:14,244 INFO L87 Difference]: Start difference. First operand 1222 states and 3545 transitions. Second operand has 53 states, 52 states have (on average 2.826923076923077) internal successors, (147), 52 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:16,406 INFO L93 Difference]: Finished difference Result 2163 states and 5948 transitions. [2022-03-15 19:43:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 19:43:16,407 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.826923076923077) internal successors, (147), 52 states have internal predecessors, (147), 0 states have call successors, (0), 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 33 [2022-03-15 19:43:16,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:16,410 INFO L225 Difference]: With dead ends: 2163 [2022-03-15 19:43:16,410 INFO L226 Difference]: Without dead ends: 2110 [2022-03-15 19:43:16,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7901 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3499, Invalid=19757, Unknown=0, NotChecked=0, Total=23256 [2022-03-15 19:43:16,413 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 192 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 2117 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:16,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 71 Invalid, 2188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2117 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:43:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2022-03-15 19:43:16,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 1168. [2022-03-15 19:43:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1167 states have (on average 2.8757497857754926) internal successors, (3356), 1167 states have internal predecessors, (3356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 3356 transitions. [2022-03-15 19:43:16,431 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 3356 transitions. Word has length 33 [2022-03-15 19:43:16,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:16,432 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 3356 transitions. [2022-03-15 19:43:16,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.826923076923077) internal successors, (147), 52 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:16,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 3356 transitions. [2022-03-15 19:43:16,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:43:16,433 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:16,433 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:16,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:16,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:16,643 INFO L402 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:16,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:16,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1500999112, now seen corresponding path program 99 times [2022-03-15 19:43:16,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:16,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368532433] [2022-03-15 19:43:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:16,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 28 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:16,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:16,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368532433] [2022-03-15 19:43:16,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368532433] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:16,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713481484] [2022-03-15 19:43:16,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:43:16,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:16,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:16,931 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:16,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-03-15 19:43:17,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:43:17,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:17,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 63 conjunts are in the unsatisfiable core [2022-03-15 19:43:17,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:17,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:18,546 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 26 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:18,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713481484] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:18,546 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:18,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-03-15 19:43:18,546 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1060236718] [2022-03-15 19:43:18,546 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:18,549 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:18,572 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 216 transitions. [2022-03-15 19:43:18,573 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:21,774 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [201271#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 201287#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 201278#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 201270#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 201273#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 201280#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 201269#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 201267#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 201279#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 201276#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 201277#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 201275#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 201282#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 201283#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 201266#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 201272#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 201268#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 201265#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 201286#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 201288#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 201284#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 201281#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 201289#(and (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 201274#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 201285#(and (or (not (< 8 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0))))] [2022-03-15 19:43:21,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 19:43:21,775 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:21,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 19:43:21,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1151, Invalid=8551, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 19:43:21,776 INFO L87 Difference]: Start difference. First operand 1168 states and 3356 transitions. Second operand has 52 states, 51 states have (on average 2.784313725490196) internal successors, (142), 51 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:24,784 INFO L93 Difference]: Finished difference Result 2131 states and 5751 transitions. [2022-03-15 19:43:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-03-15 19:43:24,785 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.784313725490196) internal successors, (142), 51 states have internal predecessors, (142), 0 states have call successors, (0), 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 33 [2022-03-15 19:43:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:24,788 INFO L225 Difference]: With dead ends: 2131 [2022-03-15 19:43:24,788 INFO L226 Difference]: Without dead ends: 2074 [2022-03-15 19:43:24,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7640 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3091, Invalid=21401, Unknown=0, NotChecked=0, Total=24492 [2022-03-15 19:43:24,791 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 319 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:24,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 80 Invalid, 2052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:43:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2022-03-15 19:43:24,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1102. [2022-03-15 19:43:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 1101 states have (on average 2.838328792007266) internal successors, (3125), 1101 states have internal predecessors, (3125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 3125 transitions. [2022-03-15 19:43:24,809 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 3125 transitions. Word has length 33 [2022-03-15 19:43:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:24,809 INFO L470 AbstractCegarLoop]: Abstraction has 1102 states and 3125 transitions. [2022-03-15 19:43:24,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.784313725490196) internal successors, (142), 51 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 3125 transitions. [2022-03-15 19:43:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:43:24,811 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:24,811 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:24,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:25,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:25,028 INFO L402 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:25,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:25,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1953451434, now seen corresponding path program 100 times [2022-03-15 19:43:25,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:25,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934605031] [2022-03-15 19:43:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:25,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 28 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:25,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:25,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934605031] [2022-03-15 19:43:25,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934605031] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:25,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852588612] [2022-03-15 19:43:25,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:43:25,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:25,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:25,368 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:25,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-03-15 19:43:25,496 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:43:25,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:25,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:43:25,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:25,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 24 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:26,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852588612] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:26,604 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:26,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-03-15 19:43:26,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1082815042] [2022-03-15 19:43:26,604 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:26,606 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:26,631 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 207 transitions. [2022-03-15 19:43:26,631 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:28,697 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [206027#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 206030#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 206021#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 206024#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 206012#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 206016#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 206011#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 206007#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 206026#(and (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 206009#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 206025#(and (or (not (< 8 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 206008#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 206029#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 206017#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 206014#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 206023#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 206020#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 206022#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 206018#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 206013#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 206019#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 206015#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 206010#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 206028#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:43:28,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 19:43:28,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:28,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 19:43:28,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1335, Invalid=8171, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 19:43:28,698 INFO L87 Difference]: Start difference. First operand 1102 states and 3125 transitions. Second operand has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:31,169 INFO L93 Difference]: Finished difference Result 2065 states and 5455 transitions. [2022-03-15 19:43:31,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-03-15 19:43:31,169 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 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 33 [2022-03-15 19:43:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:31,172 INFO L225 Difference]: With dead ends: 2065 [2022-03-15 19:43:31,172 INFO L226 Difference]: Without dead ends: 2004 [2022-03-15 19:43:31,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8349 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4079, Invalid=21681, Unknown=0, NotChecked=0, Total=25760 [2022-03-15 19:43:31,173 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 274 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 2184 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:31,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 83 Invalid, 2324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:43:31,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2022-03-15 19:43:31,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 892. [2022-03-15 19:43:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 2.760942760942761) internal successors, (2460), 891 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 2460 transitions. [2022-03-15 19:43:31,187 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 2460 transitions. Word has length 33 [2022-03-15 19:43:31,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:31,187 INFO L470 AbstractCegarLoop]: Abstraction has 892 states and 2460 transitions. [2022-03-15 19:43:31,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:31,187 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 2460 transitions. [2022-03-15 19:43:31,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:43:31,188 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:31,188 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:31,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:31,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2022-03-15 19:43:31,406 INFO L402 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:31,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:31,406 INFO L85 PathProgramCache]: Analyzing trace with hash 706061320, now seen corresponding path program 101 times [2022-03-15 19:43:31,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:31,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052478091] [2022-03-15 19:43:31,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:31,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 28 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:31,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:31,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052478091] [2022-03-15 19:43:31,651 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052478091] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:31,651 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127562496] [2022-03-15 19:43:31,651 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:43:31,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:31,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:31,652 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:31,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-03-15 19:43:31,805 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:43:31,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:31,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:43:31,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:32,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:32,887 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 29 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:32,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127562496] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:32,888 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:32,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-03-15 19:43:32,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1542057976] [2022-03-15 19:43:32,888 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:32,890 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:32,914 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 198 transitions. [2022-03-15 19:43:32,914 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:34,723 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [210289#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 210275#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 210294#(and (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 210280#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 210287#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 210283#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 210293#(and (or (not (< 8 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 210291#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 210276#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 210273#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 210277#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 210290#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 210292#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 210286#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 210274#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 210279#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 210284#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 210272#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 210285#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 210281#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 210288#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 210282#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 210278#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:43:34,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 19:43:34,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:34,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 19:43:34,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1357, Invalid=7955, Unknown=0, NotChecked=0, Total=9312 [2022-03-15 19:43:34,724 INFO L87 Difference]: Start difference. First operand 892 states and 2460 transitions. Second operand has 50 states, 49 states have (on average 2.693877551020408) internal successors, (132), 49 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:37,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:37,561 INFO L93 Difference]: Finished difference Result 1721 states and 4396 transitions. [2022-03-15 19:43:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-03-15 19:43:37,561 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.693877551020408) internal successors, (132), 49 states have internal predecessors, (132), 0 states have call successors, (0), 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 33 [2022-03-15 19:43:37,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:37,563 INFO L225 Difference]: With dead ends: 1721 [2022-03-15 19:43:37,563 INFO L226 Difference]: Without dead ends: 1656 [2022-03-15 19:43:37,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8696 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4411, Invalid=22649, Unknown=0, NotChecked=0, Total=27060 [2022-03-15 19:43:37,566 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 250 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 2093 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:37,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 81 Invalid, 2206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2093 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:43:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-03-15 19:43:37,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 408. [2022-03-15 19:43:37,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.5479115479115477) internal successors, (1037), 407 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:37,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1037 transitions. [2022-03-15 19:43:37,574 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 1037 transitions. Word has length 33 [2022-03-15 19:43:37,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:37,574 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 1037 transitions. [2022-03-15 19:43:37,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.693877551020408) internal successors, (132), 49 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 1037 transitions. [2022-03-15 19:43:37,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:43:37,575 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:37,575 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:37,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:37,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-03-15 19:43:37,791 INFO L402 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:37,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:37,791 INFO L85 PathProgramCache]: Analyzing trace with hash 972985582, now seen corresponding path program 102 times [2022-03-15 19:43:37,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:37,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51314570] [2022-03-15 19:43:37,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 22 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:38,154 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:38,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51314570] [2022-03-15 19:43:38,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51314570] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:38,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436002937] [2022-03-15 19:43:38,154 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:43:38,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:38,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:38,156 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:38,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-03-15 19:43:38,281 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:43:38,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:38,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:43:38,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:38,780 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:38,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 36 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:39,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436002937] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:39,587 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:39,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 24] total 71 [2022-03-15 19:43:39,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1088678048] [2022-03-15 19:43:39,587 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:39,590 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:39,616 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 252 transitions. [2022-03-15 19:43:39,616 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:42,268 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [213256#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 213234#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 213257#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 213249#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 213248#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 213242#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 213233#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 213239#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 213244#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 213238#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 213245#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 213247#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 213253#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 213246#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 213236#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 213255#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 213258#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 213240#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 213241#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 213251#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 213237#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 213259#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0))), 213260#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 213243#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 213235#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 213254#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 213250#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 213252#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:43:42,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-15 19:43:42,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:42,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-15 19:43:42,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1394, Invalid=8706, Unknown=0, NotChecked=0, Total=10100 [2022-03-15 19:43:42,269 INFO L87 Difference]: Start difference. First operand 408 states and 1037 transitions. Second operand has 55 states, 54 states have (on average 2.9814814814814814) internal successors, (161), 54 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:43,833 INFO L93 Difference]: Finished difference Result 795 states and 1875 transitions. [2022-03-15 19:43:43,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-03-15 19:43:43,833 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.9814814814814814) internal successors, (161), 54 states have internal predecessors, (161), 0 states have call successors, (0), 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 33 [2022-03-15 19:43:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:43,834 INFO L225 Difference]: With dead ends: 795 [2022-03-15 19:43:43,834 INFO L226 Difference]: Without dead ends: 746 [2022-03-15 19:43:43,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7145 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2670, Invalid=16236, Unknown=0, NotChecked=0, Total=18906 [2022-03-15 19:43:43,836 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 206 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:43,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 79 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:43:43,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2022-03-15 19:43:43,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 426. [2022-03-15 19:43:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 2.5647058823529414) internal successors, (1090), 425 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1090 transitions. [2022-03-15 19:43:43,841 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1090 transitions. Word has length 33 [2022-03-15 19:43:43,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:43,841 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 1090 transitions. [2022-03-15 19:43:43,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.9814814814814814) internal successors, (161), 54 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:43,841 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1090 transitions. [2022-03-15 19:43:43,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:43:43,842 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:43,842 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:43,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:44,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-03-15 19:43:44,064 INFO L402 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:44,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:44,064 INFO L85 PathProgramCache]: Analyzing trace with hash -176404458, now seen corresponding path program 103 times [2022-03-15 19:43:44,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:44,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175398436] [2022-03-15 19:43:44,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:44,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 18 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:44,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:44,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175398436] [2022-03-15 19:43:44,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175398436] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:44,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481499081] [2022-03-15 19:43:44,293 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:43:44,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:44,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:44,295 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:44,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-03-15 19:43:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:44,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:43:44,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:45,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 36 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:45,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481499081] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:45,930 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:45,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 24] total 71 [2022-03-15 19:43:45,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [603258576] [2022-03-15 19:43:45,930 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:45,932 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:45,958 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 243 transitions. [2022-03-15 19:43:45,958 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:48,531 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [215264#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 215248#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 215270#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 215263#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 215259#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 215261#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 215247#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 215272#(and (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 215252#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 215251#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 215266#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 215262#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 215256#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 215268#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 215255#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 215271#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 6 ~M1~0))) (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 215258#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 215254#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 215265#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 215250#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 215269#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 215260#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 215249#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 215267#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 215253#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 215257#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:43:48,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 19:43:48,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:48,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 19:43:48,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1312, Invalid=8390, Unknown=0, NotChecked=0, Total=9702 [2022-03-15 19:43:48,532 INFO L87 Difference]: Start difference. First operand 426 states and 1090 transitions. Second operand has 53 states, 52 states have (on average 2.980769230769231) internal successors, (155), 52 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:50,335 INFO L93 Difference]: Finished difference Result 953 states and 2282 transitions. [2022-03-15 19:43:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 19:43:50,335 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.980769230769231) internal successors, (155), 52 states have internal predecessors, (155), 0 states have call successors, (0), 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 33 [2022-03-15 19:43:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:50,336 INFO L225 Difference]: With dead ends: 953 [2022-03-15 19:43:50,336 INFO L226 Difference]: Without dead ends: 900 [2022-03-15 19:43:50,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7042 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2738, Invalid=16444, Unknown=0, NotChecked=0, Total=19182 [2022-03-15 19:43:50,338 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 210 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:50,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [210 Valid, 89 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:43:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2022-03-15 19:43:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 460. [2022-03-15 19:43:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 2.603485838779956) internal successors, (1195), 459 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1195 transitions. [2022-03-15 19:43:50,343 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 1195 transitions. Word has length 33 [2022-03-15 19:43:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:50,344 INFO L470 AbstractCegarLoop]: Abstraction has 460 states and 1195 transitions. [2022-03-15 19:43:50,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.980769230769231) internal successors, (155), 52 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 1195 transitions. [2022-03-15 19:43:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:43:50,344 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:50,344 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:50,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:50,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:50,562 INFO L402 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:50,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:50,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1447757330, now seen corresponding path program 104 times [2022-03-15 19:43:50,562 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:50,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643396899] [2022-03-15 19:43:50,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:50,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:50,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:50,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643396899] [2022-03-15 19:43:50,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643396899] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:50,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113573608] [2022-03-15 19:43:50,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:43:50,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:50,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:50,956 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:50,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2022-03-15 19:43:51,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:43:51,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:51,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:43:51,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:51,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 36 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:52,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113573608] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:52,694 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:52,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 24] total 71 [2022-03-15 19:43:52,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [109800124] [2022-03-15 19:43:52,694 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:52,696 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:52,721 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 234 transitions. [2022-03-15 19:43:52,721 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:43:55,206 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [217511#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 217510#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 217506#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 217503#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 217495#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 217500#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 217513#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 217501#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 217491#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 217496#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 217498#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 217504#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 217508#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 217499#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 217512#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 217509#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 217507#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 217505#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (not (< 5 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 217493#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 217494#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 217497#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 217502#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 217492#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 217514#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0))))] [2022-03-15 19:43:55,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 19:43:55,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:43:55,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 19:43:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1247, Invalid=8065, Unknown=0, NotChecked=0, Total=9312 [2022-03-15 19:43:55,207 INFO L87 Difference]: Start difference. First operand 460 states and 1195 transitions. Second operand has 51 states, 50 states have (on average 2.98) internal successors, (149), 50 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:43:56,941 INFO L93 Difference]: Finished difference Result 1113 states and 2696 transitions. [2022-03-15 19:43:56,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 19:43:56,941 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.98) internal successors, (149), 50 states have internal predecessors, (149), 0 states have call successors, (0), 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 33 [2022-03-15 19:43:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:43:56,943 INFO L225 Difference]: With dead ends: 1113 [2022-03-15 19:43:56,943 INFO L226 Difference]: Without dead ends: 1056 [2022-03-15 19:43:56,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6906 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2829, Invalid=16631, Unknown=0, NotChecked=0, Total=19460 [2022-03-15 19:43:56,943 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 211 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 2111 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 2184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:43:56,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 52 Invalid, 2184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2111 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:43:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-03-15 19:43:56,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 504. [2022-03-15 19:43:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 2.646123260437376) internal successors, (1331), 503 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1331 transitions. [2022-03-15 19:43:56,950 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1331 transitions. Word has length 33 [2022-03-15 19:43:56,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:43:56,950 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 1331 transitions. [2022-03-15 19:43:56,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.98) internal successors, (149), 50 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:43:56,950 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1331 transitions. [2022-03-15 19:43:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:43:56,950 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:43:56,951 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:43:56,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Forceful destruction successful, exit code 0 [2022-03-15 19:43:57,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2022-03-15 19:43:57,165 INFO L402 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:43:57,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:43:57,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2089976598, now seen corresponding path program 105 times [2022-03-15 19:43:57,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:43:57,166 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181199768] [2022-03-15 19:43:57,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:43:57,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:43:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:43:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 16 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:57,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:43:57,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181199768] [2022-03-15 19:43:57,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181199768] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:43:57,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938975644] [2022-03-15 19:43:57,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:43:57,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:43:57,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:43:57,400 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:43:57,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2022-03-15 19:43:57,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-15 19:43:57,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:43:57,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:43:57,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:43:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:58,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:43:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 36 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:43:58,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938975644] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:43:58,865 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:43:58,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 24] total 71 [2022-03-15 19:43:58,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [112064781] [2022-03-15 19:43:58,865 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:43:58,868 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:43:58,891 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 225 transitions. [2022-03-15 19:43:58,891 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:01,170 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 22 new interpolants: [219987#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 220007#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 220008#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 219996#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M1~0))) (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 219992#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 219989#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 220004#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 219988#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 219990#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 219991#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 220003#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 220005#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 220000#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 219998#(and (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 220002#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 219993#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 219999#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 220001#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 219997#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 219994#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 220006#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 219995#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))))] [2022-03-15 19:44:01,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-03-15 19:44:01,170 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:01,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-03-15 19:44:01,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1199, Invalid=7731, Unknown=0, NotChecked=0, Total=8930 [2022-03-15 19:44:01,171 INFO L87 Difference]: Start difference. First operand 504 states and 1331 transitions. Second operand has 49 states, 48 states have (on average 2.9791666666666665) internal successors, (143), 48 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:02,952 INFO L93 Difference]: Finished difference Result 1275 states and 3117 transitions. [2022-03-15 19:44:02,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 19:44:02,952 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.9791666666666665) internal successors, (143), 48 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-03-15 19:44:02,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:02,954 INFO L225 Difference]: With dead ends: 1275 [2022-03-15 19:44:02,954 INFO L226 Difference]: Without dead ends: 1214 [2022-03-15 19:44:02,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6900 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2943, Invalid=16797, Unknown=0, NotChecked=0, Total=19740 [2022-03-15 19:44:02,956 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 206 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 2177 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:02,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [206 Valid, 51 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:44:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2022-03-15 19:44:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 558. [2022-03-15 19:44:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 2.689407540394973) internal successors, (1498), 557 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1498 transitions. [2022-03-15 19:44:02,964 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1498 transitions. Word has length 33 [2022-03-15 19:44:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:02,964 INFO L470 AbstractCegarLoop]: Abstraction has 558 states and 1498 transitions. [2022-03-15 19:44:02,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.9791666666666665) internal successors, (143), 48 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1498 transitions. [2022-03-15 19:44:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:44:02,965 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:02,965 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:02,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:03,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2022-03-15 19:44:03,186 INFO L402 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:03,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:03,186 INFO L85 PathProgramCache]: Analyzing trace with hash 90578670, now seen corresponding path program 106 times [2022-03-15 19:44:03,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:03,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807521526] [2022-03-15 19:44:03,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:03,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 18 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:03,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:03,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807521526] [2022-03-15 19:44:03,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807521526] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:03,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600468873] [2022-03-15 19:44:03,425 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:44:03,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:03,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:03,426 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:03,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2022-03-15 19:44:03,550 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:44:03,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:03,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:44:03,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:04,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 36 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:05,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600468873] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:05,177 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:05,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 24] total 71 [2022-03-15 19:44:05,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1696715834] [2022-03-15 19:44:05,177 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:05,179 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:05,203 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 216 transitions. [2022-03-15 19:44:05,203 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:07,398 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [222772#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 222776#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 222769#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 222766#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 222768#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 222758#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 222764#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 222763#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 222767#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 222773#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 222775#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 222771#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 222759#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 222760#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 222774#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 222762#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 222765#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 222757#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 222770#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 222761#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:44:07,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 19:44:07,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:07,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 19:44:07,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1168, Invalid=7388, Unknown=0, NotChecked=0, Total=8556 [2022-03-15 19:44:07,400 INFO L87 Difference]: Start difference. First operand 558 states and 1498 transitions. Second operand has 47 states, 46 states have (on average 2.9782608695652173) internal successors, (137), 46 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:09,199 INFO L93 Difference]: Finished difference Result 1439 states and 3545 transitions. [2022-03-15 19:44:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 19:44:09,200 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.9782608695652173) internal successors, (137), 46 states have internal predecessors, (137), 0 states have call successors, (0), 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 33 [2022-03-15 19:44:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:09,202 INFO L225 Difference]: With dead ends: 1439 [2022-03-15 19:44:09,202 INFO L226 Difference]: Without dead ends: 1374 [2022-03-15 19:44:09,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6809 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3080, Invalid=16942, Unknown=0, NotChecked=0, Total=20022 [2022-03-15 19:44:09,203 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 227 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:09,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 31 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:44:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-03-15 19:44:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 622. [2022-03-15 19:44:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 621 states have (on average 2.7310789049919486) internal successors, (1696), 621 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1696 transitions. [2022-03-15 19:44:09,212 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1696 transitions. Word has length 33 [2022-03-15 19:44:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:09,212 INFO L470 AbstractCegarLoop]: Abstraction has 622 states and 1696 transitions. [2022-03-15 19:44:09,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.9782608695652173) internal successors, (137), 46 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1696 transitions. [2022-03-15 19:44:09,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:44:09,213 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:09,213 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:09,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Ended with exit code 0 [2022-03-15 19:44:09,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107,108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:09,427 INFO L402 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:09,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:09,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1761214954, now seen corresponding path program 107 times [2022-03-15 19:44:09,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:09,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964634231] [2022-03-15 19:44:09,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:09,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 22 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:09,654 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:09,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964634231] [2022-03-15 19:44:09,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964634231] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:09,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723918398] [2022-03-15 19:44:09,655 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:44:09,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:09,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:09,656 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:09,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2022-03-15 19:44:09,774 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-15 19:44:09,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:09,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:44:09,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:10,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:11,353 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 36 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:11,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723918398] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:11,353 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:11,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 24] total 71 [2022-03-15 19:44:11,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1770333539] [2022-03-15 19:44:11,354 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:11,356 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:11,378 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 207 transitions. [2022-03-15 19:44:11,378 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:14,417 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [225829#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 225835#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 225833#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 225831#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 225840#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 225834#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 225828#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 225825#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 225824#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 225823#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 225827#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 225832#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 225839#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (not (< 2 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 225826#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 225837#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 225836#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 225830#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 225838#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:44:14,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 19:44:14,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:14,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 19:44:14,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1154, Invalid=7036, Unknown=0, NotChecked=0, Total=8190 [2022-03-15 19:44:14,418 INFO L87 Difference]: Start difference. First operand 622 states and 1696 transitions. Second operand has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 44 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:16,455 INFO L93 Difference]: Finished difference Result 1605 states and 3980 transitions. [2022-03-15 19:44:16,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 19:44:16,455 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 44 states have internal predecessors, (131), 0 states have call successors, (0), 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 33 [2022-03-15 19:44:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:16,457 INFO L225 Difference]: With dead ends: 1605 [2022-03-15 19:44:16,457 INFO L226 Difference]: Without dead ends: 1536 [2022-03-15 19:44:16,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6787 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3240, Invalid=17066, Unknown=0, NotChecked=0, Total=20306 [2022-03-15 19:44:16,458 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 216 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1911 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:16,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 32 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1911 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:44:16,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2022-03-15 19:44:16,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 696. [2022-03-15 19:44:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 2.7697841726618706) internal successors, (1925), 695 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1925 transitions. [2022-03-15 19:44:16,467 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1925 transitions. Word has length 33 [2022-03-15 19:44:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:16,468 INFO L470 AbstractCegarLoop]: Abstraction has 696 states and 1925 transitions. [2022-03-15 19:44:16,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.977272727272727) internal successors, (131), 44 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1925 transitions. [2022-03-15 19:44:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:44:16,469 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:16,469 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:16,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:16,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:16,686 INFO L402 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:16,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:16,686 INFO L85 PathProgramCache]: Analyzing trace with hash 962724846, now seen corresponding path program 108 times [2022-03-15 19:44:16,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:16,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156609146] [2022-03-15 19:44:16,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:16,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 28 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:16,920 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:16,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156609146] [2022-03-15 19:44:16,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156609146] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:16,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117933050] [2022-03-15 19:44:16,920 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:44:16,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:16,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:16,922 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:16,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-03-15 19:44:17,044 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-03-15 19:44:17,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:17,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:44:17,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:17,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 36 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:18,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117933050] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:18,074 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:18,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 24] total 71 [2022-03-15 19:44:18,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [159958631] [2022-03-15 19:44:18,074 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:18,076 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:18,098 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 198 transitions. [2022-03-15 19:44:18,098 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:19,952 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [229221#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 229216#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 229222#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 229207#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 229209#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 229211#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 229220#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 229217#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 229210#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 229213#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 229219#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 229214#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 229208#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 229215#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 229218#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 229212#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0)))] [2022-03-15 19:44:19,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-03-15 19:44:19,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:19,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-03-15 19:44:19,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1157, Invalid=6675, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 19:44:19,953 INFO L87 Difference]: Start difference. First operand 696 states and 1925 transitions. Second operand has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 42 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:21,889 INFO L93 Difference]: Finished difference Result 1773 states and 4422 transitions. [2022-03-15 19:44:21,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 19:44:21,890 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 42 states have internal predecessors, (125), 0 states have call successors, (0), 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 33 [2022-03-15 19:44:21,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:21,892 INFO L225 Difference]: With dead ends: 1773 [2022-03-15 19:44:21,892 INFO L226 Difference]: Without dead ends: 1700 [2022-03-15 19:44:21,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6717 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3423, Invalid=17169, Unknown=0, NotChecked=0, Total=20592 [2022-03-15 19:44:21,894 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 244 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:21,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 21 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:44:21,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2022-03-15 19:44:21,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 746. [2022-03-15 19:44:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 2.7946308724832214) internal successors, (2082), 745 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 2082 transitions. [2022-03-15 19:44:21,905 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 2082 transitions. Word has length 33 [2022-03-15 19:44:21,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:21,905 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 2082 transitions. [2022-03-15 19:44:21,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 42 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:21,905 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 2082 transitions. [2022-03-15 19:44:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-15 19:44:21,906 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:21,906 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:21,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:22,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable109 [2022-03-15 19:44:22,123 INFO L402 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:22,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:22,127 INFO L85 PathProgramCache]: Analyzing trace with hash -494487274, now seen corresponding path program 109 times [2022-03-15 19:44:22,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:22,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195619958] [2022-03-15 19:44:22,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:22,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 36 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:22,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:22,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195619958] [2022-03-15 19:44:22,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195619958] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:22,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174602913] [2022-03-15 19:44:22,505 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:44:22,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:22,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:22,506 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:22,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-03-15 19:44:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:22,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-15 19:44:22,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:23,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 36 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:23,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174602913] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:23,846 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:23,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 24] total 71 [2022-03-15 19:44:23,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1926243358] [2022-03-15 19:44:23,846 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:23,848 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:23,870 INFO L252 McrAutomatonBuilder]: Finished intersection with 106 states and 189 transitions. [2022-03-15 19:44:23,871 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:25,680 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 14 new interpolants: [232866#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 232873#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 232874#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 232872#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 232869#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 232867#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 232870#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 232868#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 232871#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 232876#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 232865#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 232864#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 232875#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 232863#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:44:25,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 19:44:25,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:25,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 19:44:25,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1172, Invalid=6310, Unknown=0, NotChecked=0, Total=7482 [2022-03-15 19:44:25,681 INFO L87 Difference]: Start difference. First operand 746 states and 2082 transitions. Second operand has 41 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:27,929 INFO L93 Difference]: Finished difference Result 2415 states and 5999 transitions. [2022-03-15 19:44:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-03-15 19:44:27,929 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 0 states have call successors, (0), 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 33 [2022-03-15 19:44:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:27,932 INFO L225 Difference]: With dead ends: 2415 [2022-03-15 19:44:27,932 INFO L226 Difference]: Without dead ends: 2342 [2022-03-15 19:44:27,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7187 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3692, Invalid=18064, Unknown=0, NotChecked=0, Total=21756 [2022-03-15 19:44:27,933 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 221 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:27,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 17 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:44:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2022-03-15 19:44:27,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 920. [2022-03-15 19:44:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 2.869423286180631) internal successors, (2637), 919 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2637 transitions. [2022-03-15 19:44:27,949 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2637 transitions. Word has length 33 [2022-03-15 19:44:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:27,949 INFO L470 AbstractCegarLoop]: Abstraction has 920 states and 2637 transitions. [2022-03-15 19:44:27,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.975) internal successors, (119), 40 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2637 transitions. [2022-03-15 19:44:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:44:27,950 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:27,950 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:27,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:28,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:28,163 INFO L402 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash 559906585, now seen corresponding path program 110 times [2022-03-15 19:44:28,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:28,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869470233] [2022-03-15 19:44:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:28,252 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:28,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:28,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869470233] [2022-03-15 19:44:28,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869470233] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:28,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713369317] [2022-03-15 19:44:28,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:44:28,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:28,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:28,253 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:28,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-03-15 19:44:28,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:44:28,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:28,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 19:44:28,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:28,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:28,656 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713369317] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:28,656 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:28,656 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 24 [2022-03-15 19:44:28,656 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [251604217] [2022-03-15 19:44:28,656 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:28,659 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:28,692 INFO L252 McrAutomatonBuilder]: Finished intersection with 158 states and 304 transitions. [2022-03-15 19:44:28,692 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:29,889 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:44:29,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 19:44:29,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:29,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 19:44:29,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-03-15 19:44:29,889 INFO L87 Difference]: Start difference. First operand 920 states and 2637 transitions. Second operand has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 14 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:30,375 INFO L93 Difference]: Finished difference Result 1654 states and 4805 transitions. [2022-03-15 19:44:30,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-03-15 19:44:30,376 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 14 states have internal predecessors, (113), 0 states have call successors, (0), 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 34 [2022-03-15 19:44:30,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:30,378 INFO L225 Difference]: With dead ends: 1654 [2022-03-15 19:44:30,378 INFO L226 Difference]: Without dead ends: 1556 [2022-03-15 19:44:30,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 177 SyntacticMatches, 12 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=278, Invalid=982, Unknown=0, NotChecked=0, Total=1260 [2022-03-15 19:44:30,379 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:30,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 144 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 19:44:30,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2022-03-15 19:44:30,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1292. [2022-03-15 19:44:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1291 states have (on average 2.916343919442293) internal successors, (3765), 1291 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 3765 transitions. [2022-03-15 19:44:30,392 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 3765 transitions. Word has length 34 [2022-03-15 19:44:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:30,393 INFO L470 AbstractCegarLoop]: Abstraction has 1292 states and 3765 transitions. [2022-03-15 19:44:30,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 14 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 3765 transitions. [2022-03-15 19:44:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-03-15 19:44:30,394 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:30,394 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:30,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2022-03-15 19:44:30,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2022-03-15 19:44:30,626 INFO L402 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:30,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:30,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1510058962, now seen corresponding path program 111 times [2022-03-15 19:44:30,627 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:30,627 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723647509] [2022-03-15 19:44:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:31,049 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:31,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723647509] [2022-03-15 19:44:31,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723647509] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:31,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139241822] [2022-03-15 19:44:31,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:44:31,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:31,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:31,050 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:31,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-03-15 19:44:31,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:44:31,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:31,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 19:44:31,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:31,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 45 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:32,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139241822] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:32,710 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:32,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 74 [2022-03-15 19:44:32,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1826355818] [2022-03-15 19:44:32,710 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:32,713 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:32,744 INFO L252 McrAutomatonBuilder]: Finished intersection with 158 states and 304 transitions. [2022-03-15 19:44:32,745 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:38,390 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 50 new interpolants: [242057#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= ~M1~0 (+ ~counter~0 11)) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= (+ ~counter~0 11) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 242022#(and (or (<= 10 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 242016#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 242056#(and (or (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 10)) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))), 242017#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 242049#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 3 ~counter~0)), 242031#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))), 242030#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 242028#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 242045#(and (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 242047#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0) (<= 3 ~counter~0))), 242029#(and (or (<= 11 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 242040#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 6 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 242025#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 242021#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 242019#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 242046#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 4 ~counter~0)), 242055#(and (or (<= (+ ~counter~0 11) ~M1~0) (< 11 ~M1~0) (not (< 10 ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (< 11 ~M1~0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (< 11 ~M1~0) (not (< 10 ~M1~0)))), 242059#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 242026#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0)) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 242027#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0)) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 242043#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 5 ~counter~0)), 242033#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 242052#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 2 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 242044#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 242037#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 9 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 242032#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 242012#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 242042#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 5 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 242051#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0))), 242053#(and (or (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 10)) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))), 242024#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 242039#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 7 ~counter~0)), 242050#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0))), 242048#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0) (<= 3 ~counter~0))), 242035#(and (<= 11 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= ~counter~0 ~M1~0)), 242038#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 8 ~counter~0)), 242058#(and (or (<= (+ ~counter~0 11) ~M1~0) (< 11 ~M1~0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (< 11 ~M1~0) (not (< 10 ~M1~0)))), 242018#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 242060#(and (= thread2Thread1of1ForFork1_~i~1 0) (= ~counter~0 0)), 242054#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= ~M1~0 (+ ~counter~0 11)) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= (+ ~counter~0 11) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 242014#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 242023#(and (or (<= 11 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 242041#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 5 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 242015#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 242013#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 242020#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 242034#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 242036#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 10 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 242011#(and (<= 11 ~counter~0) (<= ~M1~0 ~counter~0) (<= ~counter~0 ~M1~0))] [2022-03-15 19:44:38,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-03-15 19:44:38,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:38,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-03-15 19:44:38,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1987, Invalid=13763, Unknown=0, NotChecked=0, Total=15750 [2022-03-15 19:44:38,392 INFO L87 Difference]: Start difference. First operand 1292 states and 3765 transitions. Second operand has 78 states, 77 states have (on average 2.8701298701298703) internal successors, (221), 77 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:47,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:44:47,333 INFO L93 Difference]: Finished difference Result 1908 states and 5244 transitions. [2022-03-15 19:44:47,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 19:44:47,334 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 2.8701298701298703) internal successors, (221), 77 states have internal predecessors, (221), 0 states have call successors, (0), 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 34 [2022-03-15 19:44:47,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:44:47,336 INFO L225 Difference]: With dead ends: 1908 [2022-03-15 19:44:47,337 INFO L226 Difference]: Without dead ends: 1898 [2022-03-15 19:44:47,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13271 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=4650, Invalid=29760, Unknown=0, NotChecked=0, Total=34410 [2022-03-15 19:44:47,338 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 533 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 4989 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 5256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 4989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:44:47,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [533 Valid, 167 Invalid, 5256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 4989 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 19:44:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2022-03-15 19:44:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1246. [2022-03-15 19:44:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1245 states have (on average 2.9269076305220882) internal successors, (3644), 1245 states have internal predecessors, (3644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 3644 transitions. [2022-03-15 19:44:47,353 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 3644 transitions. Word has length 34 [2022-03-15 19:44:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:44:47,353 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 3644 transitions. [2022-03-15 19:44:47,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 2.8701298701298703) internal successors, (221), 77 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:44:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 3644 transitions. [2022-03-15 19:44:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:44:47,354 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:44:47,355 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:44:47,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Forceful destruction successful, exit code 0 [2022-03-15 19:44:47,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2022-03-15 19:44:47,567 INFO L402 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:44:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:44:47,568 INFO L85 PathProgramCache]: Analyzing trace with hash 422090941, now seen corresponding path program 112 times [2022-03-15 19:44:47,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:44:47,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096327782] [2022-03-15 19:44:47,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:44:47,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:44:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:44:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:47,841 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:44:47,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096327782] [2022-03-15 19:44:47,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096327782] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:44:47,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090574677] [2022-03-15 19:44:47,842 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:44:47,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:44:47,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:44:47,843 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:44:47,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2022-03-15 19:44:48,000 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:44:48,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:44:48,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 70 conjunts are in the unsatisfiable core [2022-03-15 19:44:48,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:44:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:48,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:44:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:44:49,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090574677] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:44:49,455 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:44:49,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 78 [2022-03-15 19:44:49,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1053123571] [2022-03-15 19:44:49,455 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:44:49,458 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:44:49,493 INFO L252 McrAutomatonBuilder]: Finished intersection with 164 states and 316 transitions. [2022-03-15 19:44:49,493 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:44:53,820 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 38 new interpolants: [246879#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 246874#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 246895#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0))), 246870#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 246901#(and (or (<= (+ ~counter~0 11) ~M1~0) (< 11 ~M1~0) (not (< 10 ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (< 11 ~M1~0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (< 11 ~M1~0) (not (< 10 ~M1~0)))), 246899#(and (or (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 10)) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))), 246883#(and (or (<= 11 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 246875#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 246891#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 246893#(and (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 246902#(and (or (<= (+ ~counter~0 11) ~M1~0) (< 11 ~M1~0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (< 11 ~M1~0) (not (< 10 ~M1~0)))), 246876#(and (or (<= 10 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 246887#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 246890#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 5 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 246865#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 246871#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 246884#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 246888#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 246869#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 246873#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 246880#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0)) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 246885#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))), 246872#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 246877#(and (or (<= 11 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0))), 246889#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 5 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 246882#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 246896#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0))), 246886#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 246866#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 246897#(and (or (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 10)) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))), 246878#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 246881#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0)) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 246900#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= ~M1~0 (+ ~counter~0 11)) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= (+ ~counter~0 11) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 246892#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0) (<= 3 ~counter~0))), 246867#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 246898#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= ~M1~0 (+ ~counter~0 11)) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= (+ ~counter~0 11) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 246894#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0) (<= 3 ~counter~0))), 246868#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:44:53,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-15 19:44:53,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:44:53,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-15 19:44:53,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1624, Invalid=12182, Unknown=0, NotChecked=0, Total=13806 [2022-03-15 19:44:53,821 INFO L87 Difference]: Start difference. First operand 1246 states and 3644 transitions. Second operand has 67 states, 66 states have (on average 3.0454545454545454) internal successors, (201), 66 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:09,356 INFO L93 Difference]: Finished difference Result 1812 states and 4993 transitions. [2022-03-15 19:45:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-03-15 19:45:09,356 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 3.0454545454545454) internal successors, (201), 66 states have internal predecessors, (201), 0 states have call successors, (0), 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 35 [2022-03-15 19:45:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:09,359 INFO L225 Difference]: With dead ends: 1812 [2022-03-15 19:45:09,359 INFO L226 Difference]: Without dead ends: 1798 [2022-03-15 19:45:09,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22643 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=9402, Invalid=59504, Unknown=0, NotChecked=0, Total=68906 [2022-03-15 19:45:09,361 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 435 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 4221 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 4532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 4221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:09,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [435 Valid, 186 Invalid, 4532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 4221 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-03-15 19:45:09,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2022-03-15 19:45:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1332. [2022-03-15 19:45:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1331 states have (on average 2.9286250939143503) internal successors, (3898), 1331 states have internal predecessors, (3898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 3898 transitions. [2022-03-15 19:45:09,376 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 3898 transitions. Word has length 35 [2022-03-15 19:45:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:09,376 INFO L470 AbstractCegarLoop]: Abstraction has 1332 states and 3898 transitions. [2022-03-15 19:45:09,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 3.0454545454545454) internal successors, (201), 66 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 3898 transitions. [2022-03-15 19:45:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:45:09,378 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:09,378 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:09,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:09,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:09,595 INFO L402 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:09,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:09,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1108619311, now seen corresponding path program 113 times [2022-03-15 19:45:09,595 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:09,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039090052] [2022-03-15 19:45:09,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:09,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:09,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:09,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039090052] [2022-03-15 19:45:09,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039090052] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:09,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525903642] [2022-03-15 19:45:09,861 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:45:09,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:09,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:09,862 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:09,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2022-03-15 19:45:09,989 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:45:09,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:09,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:45:09,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:10,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:11,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525903642] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:11,212 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:11,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 78 [2022-03-15 19:45:11,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074411133] [2022-03-15 19:45:11,212 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:11,215 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:11,292 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 285 transitions. [2022-03-15 19:45:11,292 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:14,585 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [251955#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 251975#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 251968#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 251985#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 251962#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 251974#(and (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 251954#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 251958#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 251967#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 251983#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 251981#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 251963#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 251956#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 251977#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 251961#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 251965#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 251970#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 251964#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 251979#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 251957#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 251973#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 251960#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 251984#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 251959#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 251978#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 251971#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 251953#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 251972#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 251969#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 251966#(and (or (not (< 9 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 251976#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 251980#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 251982#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:45:14,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 19:45:14,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:14,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 19:45:14,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1796, Invalid=10860, Unknown=0, NotChecked=0, Total=12656 [2022-03-15 19:45:14,586 INFO L87 Difference]: Start difference. First operand 1332 states and 3898 transitions. Second operand has 62 states, 61 states have (on average 2.9836065573770494) internal successors, (182), 61 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:16,281 INFO L93 Difference]: Finished difference Result 1857 states and 5180 transitions. [2022-03-15 19:45:16,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-15 19:45:16,281 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.9836065573770494) internal successors, (182), 61 states have internal predecessors, (182), 0 states have call successors, (0), 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 35 [2022-03-15 19:45:16,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:16,284 INFO L225 Difference]: With dead ends: 1857 [2022-03-15 19:45:16,284 INFO L226 Difference]: Without dead ends: 1808 [2022-03-15 19:45:16,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8558 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3240, Invalid=19410, Unknown=0, NotChecked=0, Total=22650 [2022-03-15 19:45:16,286 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 222 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 2164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:16,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 75 Invalid, 2164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2077 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:45:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-03-15 19:45:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1476. [2022-03-15 19:45:16,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1475 states have (on average 2.9261016949152543) internal successors, (4316), 1475 states have internal predecessors, (4316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 4316 transitions. [2022-03-15 19:45:16,302 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 4316 transitions. Word has length 35 [2022-03-15 19:45:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:16,302 INFO L470 AbstractCegarLoop]: Abstraction has 1476 states and 4316 transitions. [2022-03-15 19:45:16,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.9836065573770494) internal successors, (182), 61 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 4316 transitions. [2022-03-15 19:45:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:45:16,304 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:16,304 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:16,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2022-03-15 19:45:16,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2022-03-15 19:45:16,523 INFO L402 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:16,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:16,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1021268541, now seen corresponding path program 114 times [2022-03-15 19:45:16,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:16,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979302107] [2022-03-15 19:45:16,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:16,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:16,796 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:16,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979302107] [2022-03-15 19:45:16,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979302107] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:16,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138566268] [2022-03-15 19:45:16,796 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:45:16,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:16,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:16,798 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:16,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2022-03-15 19:45:16,895 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:45:16,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:16,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:45:16,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:17,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 37 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:18,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138566268] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:18,074 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:18,074 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 78 [2022-03-15 19:45:18,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1164265505] [2022-03-15 19:45:18,074 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:18,077 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:18,108 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 276 transitions. [2022-03-15 19:45:18,108 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:21,156 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [257186#(and (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 257166#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 257169#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 257183#(and (or (not (< 9 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 257172#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 257168#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 257171#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 257155#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 257179#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 257176#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 257185#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 257177#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 257165#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 257164#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 257182#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 257167#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 257184#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 257178#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 257162#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 257160#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 257161#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 257156#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 257173#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 257181#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 257174#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 257157#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 257158#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 257180#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 257159#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 257175#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 257170#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 257163#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:45:21,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 19:45:21,157 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:21,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 19:45:21,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1719, Invalid=10713, Unknown=0, NotChecked=0, Total=12432 [2022-03-15 19:45:21,158 INFO L87 Difference]: Start difference. First operand 1476 states and 4316 transitions. Second operand has 61 states, 60 states have (on average 2.95) internal successors, (177), 60 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:23,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:23,271 INFO L93 Difference]: Finished difference Result 2371 states and 6710 transitions. [2022-03-15 19:45:23,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-15 19:45:23,271 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.95) internal successors, (177), 60 states have internal predecessors, (177), 0 states have call successors, (0), 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 35 [2022-03-15 19:45:23,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:23,275 INFO L225 Difference]: With dead ends: 2371 [2022-03-15 19:45:23,275 INFO L226 Difference]: Without dead ends: 2326 [2022-03-15 19:45:23,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8705 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3337, Invalid=19919, Unknown=0, NotChecked=0, Total=23256 [2022-03-15 19:45:23,277 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 201 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:23,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 71 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:45:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2022-03-15 19:45:23,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 1604. [2022-03-15 19:45:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1603 states have (on average 2.9619463505926387) internal successors, (4748), 1603 states have internal predecessors, (4748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 4748 transitions. [2022-03-15 19:45:23,321 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 4748 transitions. Word has length 35 [2022-03-15 19:45:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:23,321 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 4748 transitions. [2022-03-15 19:45:23,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.95) internal successors, (177), 60 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 4748 transitions. [2022-03-15 19:45:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:45:23,323 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:23,324 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:23,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:23,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2022-03-15 19:45:23,539 INFO L402 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:23,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:23,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1849734767, now seen corresponding path program 115 times [2022-03-15 19:45:23,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:23,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590635250] [2022-03-15 19:45:23,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:23,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:23,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:23,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590635250] [2022-03-15 19:45:23,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590635250] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:23,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781248594] [2022-03-15 19:45:23,970 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:45:23,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:23,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:23,972 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:23,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2022-03-15 19:45:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:24,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:45:24,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:24,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 31 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:25,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781248594] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:25,908 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:25,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 78 [2022-03-15 19:45:25,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [523501433] [2022-03-15 19:45:25,908 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:25,911 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:25,943 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 267 transitions. [2022-03-15 19:45:25,943 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:29,159 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [263143#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 263140#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 263142#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 263153#(and (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 263145#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 263132#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 263141#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 263149#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 263157#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 263162#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 263151#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 263160#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 263134#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 263150#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 263155#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 263156#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 263144#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 263148#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 263152#(and (or (not (< 9 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 263139#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 263161#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 263147#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 263133#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 263136#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 263135#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 263158#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 263154#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 263159#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 263146#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 263138#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 263137#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))))] [2022-03-15 19:45:29,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 19:45:29,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:29,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 19:45:29,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1657, Invalid=10553, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 19:45:29,161 INFO L87 Difference]: Start difference. First operand 1604 states and 4748 transitions. Second operand has 60 states, 59 states have (on average 2.9152542372881354) internal successors, (172), 59 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:45:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:31,079 INFO L93 Difference]: Finished difference Result 2569 states and 7324 transitions. [2022-03-15 19:45:31,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-03-15 19:45:31,080 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.9152542372881354) internal successors, (172), 59 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) Word has length 35 [2022-03-15 19:45:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:31,084 INFO L225 Difference]: With dead ends: 2569 [2022-03-15 19:45:31,084 INFO L226 Difference]: Without dead ends: 2520 [2022-03-15 19:45:31,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8942 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3538, Invalid=20954, Unknown=0, NotChecked=0, Total=24492 [2022-03-15 19:45:31,085 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 251 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:31,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 67 Invalid, 2133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2043 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:45:31,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2022-03-15 19:45:31,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1574. [2022-03-15 19:45:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1573 states have (on average 2.951684678957406) internal successors, (4643), 1573 states have internal predecessors, (4643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 4643 transitions. [2022-03-15 19:45:31,107 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 4643 transitions. Word has length 35 [2022-03-15 19:45:31,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:31,107 INFO L470 AbstractCegarLoop]: Abstraction has 1574 states and 4643 transitions. [2022-03-15 19:45:31,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.9152542372881354) internal successors, (172), 59 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:45:31,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 4643 transitions. [2022-03-15 19:45:31,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:45:31,109 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:31,109 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:31,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2022-03-15 19:45:31,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116,117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:31,316 INFO L402 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:31,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1310129155, now seen corresponding path program 116 times [2022-03-15 19:45:31,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:31,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765171653] [2022-03-15 19:45:31,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:31,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:31,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:31,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765171653] [2022-03-15 19:45:31,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765171653] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:31,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171004633] [2022-03-15 19:45:31,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:45:31,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:31,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:31,713 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:31,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2022-03-15 19:45:31,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:45:31,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:31,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:45:31,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:32,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:33,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171004633] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:33,193 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:33,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 78 [2022-03-15 19:45:33,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1219797534] [2022-03-15 19:45:33,193 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:33,196 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:33,226 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 258 transitions. [2022-03-15 19:45:33,226 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:35,936 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [269283#(and (or (not (< 9 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 269264#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 269281#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 269277#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 269284#(and (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 269257#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 269258#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 269265#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 269279#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 269268#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 269280#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 269269#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 269276#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 269266#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 269274#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 269270#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 269273#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 269262#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 269256#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 269275#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 269278#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 269263#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 269267#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 269259#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 269260#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 269282#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 269271#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 269261#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 269285#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 269272#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0)))] [2022-03-15 19:45:35,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-15 19:45:35,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:35,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-15 19:45:35,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1610, Invalid=10380, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 19:45:35,938 INFO L87 Difference]: Start difference. First operand 1574 states and 4643 transitions. Second operand has 59 states, 58 states have (on average 2.8793103448275863) internal successors, (167), 58 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:38,086 INFO L93 Difference]: Finished difference Result 2629 states and 7455 transitions. [2022-03-15 19:45:38,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 19:45:38,086 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.8793103448275863) internal successors, (167), 58 states have internal predecessors, (167), 0 states have call successors, (0), 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 35 [2022-03-15 19:45:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:38,090 INFO L225 Difference]: With dead ends: 2629 [2022-03-15 19:45:38,091 INFO L226 Difference]: Without dead ends: 2576 [2022-03-15 19:45:38,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9143 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3767, Invalid=21993, Unknown=0, NotChecked=0, Total=25760 [2022-03-15 19:45:38,092 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 242 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:38,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 84 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:45:38,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2022-03-15 19:45:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 1532. [2022-03-15 19:45:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 2.936642717178315) internal successors, (4496), 1531 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:45:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 4496 transitions. [2022-03-15 19:45:38,114 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 4496 transitions. Word has length 35 [2022-03-15 19:45:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:38,114 INFO L470 AbstractCegarLoop]: Abstraction has 1532 states and 4496 transitions. [2022-03-15 19:45:38,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.8793103448275863) internal successors, (167), 58 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:38,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 4496 transitions. [2022-03-15 19:45:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:45:38,116 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:38,116 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:38,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:38,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:38,334 INFO L402 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:38,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:38,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1134965585, now seen corresponding path program 117 times [2022-03-15 19:45:38,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:38,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785127595] [2022-03-15 19:45:38,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:38,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:38,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:38,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785127595] [2022-03-15 19:45:38,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785127595] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:38,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75310886] [2022-03-15 19:45:38,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:45:38,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:38,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:38,719 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:38,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2022-03-15 19:45:38,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:45:38,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:38,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:45:38,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:39,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 25 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:40,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75310886] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:40,588 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:40,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 78 [2022-03-15 19:45:40,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1194145973] [2022-03-15 19:45:40,588 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:40,591 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:40,618 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 249 transitions. [2022-03-15 19:45:40,619 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:43,861 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [275377#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 275370#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 275367#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 275383#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 275385#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 275371#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 275378#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 275387#(and (or (not (< 9 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 275382#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 275390#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 275372#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 275369#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 275368#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 275386#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 275393#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 275375#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 275366#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 275373#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 275392#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 275391#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 275365#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 275381#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 275374#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 275376#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 275389#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 275379#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 275384#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 275380#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 275388#(and (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0)))] [2022-03-15 19:45:43,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 19:45:43,862 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:43,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 19:45:43,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1578, Invalid=10194, Unknown=0, NotChecked=0, Total=11772 [2022-03-15 19:45:43,863 INFO L87 Difference]: Start difference. First operand 1532 states and 4496 transitions. Second operand has 58 states, 57 states have (on average 2.8421052631578947) internal successors, (162), 57 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:46,208 INFO L93 Difference]: Finished difference Result 2651 states and 7449 transitions. [2022-03-15 19:45:46,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-03-15 19:45:46,209 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.8421052631578947) internal successors, (162), 57 states have internal predecessors, (162), 0 states have call successors, (0), 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 35 [2022-03-15 19:45:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:46,213 INFO L225 Difference]: With dead ends: 2651 [2022-03-15 19:45:46,213 INFO L226 Difference]: Without dead ends: 2594 [2022-03-15 19:45:46,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9274 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4024, Invalid=23036, Unknown=0, NotChecked=0, Total=27060 [2022-03-15 19:45:46,215 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 300 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 2637 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:46,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 98 Invalid, 2778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2637 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:45:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2022-03-15 19:45:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 1478. [2022-03-15 19:45:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 1477 states have (on average 2.916046039268788) internal successors, (4307), 1477 states have internal predecessors, (4307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 4307 transitions. [2022-03-15 19:45:46,235 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 4307 transitions. Word has length 35 [2022-03-15 19:45:46,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:46,235 INFO L470 AbstractCegarLoop]: Abstraction has 1478 states and 4307 transitions. [2022-03-15 19:45:46,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.8421052631578947) internal successors, (162), 57 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:46,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 4307 transitions. [2022-03-15 19:45:46,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:45:46,236 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:46,236 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:46,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:46,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2022-03-15 19:45:46,440 INFO L402 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:46,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash -852220483, now seen corresponding path program 118 times [2022-03-15 19:45:46,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:46,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667683317] [2022-03-15 19:45:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:46,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:46,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667683317] [2022-03-15 19:45:46,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667683317] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:46,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728585293] [2022-03-15 19:45:46,868 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:45:46,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:46,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:46,869 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:46,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2022-03-15 19:45:47,012 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:45:47,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:47,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:45:47,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:47,466 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:47,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 25 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:48,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728585293] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:48,217 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:48,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 78 [2022-03-15 19:45:48,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [675166490] [2022-03-15 19:45:48,218 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:48,220 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:48,247 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 240 transitions. [2022-03-15 19:45:48,247 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:50,669 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [281397#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 281423#(and (or (not (< 9 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 281411#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 281415#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 281408#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 281407#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 281403#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 281410#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 281400#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 281399#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 281405#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 281401#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 281417#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 281414#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 281420#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 281406#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 281422#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 281421#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 281398#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 281418#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 281402#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 281404#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 281413#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 281416#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 281424#(and (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 281419#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 281409#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 281412#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:45:50,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-03-15 19:45:50,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:50,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-03-15 19:45:50,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1561, Invalid=9995, Unknown=0, NotChecked=0, Total=11556 [2022-03-15 19:45:50,670 INFO L87 Difference]: Start difference. First operand 1478 states and 4307 transitions. Second operand has 57 states, 56 states have (on average 2.8035714285714284) internal successors, (157), 56 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:45:53,644 INFO L93 Difference]: Finished difference Result 2635 states and 7306 transitions. [2022-03-15 19:45:53,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-03-15 19:45:53,645 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.8035714285714284) internal successors, (157), 56 states have internal predecessors, (157), 0 states have call successors, (0), 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 35 [2022-03-15 19:45:53,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:45:53,649 INFO L225 Difference]: With dead ends: 2635 [2022-03-15 19:45:53,649 INFO L226 Difference]: Without dead ends: 2574 [2022-03-15 19:45:53,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9579 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4309, Invalid=24083, Unknown=0, NotChecked=0, Total=28392 [2022-03-15 19:45:53,651 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 290 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 2804 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 2872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:45:53,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 101 Invalid, 2872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2804 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:45:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2022-03-15 19:45:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1412. [2022-03-15 19:45:53,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1411 states have (on average 2.888731396172927) internal successors, (4076), 1411 states have internal predecessors, (4076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:53,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 4076 transitions. [2022-03-15 19:45:53,670 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 4076 transitions. Word has length 35 [2022-03-15 19:45:53,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:45:53,670 INFO L470 AbstractCegarLoop]: Abstraction has 1412 states and 4076 transitions. [2022-03-15 19:45:53,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.8035714285714284) internal successors, (157), 56 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:45:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 4076 transitions. [2022-03-15 19:45:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:45:53,671 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:45:53,671 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:45:53,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Forceful destruction successful, exit code 0 [2022-03-15 19:45:53,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable119 [2022-03-15 19:45:53,888 INFO L402 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:45:53,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:45:53,888 INFO L85 PathProgramCache]: Analyzing trace with hash -566005009, now seen corresponding path program 119 times [2022-03-15 19:45:53,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:45:53,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273761196] [2022-03-15 19:45:53,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:45:53,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:45:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:45:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:54,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:45:54,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273761196] [2022-03-15 19:45:54,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273761196] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:45:54,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996338276] [2022-03-15 19:45:54,217 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:45:54,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:45:54,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:45:54,218 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:45:54,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-03-15 19:45:54,317 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:45:54,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:45:54,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:45:54,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:45:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:54,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:45:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:45:55,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996338276] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:45:55,722 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:45:55,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 78 [2022-03-15 19:45:55,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2086660943] [2022-03-15 19:45:55,722 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:45:55,725 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:45:55,751 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 231 transitions. [2022-03-15 19:45:55,751 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:45:58,009 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [287312#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 287308#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 287303#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 287316#(and (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 287304#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 287309#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 287314#(and (or (not (< 9 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 287301#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 287307#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 287313#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 287293#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 287292#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 287306#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 287302#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 287310#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 287299#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 287290#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 287298#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 287294#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 287311#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 287296#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 287291#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 287305#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 287315#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 287295#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 287297#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 287300#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:45:58,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 19:45:58,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:45:58,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 19:45:58,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=9783, Unknown=0, NotChecked=0, Total=11342 [2022-03-15 19:45:58,010 INFO L87 Difference]: Start difference. First operand 1412 states and 4076 transitions. Second operand has 56 states, 55 states have (on average 2.7636363636363637) internal successors, (152), 55 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:00,961 INFO L93 Difference]: Finished difference Result 2581 states and 7026 transitions. [2022-03-15 19:46:00,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-03-15 19:46:00,961 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.7636363636363637) internal successors, (152), 55 states have internal predecessors, (152), 0 states have call successors, (0), 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 35 [2022-03-15 19:46:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:00,965 INFO L225 Difference]: With dead ends: 2581 [2022-03-15 19:46:00,965 INFO L226 Difference]: Without dead ends: 2516 [2022-03-15 19:46:00,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9788 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4622, Invalid=25134, Unknown=0, NotChecked=0, Total=29756 [2022-03-15 19:46:00,967 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 321 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:00,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 80 Invalid, 2357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 19:46:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2022-03-15 19:46:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 1334. [2022-03-15 19:46:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1333 states have (on average 2.8529632408102024) internal successors, (3803), 1333 states have internal predecessors, (3803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:00,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 3803 transitions. [2022-03-15 19:46:00,986 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 3803 transitions. Word has length 35 [2022-03-15 19:46:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:00,986 INFO L470 AbstractCegarLoop]: Abstraction has 1334 states and 3803 transitions. [2022-03-15 19:46:00,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.7636363636363637) internal successors, (152), 55 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 3803 transitions. [2022-03-15 19:46:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:46:00,988 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:00,988 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:01,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:01,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:01,201 INFO L402 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:01,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:01,201 INFO L85 PathProgramCache]: Analyzing trace with hash 274511741, now seen corresponding path program 120 times [2022-03-15 19:46:01,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:01,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132062138] [2022-03-15 19:46:01,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:01,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:01,529 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:01,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132062138] [2022-03-15 19:46:01,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132062138] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:01,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348896600] [2022-03-15 19:46:01,529 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:46:01,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:01,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:01,530 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:01,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2022-03-15 19:46:01,707 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:46:01,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:01,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 68 conjunts are in the unsatisfiable core [2022-03-15 19:46:01,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:02,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 38 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:03,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348896600] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:03,447 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:03,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 78 [2022-03-15 19:46:03,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1318784514] [2022-03-15 19:46:03,447 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:03,450 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:03,475 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 222 transitions. [2022-03-15 19:46:03,475 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:05,619 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [293000#(and (or (not (< 9 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 292995#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 293005#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 292991#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 292990#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 293007#(and (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 292985#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 293002#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 292988#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 292989#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 292986#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 292998#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 293001#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 292983#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 293006#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 292996#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 292993#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 293004#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 292997#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 292982#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 292987#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 292999#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 293003#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 292984#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 292994#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 292992#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:46:05,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-03-15 19:46:05,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:05,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-03-15 19:46:05,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1350, Invalid=9780, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 19:46:05,621 INFO L87 Difference]: Start difference. First operand 1334 states and 3803 transitions. Second operand has 55 states, 54 states have (on average 2.7222222222222223) internal successors, (147), 54 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:08,983 INFO L93 Difference]: Finished difference Result 2493 states and 6651 transitions. [2022-03-15 19:46:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 19:46:08,984 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.7222222222222223) internal successors, (147), 54 states have internal predecessors, (147), 0 states have call successors, (0), 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 35 [2022-03-15 19:46:08,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:08,987 INFO L225 Difference]: With dead ends: 2493 [2022-03-15 19:46:08,987 INFO L226 Difference]: Without dead ends: 2424 [2022-03-15 19:46:08,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9741 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3949, Invalid=27203, Unknown=0, NotChecked=0, Total=31152 [2022-03-15 19:46:08,989 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 287 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 2611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:08,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 79 Invalid, 2611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:46:08,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2022-03-15 19:46:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1060. [2022-03-15 19:46:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 1059 states have (on average 2.776203966005666) internal successors, (2940), 1059 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 2940 transitions. [2022-03-15 19:46:09,006 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 2940 transitions. Word has length 35 [2022-03-15 19:46:09,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:09,006 INFO L470 AbstractCegarLoop]: Abstraction has 1060 states and 2940 transitions. [2022-03-15 19:46:09,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.7222222222222223) internal successors, (147), 54 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 2940 transitions. [2022-03-15 19:46:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:46:09,007 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:09,007 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:09,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Ended with exit code 0 [2022-03-15 19:46:09,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:09,220 INFO L402 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:09,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:09,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1360942801, now seen corresponding path program 121 times [2022-03-15 19:46:09,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:09,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540367851] [2022-03-15 19:46:09,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:09,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:09,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:09,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540367851] [2022-03-15 19:46:09,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540367851] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:09,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800327766] [2022-03-15 19:46:09,493 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:46:09,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:09,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:09,494 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:09,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2022-03-15 19:46:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:09,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:46:09,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:10,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 37 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:10,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800327766] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:10,782 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:10,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 78 [2022-03-15 19:46:10,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [163527239] [2022-03-15 19:46:10,782 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:10,785 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:10,810 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 213 transitions. [2022-03-15 19:46:10,810 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:12,758 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [298060#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 298054#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 298052#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 298064#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 298057#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 298070#(and (or (not (< 9 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 298047#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 298049#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 298069#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 298062#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 298066#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 298068#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 298048#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 298071#(and (or (not (< 9 ~M1~0)) (<= ~counter~0 0)) (or (not (< 9 ~M1~0)) (<= 0 ~counter~0))), 298056#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 298058#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 298050#(and (or (<= 9 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 298055#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 6 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 298067#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 298053#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 298065#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 298059#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 298063#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 298061#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 298051#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:46:12,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 19:46:12,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:12,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 19:46:12,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1600, Invalid=9320, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 19:46:12,759 INFO L87 Difference]: Start difference. First operand 1060 states and 2940 transitions. Second operand has 54 states, 53 states have (on average 2.6792452830188678) internal successors, (142), 53 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:15,803 INFO L93 Difference]: Finished difference Result 2031 states and 5235 transitions. [2022-03-15 19:46:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-15 19:46:15,803 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.6792452830188678) internal successors, (142), 53 states have internal predecessors, (142), 0 states have call successors, (0), 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 35 [2022-03-15 19:46:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:15,806 INFO L225 Difference]: With dead ends: 2031 [2022-03-15 19:46:15,806 INFO L226 Difference]: Without dead ends: 1958 [2022-03-15 19:46:15,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10492 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5332, Invalid=27248, Unknown=0, NotChecked=0, Total=32580 [2022-03-15 19:46:15,808 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 263 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 3013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:15,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 84 Invalid, 3013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2872 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:46:15,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2022-03-15 19:46:15,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 456. [2022-03-15 19:46:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 2.5494505494505493) internal successors, (1160), 455 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:15,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1160 transitions. [2022-03-15 19:46:15,817 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1160 transitions. Word has length 35 [2022-03-15 19:46:15,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:15,817 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 1160 transitions. [2022-03-15 19:46:15,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.6792452830188678) internal successors, (142), 53 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1160 transitions. [2022-03-15 19:46:15,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:46:15,818 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:15,818 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:15,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:16,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:16,034 INFO L402 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:16,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:16,035 INFO L85 PathProgramCache]: Analyzing trace with hash -40770729, now seen corresponding path program 122 times [2022-03-15 19:46:16,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:16,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498692309] [2022-03-15 19:46:16,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:16,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 29 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:16,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:16,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498692309] [2022-03-15 19:46:16,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498692309] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:16,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595202101] [2022-03-15 19:46:16,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:46:16,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:16,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:16,422 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:16,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-03-15 19:46:16,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:46:16,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:16,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:46:16,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:17,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:17,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595202101] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:17,831 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:17,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 77 [2022-03-15 19:46:17,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [744541621] [2022-03-15 19:46:17,831 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:17,834 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:17,863 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 276 transitions. [2022-03-15 19:46:17,863 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:20,908 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [301462#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 301456#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 301454#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 301465#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 301473#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 301461#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 301472#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 301475#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 301451#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 301463#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 301460#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 301477#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 301452#(and (or (<= 6 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 301476#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 301457#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 301478#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 301470#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 301479#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 301469#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 301453#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 301450#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 8 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 301467#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 301471#(and (or (not (< 8 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0)))), 301464#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 301466#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 301455#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 7 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 301474#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 301459#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 301468#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 301458#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 4 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 301480#(and (or (not (< 8 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 8 ~M1~0))))] [2022-03-15 19:46:20,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 19:46:20,909 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:20,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 19:46:20,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1659, Invalid=10331, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 19:46:20,910 INFO L87 Difference]: Start difference. First operand 456 states and 1160 transitions. Second operand has 60 states, 59 states have (on average 2.983050847457627) internal successors, (176), 59 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:22,721 INFO L93 Difference]: Finished difference Result 879 states and 2078 transitions. [2022-03-15 19:46:22,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-03-15 19:46:22,721 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 2.983050847457627) internal successors, (176), 59 states have internal predecessors, (176), 0 states have call successors, (0), 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 35 [2022-03-15 19:46:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:22,722 INFO L225 Difference]: With dead ends: 879 [2022-03-15 19:46:22,722 INFO L226 Difference]: Without dead ends: 826 [2022-03-15 19:46:22,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8547 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3156, Invalid=19194, Unknown=0, NotChecked=0, Total=22350 [2022-03-15 19:46:22,724 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 235 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 2533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:22,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 85 Invalid, 2533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2428 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:46:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-03-15 19:46:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 474. [2022-03-15 19:46:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 2.5644820295983086) internal successors, (1213), 473 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1213 transitions. [2022-03-15 19:46:22,729 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1213 transitions. Word has length 35 [2022-03-15 19:46:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:22,729 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 1213 transitions. [2022-03-15 19:46:22,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 2.983050847457627) internal successors, (176), 59 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1213 transitions. [2022-03-15 19:46:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:46:22,730 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:22,730 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:22,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:22,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2022-03-15 19:46:22,946 INFO L402 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:22,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:22,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1312123601, now seen corresponding path program 123 times [2022-03-15 19:46:22,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:22,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079881821] [2022-03-15 19:46:22,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:22,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 24 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:23,217 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:23,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079881821] [2022-03-15 19:46:23,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079881821] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:23,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427140458] [2022-03-15 19:46:23,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:46:23,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:23,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:23,218 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:23,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-03-15 19:46:23,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:46:23,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:23,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:46:23,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:23,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:24,566 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:24,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427140458] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:24,567 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:24,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 77 [2022-03-15 19:46:24,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [694870235] [2022-03-15 19:46:24,567 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:24,570 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:24,599 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 267 transitions. [2022-03-15 19:46:24,599 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:27,498 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [303694#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 303673#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 303674#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 303690#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 303698#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 7 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 303691#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 303671#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 303695#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 303675#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 303680#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 303699#(and (or (not (< 7 ~M1~0)) (<= ~counter~0 0)) (or (not (< 7 ~M1~0)) (<= 0 ~counter~0))), 303685#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 7 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 303679#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 303683#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 303692#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 303689#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 303686#(and (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 303696#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 303676#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 303677#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 303688#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 6 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 303697#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 303672#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 303682#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 303678#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 303693#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 303681#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 303684#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 303687#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))))] [2022-03-15 19:46:27,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-03-15 19:46:27,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:27,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-03-15 19:46:27,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1566, Invalid=9990, Unknown=0, NotChecked=0, Total=11556 [2022-03-15 19:46:27,499 INFO L87 Difference]: Start difference. First operand 474 states and 1213 transitions. Second operand has 58 states, 57 states have (on average 2.982456140350877) internal successors, (170), 57 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:29,346 INFO L93 Difference]: Finished difference Result 1049 states and 2516 transitions. [2022-03-15 19:46:29,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-03-15 19:46:29,346 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.982456140350877) internal successors, (170), 57 states have internal predecessors, (170), 0 states have call successors, (0), 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 35 [2022-03-15 19:46:29,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:29,347 INFO L225 Difference]: With dead ends: 1049 [2022-03-15 19:46:29,348 INFO L226 Difference]: Without dead ends: 992 [2022-03-15 19:46:29,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8483 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3225, Invalid=19425, Unknown=0, NotChecked=0, Total=22650 [2022-03-15 19:46:29,349 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 215 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:29,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 77 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:46:29,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-03-15 19:46:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 508. [2022-03-15 19:46:29,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 2.5996055226824457) internal successors, (1318), 507 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1318 transitions. [2022-03-15 19:46:29,354 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1318 transitions. Word has length 35 [2022-03-15 19:46:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:29,354 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 1318 transitions. [2022-03-15 19:46:29,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.982456140350877) internal successors, (170), 57 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1318 transitions. [2022-03-15 19:46:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:46:29,355 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:29,355 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:29,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:29,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2022-03-15 19:46:29,571 INFO L402 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:29,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:29,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2069356969, now seen corresponding path program 124 times [2022-03-15 19:46:29,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:29,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266679466] [2022-03-15 19:46:29,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:29,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 21 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:29,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:29,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266679466] [2022-03-15 19:46:29,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266679466] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:29,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774518529] [2022-03-15 19:46:29,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:46:29,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:29,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:29,832 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:29,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-03-15 19:46:29,965 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:46:29,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:29,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:46:29,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:30,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:31,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774518529] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:31,119 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:31,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 77 [2022-03-15 19:46:31,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774570225] [2022-03-15 19:46:31,120 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:31,122 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:31,150 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 258 transitions. [2022-03-15 19:46:31,150 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:34,654 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 27 new interpolants: [306139#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 306157#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 306138#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 306158#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 306150#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 306136#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 306137#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 306151#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 306160#(and (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 306152#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 306140#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 306145#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 306135#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 306143#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 306142#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 306156#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 306159#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 306147#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 306149#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 306153#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 306141#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 306146#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 306144#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 306154#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 6 ~M1~0))) (or (<= 0 ~counter~0) (not (< 6 ~M1~0))) (or (<= ~counter~0 0) (not (< 6 ~M1~0)))), 306134#(and (or (<= 6 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 306155#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 4 ~counter~0))), 306148#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:46:34,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-03-15 19:46:34,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:34,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-03-15 19:46:34,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=9640, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 19:46:34,655 INFO L87 Difference]: Start difference. First operand 508 states and 1318 transitions. Second operand has 56 states, 55 states have (on average 2.981818181818182) internal successors, (164), 55 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:46:36,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:36,597 INFO L93 Difference]: Finished difference Result 1221 states and 2961 transitions. [2022-03-15 19:46:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 19:46:36,597 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.981818181818182) internal successors, (164), 55 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) Word has length 35 [2022-03-15 19:46:36,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:36,598 INFO L225 Difference]: With dead ends: 1221 [2022-03-15 19:46:36,599 INFO L226 Difference]: Without dead ends: 1160 [2022-03-15 19:46:36,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 88 SyntacticMatches, 5 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8530 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3317, Invalid=19635, Unknown=0, NotChecked=0, Total=22952 [2022-03-15 19:46:36,600 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 280 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:36,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 66 Invalid, 2227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:46:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2022-03-15 19:46:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 552. [2022-03-15 19:46:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 2.6388384754990923) internal successors, (1454), 551 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1454 transitions. [2022-03-15 19:46:36,606 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1454 transitions. Word has length 35 [2022-03-15 19:46:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:36,606 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 1454 transitions. [2022-03-15 19:46:36,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.981818181818182) internal successors, (164), 55 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:46:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1454 transitions. [2022-03-15 19:46:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:46:36,607 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:36,607 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:36,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:36,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2022-03-15 19:46:36,824 INFO L402 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:36,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:36,824 INFO L85 PathProgramCache]: Analyzing trace with hash 226212399, now seen corresponding path program 125 times [2022-03-15 19:46:36,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:36,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009600606] [2022-03-15 19:46:36,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:36,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 20 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:37,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:37,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009600606] [2022-03-15 19:46:37,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009600606] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:37,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922625757] [2022-03-15 19:46:37,220 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:46:37,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:37,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:37,221 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:37,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-03-15 19:46:37,353 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:46:37,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:37,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:46:37,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:37,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:38,527 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:38,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922625757] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:38,527 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:38,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 77 [2022-03-15 19:46:38,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1239332337] [2022-03-15 19:46:38,527 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:38,530 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:38,557 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 249 transitions. [2022-03-15 19:46:38,557 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:41,343 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [308866#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 308876#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 308868#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 308862#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 308863#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 308885#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 308874#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 308880#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 308884#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 308881#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 308864#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 308879#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 1 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 308877#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 308865#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 308871#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 308873#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 5 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 308870#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 308883#(and (or (not (< 5 ~M1~0)) (<= ~counter~0 0)) (or (not (< 5 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 5 ~M1~0)))), 308875#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 308861#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 308869#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 308882#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 308867#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 308872#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 4 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 308878#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 2 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:46:41,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-03-15 19:46:41,343 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:41,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-03-15 19:46:41,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=9281, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 19:46:41,345 INFO L87 Difference]: Start difference. First operand 552 states and 1454 transitions. Second operand has 54 states, 53 states have (on average 2.981132075471698) internal successors, (158), 53 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:43,171 INFO L93 Difference]: Finished difference Result 1395 states and 3413 transitions. [2022-03-15 19:46:43,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 19:46:43,171 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.981132075471698) internal successors, (158), 53 states have internal predecessors, (158), 0 states have call successors, (0), 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 35 [2022-03-15 19:46:43,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:43,172 INFO L225 Difference]: With dead ends: 1395 [2022-03-15 19:46:43,173 INFO L226 Difference]: Without dead ends: 1330 [2022-03-15 19:46:43,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8400 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3432, Invalid=19824, Unknown=0, NotChecked=0, Total=23256 [2022-03-15 19:46:43,174 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 284 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:43,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 41 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:46:43,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2022-03-15 19:46:43,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 606. [2022-03-15 19:46:43,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 2.6793388429752065) internal successors, (1621), 605 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:43,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1621 transitions. [2022-03-15 19:46:43,182 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1621 transitions. Word has length 35 [2022-03-15 19:46:43,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:43,182 INFO L470 AbstractCegarLoop]: Abstraction has 606 states and 1621 transitions. [2022-03-15 19:46:43,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.981132075471698) internal successors, (158), 53 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1621 transitions. [2022-03-15 19:46:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:46:43,197 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:43,197 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:43,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:43,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126,127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:43,417 INFO L402 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:43,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1625581225, now seen corresponding path program 126 times [2022-03-15 19:46:43,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:43,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929552486] [2022-03-15 19:46:43,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:43,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 21 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:43,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:43,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929552486] [2022-03-15 19:46:43,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929552486] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:43,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022294025] [2022-03-15 19:46:43,691 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:46:43,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:43,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:43,692 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:43,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-03-15 19:46:43,829 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:46:43,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:43,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 19:46:43,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:44,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:45,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022294025] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:45,546 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:45,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2022-03-15 19:46:45,546 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [768315492] [2022-03-15 19:46:45,547 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:45,549 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:45,575 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 240 transitions. [2022-03-15 19:46:45,575 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:48,250 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 23 new interpolants: [311891#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 311882#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 311890#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 311894#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 311884#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 311893#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 311889#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 311883#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 311898#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 4 ~M1~0))) (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 311892#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 311877#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 311887#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 311886#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 311896#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 311880#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 311899#(and (or (<= ~counter~0 0) (not (< 4 ~M1~0))) (or (<= 0 ~counter~0) (not (< 4 ~M1~0)))), 311885#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 311888#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 311895#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= 2 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 311897#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 311881#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 4 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 311878#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 311879#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:46:48,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-03-15 19:46:48,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:48,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-03-15 19:46:48,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=9435, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 19:46:48,251 INFO L87 Difference]: Start difference. First operand 606 states and 1621 transitions. Second operand has 52 states, 51 states have (on average 2.980392156862745) internal successors, (152), 51 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:51,319 INFO L93 Difference]: Finished difference Result 1571 states and 3872 transitions. [2022-03-15 19:46:51,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 19:46:51,320 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.980392156862745) internal successors, (152), 51 states have internal predecessors, (152), 0 states have call successors, (0), 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 35 [2022-03-15 19:46:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:51,322 INFO L225 Difference]: With dead ends: 1571 [2022-03-15 19:46:51,322 INFO L226 Difference]: Without dead ends: 1502 [2022-03-15 19:46:51,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8467 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3887, Invalid=20605, Unknown=0, NotChecked=0, Total=24492 [2022-03-15 19:46:51,324 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 237 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 2772 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:51,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 56 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2772 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 19:46:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-03-15 19:46:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 670. [2022-03-15 19:46:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 2.71898355754858) internal successors, (1819), 669 states have internal predecessors, (1819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1819 transitions. [2022-03-15 19:46:51,333 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1819 transitions. Word has length 35 [2022-03-15 19:46:51,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:51,333 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 1819 transitions. [2022-03-15 19:46:51,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.980392156862745) internal successors, (152), 51 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1819 transitions. [2022-03-15 19:46:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:46:51,334 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:51,334 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:51,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:51,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:51,536 INFO L402 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1098358575, now seen corresponding path program 127 times [2022-03-15 19:46:51,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:51,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038874296] [2022-03-15 19:46:51,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:51,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 24 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:51,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:51,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038874296] [2022-03-15 19:46:51,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038874296] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:51,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798755883] [2022-03-15 19:46:51,880 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:46:51,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:51,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:51,882 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:51,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-03-15 19:46:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:52,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:46:52,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:52,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:46:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:53,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798755883] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:46:53,710 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:46:53,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 77 [2022-03-15 19:46:53,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [724551363] [2022-03-15 19:46:53,710 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:46:53,713 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:46:53,739 INFO L252 McrAutomatonBuilder]: Finished intersection with 126 states and 231 transitions. [2022-03-15 19:46:53,739 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:46:56,263 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [315207#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 315208#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 315209#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 315206#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 315213#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 315205#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 315199#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 315201#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 315202#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 315198#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 315212#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 315216#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 315214#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 315218#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0))), 315211#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 315203#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= 3 ~counter~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 315200#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 315210#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 315215#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 315204#(and (or (<= 2 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 315217#(and (or (not (< 3 ~M1~0)) (<= 0 ~counter~0)) (or (not (< 3 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< 3 ~M1~0)) (<= ~counter~0 0)))] [2022-03-15 19:46:56,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-03-15 19:46:56,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:46:56,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-03-15 19:46:56,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=8536, Unknown=0, NotChecked=0, Total=9900 [2022-03-15 19:46:56,264 INFO L87 Difference]: Start difference. First operand 670 states and 1819 transitions. Second operand has 50 states, 49 states have (on average 2.979591836734694) internal successors, (146), 49 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:46:58,374 INFO L93 Difference]: Finished difference Result 1749 states and 4338 transitions. [2022-03-15 19:46:58,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-03-15 19:46:58,374 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.979591836734694) internal successors, (146), 49 states have internal predecessors, (146), 0 states have call successors, (0), 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 35 [2022-03-15 19:46:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:46:58,377 INFO L225 Difference]: With dead ends: 1749 [2022-03-15 19:46:58,377 INFO L226 Difference]: Without dead ends: 1676 [2022-03-15 19:46:58,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8137 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3731, Invalid=20139, Unknown=0, NotChecked=0, Total=23870 [2022-03-15 19:46:58,379 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 242 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:46:58,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 48 Invalid, 2408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:46:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2022-03-15 19:46:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 744. [2022-03-15 19:46:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 743 states have (on average 2.756393001345895) internal successors, (2048), 743 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 2048 transitions. [2022-03-15 19:46:58,391 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 2048 transitions. Word has length 35 [2022-03-15 19:46:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:46:58,391 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 2048 transitions. [2022-03-15 19:46:58,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.979591836734694) internal successors, (146), 49 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:46:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 2048 transitions. [2022-03-15 19:46:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:46:58,392 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:46:58,392 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:46:58,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Forceful destruction successful, exit code 0 [2022-03-15 19:46:58,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2022-03-15 19:46:58,607 INFO L402 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:46:58,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:46:58,608 INFO L85 PathProgramCache]: Analyzing trace with hash -358853545, now seen corresponding path program 128 times [2022-03-15 19:46:58,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:46:58,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242907606] [2022-03-15 19:46:58,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:46:58,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:46:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:46:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 29 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:58,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:46:58,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242907606] [2022-03-15 19:46:58,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242907606] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:46:58,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125952215] [2022-03-15 19:46:58,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:46:58,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:46:58,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:46:58,864 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:46:58,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2022-03-15 19:46:58,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:46:58,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:46:58,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:46:59,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:46:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:46:59,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:00,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125952215] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:00,204 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:00,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 77 [2022-03-15 19:47:00,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [96039994] [2022-03-15 19:47:00,204 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:00,207 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:00,232 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 222 transitions. [2022-03-15 19:47:00,232 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:02,445 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [318866#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 318850#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 318867#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 318861#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 318853#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 318863#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 318865#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 318851#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 318856#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 318864#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 318858#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 318860#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 318852#(and (or (<= ~counter~0 0) (not (< 2 ~M1~0))) (or (not (< 2 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< 2 ~M1~0)))), 318859#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 318855#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 318854#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 1 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 318862#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 318849#(and (or (<= 2 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 318857#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)))] [2022-03-15 19:47:02,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-03-15 19:47:02,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:02,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-03-15 19:47:02,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1356, Invalid=8150, Unknown=0, NotChecked=0, Total=9506 [2022-03-15 19:47:02,446 INFO L87 Difference]: Start difference. First operand 744 states and 2048 transitions. Second operand has 48 states, 47 states have (on average 2.978723404255319) internal successors, (140), 47 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:04,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:04,699 INFO L93 Difference]: Finished difference Result 1929 states and 4811 transitions. [2022-03-15 19:47:04,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-03-15 19:47:04,699 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.978723404255319) internal successors, (140), 47 states have internal predecessors, (140), 0 states have call successors, (0), 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 35 [2022-03-15 19:47:04,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:04,702 INFO L225 Difference]: With dead ends: 1929 [2022-03-15 19:47:04,702 INFO L226 Difference]: Without dead ends: 1852 [2022-03-15 19:47:04,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8162 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3915, Invalid=20265, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 19:47:04,704 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 246 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:04,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 30 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:47:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2022-03-15 19:47:04,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 828. [2022-03-15 19:47:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 2.7908101571946795) internal successors, (2308), 827 states have internal predecessors, (2308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 2308 transitions. [2022-03-15 19:47:04,715 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 2308 transitions. Word has length 35 [2022-03-15 19:47:04,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:04,715 INFO L470 AbstractCegarLoop]: Abstraction has 828 states and 2308 transitions. [2022-03-15 19:47:04,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.978723404255319) internal successors, (140), 47 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 2308 transitions. [2022-03-15 19:47:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:47:04,716 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:04,717 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:04,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Ended with exit code 0 [2022-03-15 19:47:04,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2022-03-15 19:47:04,934 INFO L402 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:04,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:04,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1712210991, now seen corresponding path program 129 times [2022-03-15 19:47:04,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:04,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139205606] [2022-03-15 19:47:04,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:04,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:05,190 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:05,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:05,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139205606] [2022-03-15 19:47:05,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139205606] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:05,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164181438] [2022-03-15 19:47:05,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:47:05,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:05,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:05,191 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:05,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2022-03-15 19:47:05,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:47:05,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:05,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:47:05,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:05,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:06,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164181438] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:06,581 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:06,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 77 [2022-03-15 19:47:06,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2007188829] [2022-03-15 19:47:06,581 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:06,584 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:06,608 INFO L252 McrAutomatonBuilder]: Finished intersection with 118 states and 213 transitions. [2022-03-15 19:47:06,608 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:08,752 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [322854#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 322861#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 322856#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 322858#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 322863#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 322855#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 322857#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 322860#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 322852#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 322862#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 322865#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 322866#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 322859#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 322867#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 322868#(and (or (<= ~counter~0 0) (not (< 1 ~M1~0))) (or (<= 0 ~counter~0) (not (< 1 ~M1~0)))), 322864#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 322853#(and (or (<= 1 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:47:08,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 19:47:08,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:08,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 19:47:08,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1365, Invalid=7755, Unknown=0, NotChecked=0, Total=9120 [2022-03-15 19:47:08,756 INFO L87 Difference]: Start difference. First operand 828 states and 2308 transitions. Second operand has 46 states, 45 states have (on average 2.977777777777778) internal successors, (134), 45 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:11,990 INFO L93 Difference]: Finished difference Result 2111 states and 5291 transitions. [2022-03-15 19:47:11,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-03-15 19:47:11,991 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.977777777777778) internal successors, (134), 45 states have internal predecessors, (134), 0 states have call successors, (0), 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 35 [2022-03-15 19:47:11,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:11,994 INFO L225 Difference]: With dead ends: 2111 [2022-03-15 19:47:11,994 INFO L226 Difference]: Without dead ends: 2030 [2022-03-15 19:47:11,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8007 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4122, Invalid=20370, Unknown=0, NotChecked=0, Total=24492 [2022-03-15 19:47:11,995 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 235 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:11,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 34 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:47:11,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2022-03-15 19:47:12,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 884. [2022-03-15 19:47:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 2.813137032842582) internal successors, (2484), 883 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:12,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 2484 transitions. [2022-03-15 19:47:12,008 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 2484 transitions. Word has length 35 [2022-03-15 19:47:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:12,008 INFO L470 AbstractCegarLoop]: Abstraction has 884 states and 2484 transitions. [2022-03-15 19:47:12,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.977777777777778) internal successors, (134), 45 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 2484 transitions. [2022-03-15 19:47:12,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-03-15 19:47:12,009 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:12,009 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:12,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:12,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:12,215 INFO L402 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:12,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:12,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1490702167, now seen corresponding path program 130 times [2022-03-15 19:47:12,216 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:12,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395962013] [2022-03-15 19:47:12,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:12,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:12,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:12,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395962013] [2022-03-15 19:47:12,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395962013] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:12,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746455793] [2022-03-15 19:47:12,609 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:47:12,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:12,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:12,610 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:12,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2022-03-15 19:47:12,753 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:47:12,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:12,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:47:12,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:13,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:14,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746455793] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:14,664 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:14,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 77 [2022-03-15 19:47:14,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1664748285] [2022-03-15 19:47:14,664 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:14,667 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:14,693 INFO L252 McrAutomatonBuilder]: Finished intersection with 114 states and 204 transitions. [2022-03-15 19:47:14,693 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:16,670 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [327162#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 327155#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 327167#(and (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 327161#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 327163#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 327153#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 327159#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 327154#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 327158#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 327165#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 327166#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 0 ~M1~0))) (or (<= 0 ~counter~0) (not (< 0 ~M1~0))) (or (<= ~counter~0 0) (not (< 0 ~M1~0)))), 327160#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 327156#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 327157#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 327164#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= 0 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)))] [2022-03-15 19:47:16,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 19:47:16,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:16,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 19:47:16,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1386, Invalid=7356, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 19:47:16,671 INFO L87 Difference]: Start difference. First operand 884 states and 2484 transitions. Second operand has 44 states, 43 states have (on average 2.9767441860465116) internal successors, (128), 43 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:19,198 INFO L93 Difference]: Finished difference Result 2919 states and 7288 transitions. [2022-03-15 19:47:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-03-15 19:47:19,198 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.9767441860465116) internal successors, (128), 43 states have internal predecessors, (128), 0 states have call successors, (0), 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 35 [2022-03-15 19:47:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:19,202 INFO L225 Difference]: With dead ends: 2919 [2022-03-15 19:47:19,202 INFO L226 Difference]: Without dead ends: 2838 [2022-03-15 19:47:19,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8412 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4420, Invalid=21340, Unknown=0, NotChecked=0, Total=25760 [2022-03-15 19:47:19,204 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 246 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:19,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 19 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:47:19,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2022-03-15 19:47:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 1108. [2022-03-15 19:47:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1107 states have (on average 2.888888888888889) internal successors, (3198), 1107 states have internal predecessors, (3198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 3198 transitions. [2022-03-15 19:47:19,223 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 3198 transitions. Word has length 35 [2022-03-15 19:47:19,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:19,225 INFO L470 AbstractCegarLoop]: Abstraction has 1108 states and 3198 transitions. [2022-03-15 19:47:19,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.9767441860465116) internal successors, (128), 43 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 3198 transitions. [2022-03-15 19:47:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:47:19,226 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:19,226 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:19,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:19,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,132 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:19,443 INFO L402 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:19,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:19,444 INFO L85 PathProgramCache]: Analyzing trace with hash 199180228, now seen corresponding path program 131 times [2022-03-15 19:47:19,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:19,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628677056] [2022-03-15 19:47:19,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:19,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:19,544 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:19,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628677056] [2022-03-15 19:47:19,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628677056] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:19,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906276295] [2022-03-15 19:47:19,545 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:47:19,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:19,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:19,546 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:19,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2022-03-15 19:47:19,683 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:47:19,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:19,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 38 conjunts are in the unsatisfiable core [2022-03-15 19:47:19,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:19,756 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:19,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:19,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906276295] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:19,987 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:19,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 26 [2022-03-15 19:47:19,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [986904000] [2022-03-15 19:47:19,987 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:19,990 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:20,032 INFO L252 McrAutomatonBuilder]: Finished intersection with 170 states and 328 transitions. [2022-03-15 19:47:20,032 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:21,371 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:47:21,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:47:21,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:21,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:47:21,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2022-03-15 19:47:21,372 INFO L87 Difference]: Start difference. First operand 1108 states and 3198 transitions. Second operand has 16 states, 16 states have (on average 7.625) internal successors, (122), 15 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:21,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:21,940 INFO L93 Difference]: Finished difference Result 1966 states and 5768 transitions. [2022-03-15 19:47:21,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 19:47:21,940 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.625) internal successors, (122), 15 states have internal predecessors, (122), 0 states have call successors, (0), 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 36 [2022-03-15 19:47:21,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:21,943 INFO L225 Difference]: With dead ends: 1966 [2022-03-15 19:47:21,943 INFO L226 Difference]: Without dead ends: 1860 [2022-03-15 19:47:21,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 191 SyntacticMatches, 12 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=321, Invalid=1161, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:47:21,943 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:21,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 169 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2288 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:47:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-03-15 19:47:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1560. [2022-03-15 19:47:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1559 states have (on average 2.937139191789609) internal successors, (4579), 1559 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 4579 transitions. [2022-03-15 19:47:21,960 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 4579 transitions. Word has length 36 [2022-03-15 19:47:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:21,960 INFO L470 AbstractCegarLoop]: Abstraction has 1560 states and 4579 transitions. [2022-03-15 19:47:21,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.625) internal successors, (122), 15 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:21,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 4579 transitions. [2022-03-15 19:47:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-03-15 19:47:21,962 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:21,962 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:21,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:22,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable132 [2022-03-15 19:47:22,179 INFO L402 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:22,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:22,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2145337877, now seen corresponding path program 132 times [2022-03-15 19:47:22,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:22,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94948457] [2022-03-15 19:47:22,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:22,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:22,478 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 55 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:22,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:22,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94948457] [2022-03-15 19:47:22,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94948457] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:22,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804254148] [2022-03-15 19:47:22,478 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:47:22,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:22,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:22,479 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:22,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2022-03-15 19:47:22,635 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:47:22,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:47:22,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 19:47:22,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:23,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 55 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:23,901 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804254148] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:23,901 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:23,901 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 80 [2022-03-15 19:47:23,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [969076487] [2022-03-15 19:47:23,901 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:23,904 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:23,940 INFO L252 McrAutomatonBuilder]: Finished intersection with 170 states and 328 transitions. [2022-03-15 19:47:23,940 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:28,622 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 54 new interpolants: [338122#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= ~M1~0 (+ ~counter~0 11)) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= (+ ~counter~0 11) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 338108#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0))), 338127#(and (or (< 12 ~M1~0) (<= (+ ~counter~0 12) ~M1~0) (not (< 11 ~M1~0))) (or (< 12 ~M1~0) (<= ~M1~0 (+ ~counter~0 12)) (not (< 11 ~M1~0)))), 338094#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 6 ~counter~0) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 338086#(and (or (<= 10 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 338114#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 9 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 338115#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 8 ~counter~0)), 338077#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 338079#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 338107#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0))), 338126#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0)) (<= ~M1~0 (+ ~counter~0 12)) (< (+ thread1Thread1of1ForFork0_~i~0 12) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0)) (<= (+ ~counter~0 12) ~M1~0) (< (+ thread1Thread1of1ForFork0_~i~0 12) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0)) (<= 0 ~counter~0) (< (+ thread1Thread1of1ForFork0_~i~0 12) ~M1~0))), 338095#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 5 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 338080#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 338119#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 4 ~counter~0)), 338121#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 2 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 338103#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 7 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 338096#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 4 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 338099#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (<= 11 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 338116#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 7 ~counter~0)), 338102#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0)) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 338101#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 9 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3)))), 338083#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 338117#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 6 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 338098#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 12 ~counter~0))), 338097#(and (<= ~M1~0 ~counter~0) (<= 12 ~counter~0) (<= ~counter~0 ~M1~0)), 338088#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 12 ~counter~0))), 338084#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 338082#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 338093#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 7 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 338124#(and (or (< 12 ~M1~0) (<= (+ ~counter~0 12) ~M1~0) (not (< 11 ~M1~0))) (or (< 12 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< 11 ~M1~0))) (or (< 12 ~M1~0) (<= ~M1~0 (+ ~counter~0 12)) (not (< 11 ~M1~0)))), 338112#(and (<= 11 ~counter~0) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 338076#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 338100#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 10 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))), 338123#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ thread1Thread1of1ForFork0_~i~0 12) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0)) (<= ~M1~0 (+ ~counter~0 12)) (< (+ thread1Thread1of1ForFork0_~i~0 12) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0)) (<= (+ ~counter~0 12) ~M1~0) (< (+ thread1Thread1of1ForFork0_~i~0 12) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0)) (<= 0 ~counter~0) (< (+ thread1Thread1of1ForFork0_~i~0 12) ~M1~0))), 338106#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 4 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 338092#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0)) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 338104#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 6 ~counter~0) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 338078#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 338105#(and (or (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 5 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 338091#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 9 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 338120#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 3 ~counter~0)), 338090#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 10 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 338129#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 1 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 338089#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (<= 11 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 338085#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 338113#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= 10 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)), 338109#(and (or (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 10)) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))), 338110#(and (or (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 10)) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))), 338125#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= ~M1~0 (+ ~counter~0 11)) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= (+ ~counter~0 11) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 338111#(and (<= 12 ~counter~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= ~counter~0 ~M1~0)), 338087#(and (or (<= 11 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 338118#(and (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (<= 5 ~counter~0)), 338081#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 338128#(and (= thread2Thread1of1ForFork1_~i~1 0) (= ~counter~0 0))] [2022-03-15 19:47:28,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-03-15 19:47:28,623 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:28,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-03-15 19:47:28,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2324, Invalid=16036, Unknown=0, NotChecked=0, Total=18360 [2022-03-15 19:47:28,624 INFO L87 Difference]: Start difference. First operand 1560 states and 4579 transitions. Second operand has 84 states, 83 states have (on average 2.8674698795180724) internal successors, (238), 83 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:47:37,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:47:37,298 INFO L93 Difference]: Finished difference Result 2256 states and 6267 transitions. [2022-03-15 19:47:37,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-03-15 19:47:37,298 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 83 states have (on average 2.8674698795180724) internal successors, (238), 83 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 36 [2022-03-15 19:47:37,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:47:37,301 INFO L225 Difference]: With dead ends: 2256 [2022-03-15 19:47:37,301 INFO L226 Difference]: Without dead ends: 2246 [2022-03-15 19:47:37,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 90 SyntacticMatches, 7 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15907 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=5433, Invalid=34767, Unknown=0, NotChecked=0, Total=40200 [2022-03-15 19:47:37,303 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 623 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 5125 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 5440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 5125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:47:37,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [623 Valid, 149 Invalid, 5440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 5125 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 19:47:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2022-03-15 19:47:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 1510. [2022-03-15 19:47:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1510 states, 1509 states have (on average 2.9476474486414843) internal successors, (4448), 1509 states have internal predecessors, (4448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:47:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 4448 transitions. [2022-03-15 19:47:37,321 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 4448 transitions. Word has length 36 [2022-03-15 19:47:37,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:47:37,321 INFO L470 AbstractCegarLoop]: Abstraction has 1510 states and 4448 transitions. [2022-03-15 19:47:37,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 83 states have (on average 2.8674698795180724) internal successors, (238), 83 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:47:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 4448 transitions. [2022-03-15 19:47:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:47:37,323 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:47:37,323 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:47:37,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Forceful destruction successful, exit code 0 [2022-03-15 19:47:37,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 134 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2022-03-15 19:47:37,540 INFO L402 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:47:37,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:47:37,540 INFO L85 PathProgramCache]: Analyzing trace with hash 902332520, now seen corresponding path program 133 times [2022-03-15 19:47:37,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:47:37,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276473700] [2022-03-15 19:47:37,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:47:37,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:47:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 55 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:37,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:47:37,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276473700] [2022-03-15 19:47:37,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276473700] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:47:37,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498663797] [2022-03-15 19:47:37,867 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:47:37,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:47:37,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:47:37,868 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:47:37,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2022-03-15 19:47:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:47:38,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 19:47:38,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:47:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:38,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:47:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 66 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:47:39,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498663797] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:47:39,297 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:47:39,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 84 [2022-03-15 19:47:39,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1178955692] [2022-03-15 19:47:39,297 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:47:39,300 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:47:39,339 INFO L252 McrAutomatonBuilder]: Finished intersection with 176 states and 340 transitions. [2022-03-15 19:47:39,340 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:47:44,337 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 41 new interpolants: [343867#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 4 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 343868#(and (or (<= ~M1~0 (+ ~counter~0 8)) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= (+ ~counter~0 8) ~M1~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (or (<= 4 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0))), 343869#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0))), 343870#(and (or (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 10)) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))), 343838#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 343848#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 343875#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ thread1Thread1of1ForFork0_~i~0 12) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0)) (<= ~M1~0 (+ ~counter~0 12)) (< (+ thread1Thread1of1ForFork0_~i~0 12) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0)) (<= (+ ~counter~0 12) ~M1~0) (< (+ thread1Thread1of1ForFork0_~i~0 12) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0)) (<= 0 ~counter~0) (< (+ thread1Thread1of1ForFork0_~i~0 12) ~M1~0))), 343878#(and (or (< 12 ~M1~0) (<= (+ ~counter~0 12) ~M1~0) (not (< 11 ~M1~0))) (or (< 12 ~M1~0) (<= ~M1~0 (+ ~counter~0 12)) (not (< 11 ~M1~0)))), 343857#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 6 ~counter~0) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 343840#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 343871#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= ~M1~0 (+ ~counter~0 11)) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= (+ ~counter~0 11) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 343844#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 343841#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 343855#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0)) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 343858#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 5 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 343876#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0)) (<= ~M1~0 (+ ~counter~0 12)) (< (+ thread1Thread1of1ForFork0_~i~0 12) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0)) (<= (+ ~counter~0 12) ~M1~0) (< (+ thread1Thread1of1ForFork0_~i~0 12) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0)) (<= 0 ~counter~0) (< (+ thread1Thread1of1ForFork0_~i~0 12) ~M1~0))), 343842#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 343847#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 343856#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 7 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 343860#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (<= 11 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 343851#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 12 ~counter~0))), 343843#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 343861#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 10 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)))), 343862#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 9 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3)))), 343845#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 343854#(and (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 9 ~counter~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 3) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= ~M1~0 (+ ~counter~0 3))) (or (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 343839#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 343864#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= ~M1~0 (+ ~counter~0 5)) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= (+ ~counter~0 5) ~M1~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 7 ~counter~0) (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))), 343866#(and (or (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 5 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~M1~0 (+ ~counter~0 7)) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= (+ ~counter~0 7) ~M1~0) (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 343877#(and (or (< 12 ~M1~0) (<= (+ ~counter~0 12) ~M1~0) (not (< 11 ~M1~0))) (or (< 12 ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0) (not (< 11 ~M1~0))) (or (< 12 ~M1~0) (<= ~M1~0 (+ ~counter~0 12)) (not (< 11 ~M1~0)))), 343850#(and (or (<= 11 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 343859#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~M1~0 ~counter~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= ~counter~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 12 ~counter~0))), 343874#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= ~M1~0 (+ ~counter~0 11)) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= (+ ~counter~0 11) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 11) ~M1~0) (<= 1 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 343852#(and (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (<= (+ ~counter~0 1) ~M1~0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0) (= thread2Thread1of1ForFork1_~i~1 0)) (or (<= ~M1~0 (+ ~counter~0 1)) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (or (<= 11 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))), 343873#(and (or (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0) (<= (+ ~counter~0 10) ~M1~0)) (or (<= 2 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 10)) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))), 343849#(and (or (<= 10 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 343872#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= ~M1~0 (+ ~counter~0 9))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= 3 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 9) ~M1~0))), 343846#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 343853#(and (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= 10 ~counter~0)) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= (+ ~counter~0 2) ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 2)) (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 343865#(and (or (<= ~M1~0 (+ ~counter~0 6)) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 6 ~counter~0) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0) (<= (+ ~counter~0 6) ~M1~0))), 343863#(and (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= (+ ~counter~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0)) (or (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0) (<= ~M1~0 (+ ~counter~0 4)) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:47:44,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-03-15 19:47:44,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:47:44,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-03-15 19:47:44,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1945, Invalid=14057, Unknown=0, NotChecked=0, Total=16002 [2022-03-15 19:47:44,338 INFO L87 Difference]: Start difference. First operand 1510 states and 4448 transitions. Second operand has 72 states, 71 states have (on average 3.0422535211267605) internal successors, (216), 71 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:06,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:06,243 INFO L93 Difference]: Finished difference Result 2136 states and 5954 transitions. [2022-03-15 19:48:06,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2022-03-15 19:48:06,243 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 3.0422535211267605) internal successors, (216), 71 states have internal predecessors, (216), 0 states have call successors, (0), 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 37 [2022-03-15 19:48:06,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:06,247 INFO L225 Difference]: With dead ends: 2136 [2022-03-15 19:48:06,247 INFO L226 Difference]: Without dead ends: 2122 [2022-03-15 19:48:06,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 107 SyntacticMatches, 7 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28121 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=11490, Invalid=72320, Unknown=0, NotChecked=0, Total=83810 [2022-03-15 19:48:06,250 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 467 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 4273 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 4580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 4273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:06,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 200 Invalid, 4580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 4273 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 19:48:06,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2022-03-15 19:48:06,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1604. [2022-03-15 19:48:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1603 states have (on average 2.9482220835932624) internal successors, (4726), 1603 states have internal predecessors, (4726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 4726 transitions. [2022-03-15 19:48:06,269 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 4726 transitions. Word has length 37 [2022-03-15 19:48:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:06,269 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 4726 transitions. [2022-03-15 19:48:06,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 3.0422535211267605) internal successors, (216), 71 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 4726 transitions. [2022-03-15 19:48:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:48:06,271 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:06,271 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:06,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Ended with exit code 0 [2022-03-15 19:48:06,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 135 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2022-03-15 19:48:06,488 INFO L402 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:06,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:06,488 INFO L85 PathProgramCache]: Analyzing trace with hash 709875510, now seen corresponding path program 134 times [2022-03-15 19:48:06,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:06,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937537828] [2022-03-15 19:48:06,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:06,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 45 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:06,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:06,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937537828] [2022-03-15 19:48:06,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937537828] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:06,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65898657] [2022-03-15 19:48:06,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:48:06,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:06,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:06,907 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:06,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2022-03-15 19:48:07,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:48:07,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:07,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 19:48:07,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:07,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 55 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:08,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65898657] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:08,743 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:08,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 84 [2022-03-15 19:48:08,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365586725] [2022-03-15 19:48:08,743 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:08,746 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:08,782 INFO L252 McrAutomatonBuilder]: Finished intersection with 162 states and 309 transitions. [2022-03-15 19:48:08,782 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:13,477 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [349869#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 349871#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 349859#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 349851#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 349876#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 349866#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 349852#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 349853#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 349875#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 349867#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 349881#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 349864#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 349861#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 349874#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 10 ~M1~0))) (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 349884#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 349854#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 349882#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 349872#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 349863#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 349857#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 349860#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 349885#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 349862#(and (or (<= 10 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 349868#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 349883#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 349878#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 349870#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 349886#(and (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 349856#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 349873#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 349880#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 349858#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 349879#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 349877#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 349855#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 349865#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0)))] [2022-03-15 19:48:13,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-15 19:48:13,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:13,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-15 19:48:13,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2098, Invalid=12664, Unknown=0, NotChecked=0, Total=14762 [2022-03-15 19:48:13,479 INFO L87 Difference]: Start difference. First operand 1604 states and 4726 transitions. Second operand has 67 states, 66 states have (on average 2.984848484848485) internal successors, (197), 66 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:15,493 INFO L93 Difference]: Finished difference Result 2203 states and 6216 transitions. [2022-03-15 19:48:15,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-03-15 19:48:15,493 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.984848484848485) internal successors, (197), 66 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-03-15 19:48:15,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:15,496 INFO L225 Difference]: With dead ends: 2203 [2022-03-15 19:48:15,496 INFO L226 Difference]: Without dead ends: 2150 [2022-03-15 19:48:15,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 100 SyntacticMatches, 5 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10432 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3777, Invalid=22629, Unknown=0, NotChecked=0, Total=26406 [2022-03-15 19:48:15,498 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 268 mSDsluCounter, 1309 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:15,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 123 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:48:15,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2022-03-15 19:48:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1786. [2022-03-15 19:48:15,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1785 states have (on average 2.9450980392156865) internal successors, (5257), 1785 states have internal predecessors, (5257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 5257 transitions. [2022-03-15 19:48:15,517 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 5257 transitions. Word has length 37 [2022-03-15 19:48:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:15,517 INFO L470 AbstractCegarLoop]: Abstraction has 1786 states and 5257 transitions. [2022-03-15 19:48:15,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.984848484848485) internal successors, (197), 66 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 5257 transitions. [2022-03-15 19:48:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:48:15,519 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:15,519 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:15,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Ended with exit code 0 [2022-03-15 19:48:15,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 136 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2022-03-15 19:48:15,736 INFO L402 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:15,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:15,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1997998360, now seen corresponding path program 135 times [2022-03-15 19:48:15,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:15,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180395972] [2022-03-15 19:48:15,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:15,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 45 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:16,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:16,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180395972] [2022-03-15 19:48:16,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180395972] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:16,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107715350] [2022-03-15 19:48:16,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:48:16,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:16,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:16,034 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:16,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2022-03-15 19:48:16,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:48:16,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:16,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 19:48:16,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:16,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 46 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:17,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107715350] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:17,680 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:17,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 84 [2022-03-15 19:48:17,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [574070704] [2022-03-15 19:48:17,680 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:17,683 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:17,718 INFO L252 McrAutomatonBuilder]: Finished intersection with 158 states and 300 transitions. [2022-03-15 19:48:17,718 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:21,510 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [356073#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 356058#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 356076#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 356065#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 356048#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 356080#(and (or (<= 9 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 356046#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 356062#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 356051#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 356054#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 356049#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 356070#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 356064#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 356071#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 356059#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 356079#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 356060#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 356074#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 10 ~M1~0))) (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 356047#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 356078#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 356063#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 356069#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 356055#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 356072#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 356057#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 356056#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 356067#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 356068#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 356077#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 356053#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 356075#(and (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 356050#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 356066#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 356052#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 356061#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))] [2022-03-15 19:48:21,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-15 19:48:21,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:21,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-15 19:48:21,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2012, Invalid=12508, Unknown=0, NotChecked=0, Total=14520 [2022-03-15 19:48:21,511 INFO L87 Difference]: Start difference. First operand 1786 states and 5257 transitions. Second operand has 66 states, 65 states have (on average 2.953846153846154) internal successors, (192), 65 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:23,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:23,914 INFO L93 Difference]: Finished difference Result 2827 states and 8093 transitions. [2022-03-15 19:48:23,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 19:48:23,915 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 2.953846153846154) internal successors, (192), 65 states have internal predecessors, (192), 0 states have call successors, (0), 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 37 [2022-03-15 19:48:23,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:23,919 INFO L225 Difference]: With dead ends: 2827 [2022-03-15 19:48:23,919 INFO L226 Difference]: Without dead ends: 2778 [2022-03-15 19:48:23,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10408 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3877, Invalid=23183, Unknown=0, NotChecked=0, Total=27060 [2022-03-15 19:48:23,922 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 246 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 2133 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:23,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 81 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2133 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:48:23,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2022-03-15 19:48:23,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 1948. [2022-03-15 19:48:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1947 states have (on average 2.9820236260914226) internal successors, (5806), 1947 states have internal predecessors, (5806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 5806 transitions. [2022-03-15 19:48:23,958 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 5806 transitions. Word has length 37 [2022-03-15 19:48:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:23,958 INFO L470 AbstractCegarLoop]: Abstraction has 1948 states and 5806 transitions. [2022-03-15 19:48:23,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 2.953846153846154) internal successors, (192), 65 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 5806 transitions. [2022-03-15 19:48:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:48:23,961 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:23,961 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:23,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Ended with exit code 0 [2022-03-15 19:48:24,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 137 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2022-03-15 19:48:24,178 INFO L402 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:24,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:24,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2085349130, now seen corresponding path program 136 times [2022-03-15 19:48:24,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:24,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657791903] [2022-03-15 19:48:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:24,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 45 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:24,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:24,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657791903] [2022-03-15 19:48:24,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657791903] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:24,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122080733] [2022-03-15 19:48:24,606 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:48:24,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:24,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:24,607 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:24,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2022-03-15 19:48:24,750 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:48:24,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:24,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 19:48:24,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:25,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 39 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:26,672 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122080733] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:26,672 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:26,672 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 84 [2022-03-15 19:48:26,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1083437696] [2022-03-15 19:48:26,672 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:26,675 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:26,711 INFO L252 McrAutomatonBuilder]: Finished intersection with 154 states and 291 transitions. [2022-03-15 19:48:26,711 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:31,071 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 34 new interpolants: [363209#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 363227#(and (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 363226#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 10 ~M1~0))) (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 363221#(and (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 8 ~counter~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 363225#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 363194#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 363202#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 363200#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 363207#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 363198#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 363211#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 363212#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 363223#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 363195#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 363196#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 363210#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 363199#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 363222#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 363215#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 363205#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 363201#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 363208#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 363218#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 363214#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 363216#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 363217#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 363197#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 363206#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 363213#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 363220#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 363219#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 363203#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 363224#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 363204#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)))] [2022-03-15 19:48:31,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-03-15 19:48:31,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:31,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-03-15 19:48:31,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1941, Invalid=12339, Unknown=0, NotChecked=0, Total=14280 [2022-03-15 19:48:31,073 INFO L87 Difference]: Start difference. First operand 1948 states and 5806 transitions. Second operand has 65 states, 64 states have (on average 2.921875) internal successors, (187), 64 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:33,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:33,135 INFO L93 Difference]: Finished difference Result 3069 states and 8859 transitions. [2022-03-15 19:48:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-03-15 19:48:33,135 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.921875) internal successors, (187), 64 states have internal predecessors, (187), 0 states have call successors, (0), 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 37 [2022-03-15 19:48:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:33,140 INFO L225 Difference]: With dead ends: 3069 [2022-03-15 19:48:33,140 INFO L226 Difference]: Without dead ends: 3016 [2022-03-15 19:48:33,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 93 SyntacticMatches, 6 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10728 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4087, Invalid=24305, Unknown=0, NotChecked=0, Total=28392 [2022-03-15 19:48:33,142 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 295 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:33,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 97 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:48:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2022-03-15 19:48:33,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 1918. [2022-03-15 19:48:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1918 states, 1917 states have (on average 2.9739175795513826) internal successors, (5701), 1917 states have internal predecessors, (5701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1918 states to 1918 states and 5701 transitions. [2022-03-15 19:48:33,167 INFO L78 Accepts]: Start accepts. Automaton has 1918 states and 5701 transitions. Word has length 37 [2022-03-15 19:48:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:33,167 INFO L470 AbstractCegarLoop]: Abstraction has 1918 states and 5701 transitions. [2022-03-15 19:48:33,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.921875) internal successors, (187), 64 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1918 states and 5701 transitions. [2022-03-15 19:48:33,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:48:33,170 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:33,170 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:33,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Forceful destruction successful, exit code 0 [2022-03-15 19:48:33,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable137 [2022-03-15 19:48:33,386 INFO L402 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:33,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1256882904, now seen corresponding path program 137 times [2022-03-15 19:48:33,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:33,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256074113] [2022-03-15 19:48:33,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:33,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:33,690 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 45 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:33,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:33,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256074113] [2022-03-15 19:48:33,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256074113] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:33,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128034423] [2022-03-15 19:48:33,690 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:48:33,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:33,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:33,691 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:33,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2022-03-15 19:48:33,837 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-03-15 19:48:33,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:33,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 19:48:33,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:34,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 34 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:35,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128034423] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:35,702 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:35,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 84 [2022-03-15 19:48:35,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [323405897] [2022-03-15 19:48:35,702 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:35,705 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:35,739 INFO L252 McrAutomatonBuilder]: Finished intersection with 150 states and 282 transitions. [2022-03-15 19:48:35,739 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:39,455 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [370548#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 370536#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 370553#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 370539#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 370535#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 370560#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 370543#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 370546#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 370550#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 370551#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 370542#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 370556#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 370538#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 370534#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 370555#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 10 ~M1~0))) (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 370564#(and (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 370533#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 370557#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 370547#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 370537#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 370554#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 370565#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 7 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 370541#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 370549#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 370544#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 370561#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 370545#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 370558#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 370552#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 370563#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 370540#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 370559#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 370562#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))))] [2022-03-15 19:48:39,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-03-15 19:48:39,456 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:39,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-03-15 19:48:39,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1885, Invalid=12157, Unknown=0, NotChecked=0, Total=14042 [2022-03-15 19:48:39,456 INFO L87 Difference]: Start difference. First operand 1918 states and 5701 transitions. Second operand has 64 states, 63 states have (on average 2.888888888888889) internal successors, (182), 63 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:42,591 INFO L93 Difference]: Finished difference Result 3145 states and 9044 transitions. [2022-03-15 19:48:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-03-15 19:48:42,592 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 2.888888888888889) internal successors, (182), 63 states have internal predecessors, (182), 0 states have call successors, (0), 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 37 [2022-03-15 19:48:42,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:42,597 INFO L225 Difference]: With dead ends: 3145 [2022-03-15 19:48:42,597 INFO L226 Difference]: Without dead ends: 3088 [2022-03-15 19:48:42,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10789 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4325, Invalid=25431, Unknown=0, NotChecked=0, Total=29756 [2022-03-15 19:48:42,599 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 298 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 2762 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 2902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:42,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 111 Invalid, 2902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2762 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 19:48:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2022-03-15 19:48:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 1876. [2022-03-15 19:48:42,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1875 states have (on average 2.9621333333333335) internal successors, (5554), 1875 states have internal predecessors, (5554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 5554 transitions. [2022-03-15 19:48:42,627 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 5554 transitions. Word has length 37 [2022-03-15 19:48:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:42,627 INFO L470 AbstractCegarLoop]: Abstraction has 1876 states and 5554 transitions. [2022-03-15 19:48:42,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.888888888888889) internal successors, (182), 63 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 5554 transitions. [2022-03-15 19:48:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:48:42,629 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:42,629 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:42,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Forceful destruction successful, exit code 0 [2022-03-15 19:48:42,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 139 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2022-03-15 19:48:42,849 INFO L402 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:42,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:42,849 INFO L85 PathProgramCache]: Analyzing trace with hash -121779530, now seen corresponding path program 138 times [2022-03-15 19:48:42,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:42,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000135642] [2022-03-15 19:48:42,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:42,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 45 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:43,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:43,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000135642] [2022-03-15 19:48:43,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000135642] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:43,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153999509] [2022-03-15 19:48:43,304 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:48:43,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:43,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:43,306 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:43,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2022-03-15 19:48:43,453 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-03-15 19:48:43,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:48:43,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 19:48:43,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:44,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 31 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:45,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153999509] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:45,293 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:45,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 84 [2022-03-15 19:48:45,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [741290792] [2022-03-15 19:48:45,294 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:45,297 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:45,331 INFO L252 McrAutomatonBuilder]: Finished intersection with 146 states and 273 transitions. [2022-03-15 19:48:45,331 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:48,612 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [377904#(and (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 377900#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 377894#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 377902#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 10 ~M1~0))) (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 377881#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 377874#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 377879#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 377884#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 377885#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 377882#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 377903#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 377888#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 377889#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 377895#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 377878#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 377890#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 377887#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 377873#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 377896#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 377877#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 377893#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 377901#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 377886#(and (or (<= 6 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 377875#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 377891#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 377892#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 377897#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 377880#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 377876#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 377899#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 377898#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 377883#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0)))] [2022-03-15 19:48:48,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 19:48:48,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:48,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 19:48:48,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1844, Invalid=11962, Unknown=0, NotChecked=0, Total=13806 [2022-03-15 19:48:48,613 INFO L87 Difference]: Start difference. First operand 1876 states and 5554 transitions. Second operand has 63 states, 62 states have (on average 2.8548387096774195) internal successors, (177), 62 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:51,248 INFO L93 Difference]: Finished difference Result 3183 states and 9092 transitions. [2022-03-15 19:48:51,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 19:48:51,248 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.8548387096774195) internal successors, (177), 62 states have internal predecessors, (177), 0 states have call successors, (0), 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 37 [2022-03-15 19:48:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:51,253 INFO L225 Difference]: With dead ends: 3183 [2022-03-15 19:48:51,253 INFO L226 Difference]: Without dead ends: 3122 [2022-03-15 19:48:51,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 88 SyntacticMatches, 5 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11203 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4591, Invalid=26561, Unknown=0, NotChecked=0, Total=31152 [2022-03-15 19:48:51,254 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 283 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:51,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 81 Invalid, 2272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:48:51,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2022-03-15 19:48:51,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 1822. [2022-03-15 19:48:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1821 states have (on average 2.946183415705656) internal successors, (5365), 1821 states have internal predecessors, (5365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 5365 transitions. [2022-03-15 19:48:51,280 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 5365 transitions. Word has length 37 [2022-03-15 19:48:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:51,280 INFO L470 AbstractCegarLoop]: Abstraction has 1822 states and 5365 transitions. [2022-03-15 19:48:51,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.8548387096774195) internal successors, (177), 62 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 5365 transitions. [2022-03-15 19:48:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:48:51,282 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:51,282 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:51,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Forceful destruction successful, exit code 0 [2022-03-15 19:48:51,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 140 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable139 [2022-03-15 19:48:51,495 INFO L402 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:51,495 INFO L85 PathProgramCache]: Analyzing trace with hash 53384040, now seen corresponding path program 139 times [2022-03-15 19:48:51,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:51,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841845475] [2022-03-15 19:48:51,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:51,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 45 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:51,971 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:48:51,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841845475] [2022-03-15 19:48:51,971 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841845475] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:48:51,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539107172] [2022-03-15 19:48:51,971 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:48:51,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:51,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:48:51,972 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:48:51,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2022-03-15 19:48:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:48:52,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 19:48:52,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:48:52,702 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:52,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:48:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 30 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:48:53,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539107172] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:48:53,565 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:48:53,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 84 [2022-03-15 19:48:53,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [878704092] [2022-03-15 19:48:53,565 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:48:53,569 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:48:53,601 INFO L252 McrAutomatonBuilder]: Finished intersection with 142 states and 264 transitions. [2022-03-15 19:48:53,601 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:48:56,539 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [385176#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 385167#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 385182#(and (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 385159#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 385171#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 385157#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 385179#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 385160#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 385178#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 385162#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 385175#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 385161#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 385169#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 385174#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 385154#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 385155#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 385181#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 10 ~M1~0))) (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 385173#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 385152#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 385170#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 385156#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 385165#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 385177#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 385153#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 385158#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 5 ~counter~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 385172#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 385180#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 385164#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 385168#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 385163#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 385166#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)))] [2022-03-15 19:48:56,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-03-15 19:48:56,540 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:48:56,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-03-15 19:48:56,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1818, Invalid=11754, Unknown=0, NotChecked=0, Total=13572 [2022-03-15 19:48:56,541 INFO L87 Difference]: Start difference. First operand 1822 states and 5365 transitions. Second operand has 62 states, 61 states have (on average 2.819672131147541) internal successors, (172), 61 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:48:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:48:59,491 INFO L93 Difference]: Finished difference Result 3183 states and 9003 transitions. [2022-03-15 19:48:59,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-03-15 19:48:59,491 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.819672131147541) internal successors, (172), 61 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) Word has length 37 [2022-03-15 19:48:59,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:48:59,497 INFO L225 Difference]: With dead ends: 3183 [2022-03-15 19:48:59,497 INFO L226 Difference]: Without dead ends: 3118 [2022-03-15 19:48:59,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11398 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4885, Invalid=27695, Unknown=0, NotChecked=0, Total=32580 [2022-03-15 19:48:59,500 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 280 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 2886 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 2987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:48:59,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 97 Invalid, 2987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2886 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:48:59,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3118 states. [2022-03-15 19:48:59,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3118 to 1756. [2022-03-15 19:48:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1755 states have (on average 2.9253561253561253) internal successors, (5134), 1755 states have internal predecessors, (5134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:48:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 5134 transitions. [2022-03-15 19:48:59,527 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 5134 transitions. Word has length 37 [2022-03-15 19:48:59,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:48:59,527 INFO L470 AbstractCegarLoop]: Abstraction has 1756 states and 5134 transitions. [2022-03-15 19:48:59,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.819672131147541) internal successors, (172), 61 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:48:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 5134 transitions. [2022-03-15 19:48:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:48:59,530 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:48:59,530 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:48:59,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Forceful destruction successful, exit code 0 [2022-03-15 19:48:59,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,141 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:48:59,747 INFO L402 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:48:59,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:48:59,747 INFO L85 PathProgramCache]: Analyzing trace with hash 336129142, now seen corresponding path program 140 times [2022-03-15 19:48:59,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:48:59,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087285423] [2022-03-15 19:48:59,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:48:59,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:48:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 45 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:00,066 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:00,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087285423] [2022-03-15 19:49:00,066 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087285423] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:00,066 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977428957] [2022-03-15 19:49:00,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:49:00,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:00,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:00,068 INFO L229 MonitoredProcess]: Starting monitored process 142 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:00,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2022-03-15 19:49:00,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:49:00,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:00,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 74 conjunts are in the unsatisfiable core [2022-03-15 19:49:00,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:00,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 31 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:01,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977428957] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:01,606 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:01,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 84 [2022-03-15 19:49:01,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2056959735] [2022-03-15 19:49:01,606 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:01,609 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:01,647 INFO L252 McrAutomatonBuilder]: Finished intersection with 138 states and 255 transitions. [2022-03-15 19:49:01,647 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:04,408 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [392333#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 392321#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 392336#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 10 ~M1~0))) (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 392314#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 392331#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 392318#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 392334#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 392319#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 392327#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 392317#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 392335#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 392329#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 392315#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 392313#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 4 ~counter~0))), 392323#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 392324#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 392325#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 392308#(or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0))), 392337#(and (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 392328#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 392309#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (= ~M1~0 (+ ~counter~0 ~M2~0)))), 392312#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 392316#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 392320#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 392322#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 392310#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 392326#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 392311#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 392332#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 392330#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0)))] [2022-03-15 19:49:04,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-03-15 19:49:04,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:04,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-03-15 19:49:04,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1807, Invalid=11533, Unknown=0, NotChecked=0, Total=13340 [2022-03-15 19:49:04,409 INFO L87 Difference]: Start difference. First operand 1756 states and 5134 transitions. Second operand has 61 states, 60 states have (on average 2.783333333333333) internal successors, (167), 60 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call 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:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:49:07,530 INFO L93 Difference]: Finished difference Result 3145 states and 8777 transitions. [2022-03-15 19:49:07,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-15 19:49:07,530 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.783333333333333) internal successors, (167), 60 states have internal predecessors, (167), 0 states have call successors, (0), 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 37 [2022-03-15 19:49:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:49:07,535 INFO L225 Difference]: With dead ends: 3145 [2022-03-15 19:49:07,535 INFO L226 Difference]: Without dead ends: 3076 [2022-03-15 19:49:07,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 83 SyntacticMatches, 4 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11692 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5207, Invalid=28833, Unknown=0, NotChecked=0, Total=34040 [2022-03-15 19:49:07,538 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 275 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 3052 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 3160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:07,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 111 Invalid, 3160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3052 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 19:49:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2022-03-15 19:49:07,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 1678. [2022-03-15 19:49:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1677 states have (on average 2.898628503279666) internal successors, (4861), 1677 states have internal predecessors, (4861), 0 states have call successors, (0), 0 states have call 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:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 4861 transitions. [2022-03-15 19:49:07,563 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 4861 transitions. Word has length 37 [2022-03-15 19:49:07,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:49:07,564 INFO L470 AbstractCegarLoop]: Abstraction has 1678 states and 4861 transitions. [2022-03-15 19:49:07,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.783333333333333) internal successors, (167), 60 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call 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:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 4861 transitions. [2022-03-15 19:49:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-03-15 19:49:07,566 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:49:07,566 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:49:07,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:07,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,142 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:07,780 INFO L402 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:49:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:49:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash 622344616, now seen corresponding path program 141 times [2022-03-15 19:49:07,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:49:07,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827911542] [2022-03-15 19:49:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:49:07,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:49:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:49:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 45 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:08,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:49:08,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827911542] [2022-03-15 19:49:08,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827911542] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:49:08,111 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075126066] [2022-03-15 19:49:08,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:49:08,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:08,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:49:08,112 INFO L229 MonitoredProcess]: Starting monitored process 143 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:08,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2022-03-15 19:49:08,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-03-15 19:49:08,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:49:08,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 19:49:08,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:49:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:08,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:49:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 41 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:49:09,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075126066] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:49:09,980 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:49:09,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 84 [2022-03-15 19:49:09,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1450999589] [2022-03-15 19:49:09,980 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:49:09,983 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:49:10,032 INFO L252 McrAutomatonBuilder]: Finished intersection with 134 states and 246 transitions. [2022-03-15 19:49:10,032 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:49:12,733 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 29 new interpolants: [399304#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 399292#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 2 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 399293#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0)) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 399291#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= 1 ~counter~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 399297#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 399302#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 399299#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 399298#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 399300#(and (or (<= ~M1~0 (+ ~counter~0 thread2Thread1of1ForFork1_~i~1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< thread1Thread1of1ForFork0_~i~0 ~M1~0) (<= 3 ~counter~0))), 399294#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 4 ~counter~0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 6 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 399303#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= 2 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= ~counter~0 thread1Thread1of1ForFork0_~i~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 8) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 399280#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0))), 399279#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 399301#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= 1 ~counter~0) (not (< (+ 9 thread1Thread1of1ForFork0_~i~0) ~M1~0)))), 399284#(and (or (<= 10 ~counter~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0))) (or (not (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 399287#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 399307#(and (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 399290#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (<= (+ ~counter~0 thread2Thread1of1ForFork1_~i~1) ~M1~0) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 399289#(and (or (<= ~M1~0 (+ ~counter~0 ~M2~0)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0)) (or (< (+ ~counter~0 ~M2~0) (+ ~M1~0 1)) (< thread1Thread1of1ForFork0_~i~0 ~M1~0))), 399296#(and (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 5 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 5 ~counter~0))), 399283#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (= thread2Thread1of1ForFork1_~i~1 0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 399295#(and (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 7 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 3 ~counter~0))), 399282#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 3 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 7 ~counter~0))), 399306#(and (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< 10 ~M1~0))) (or (<= ~counter~0 0) (not (< 10 ~M1~0))) (or (<= 0 ~counter~0) (not (< 10 ~M1~0)))), 399286#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0))), 399288#(and (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)) (<= 6 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 4) ~M1~0)))), 399285#(and (or (<= 9 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0))) (or (not (< (+ thread1Thread1of1ForFork0_~i~0 1) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0))), 399305#(and (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= 0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0))) (or (<= thread1Thread1of1ForFork0_~i~0 ~counter~0) (not (< (+ thread1Thread1of1ForFork0_~i~0 10) ~M1~0)))), 399281#(and (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= thread1Thread1of1ForFork0_~i~0 ~counter~0)) (or (<= ~counter~0 thread1Thread1of1ForFork0_~i~0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (= thread2Thread1of1ForFork1_~i~1 0) (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0))) (or (not (< (+ 2 thread1Thread1of1ForFork0_~i~0) ~M1~0)) (<= 8 ~counter~0)))] [2022-03-15 19:49:12,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-03-15 19:49:12,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:49:12,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-03-15 19:49:12,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1556, Invalid=11554, Unknown=0, NotChecked=0, Total=13110 [2022-03-15 19:49:12,735 INFO L87 Difference]: Start difference. First operand 1678 states and 4861 transitions. Second operand has 60 states, 59 states have (on average 2.7457627118644066) internal successors, (162), 59 states have internal predecessors, (162), 0 states have call successors, (0), 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 19:49:13,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 19:49:13,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6364 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1786, Invalid=13714, Unknown=0, NotChecked=0, Total=15500 [2022-03-15 19:49:13,355 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:49:13,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 60 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:49:13,356 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-15 19:49:13,362 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:49:13,369 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:49:13,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Forceful destruction successful, exit code 0 [2022-03-15 19:49:13,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,143 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:49:13,569 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (1678states) and FLOYD_HOARE automaton (currently 22 states, 60 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. [2022-03-15 19:49:13,571 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 19:49:13,571 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 19:49:13,572 INFO L732 BasicCegarLoop]: Path program histogram: [141, 1, 1] [2022-03-15 19:49:13,574 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:49:13,574 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:49:13,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:49:13 BasicIcfg [2022-03-15 19:49:13,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:49:13,576 INFO L158 Benchmark]: Toolchain (without parser) took 868271.09ms. Allocated memory was 175.1MB in the beginning and 761.3MB in the end (delta: 586.2MB). Free memory was 124.0MB in the beginning and 494.6MB in the end (delta: -370.6MB). Peak memory consumption was 608.6MB. Max. memory is 8.0GB. [2022-03-15 19:49:13,576 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 175.1MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:49:13,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.21ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 123.8MB in the beginning and 187.7MB in the end (delta: -63.9MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2022-03-15 19:49:13,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.28ms. Allocated memory is still 210.8MB. Free memory was 187.7MB in the beginning and 186.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:49:13,576 INFO L158 Benchmark]: Boogie Preprocessor took 14.85ms. Allocated memory is still 210.8MB. Free memory was 186.2MB in the beginning and 184.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:49:13,576 INFO L158 Benchmark]: RCFGBuilder took 317.04ms. Allocated memory is still 210.8MB. Free memory was 184.8MB in the beginning and 172.0MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-15 19:49:13,576 INFO L158 Benchmark]: TraceAbstraction took 867723.76ms. Allocated memory was 210.8MB in the beginning and 761.3MB in the end (delta: 550.5MB). Free memory was 171.5MB in the beginning and 494.6MB in the end (delta: -323.1MB). Peak memory consumption was 620.6MB. Max. memory is 8.0GB. [2022-03-15 19:49:13,577 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.14ms. Allocated memory is still 175.1MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.21ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 123.8MB in the beginning and 187.7MB in the end (delta: -63.9MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.28ms. Allocated memory is still 210.8MB. Free memory was 187.7MB in the beginning and 186.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.85ms. Allocated memory is still 210.8MB. Free memory was 186.2MB in the beginning and 184.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 317.04ms. Allocated memory is still 210.8MB. Free memory was 184.8MB in the beginning and 172.0MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 867723.76ms. Allocated memory was 210.8MB in the beginning and 761.3MB in the end (delta: 550.5MB). Free memory was 171.5MB in the beginning and 494.6MB in the end (delta: -323.1MB). Peak memory consumption was 620.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 87 PlacesBefore, 23 PlacesAfterwards, 86 TransitionsBefore, 18 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 6 FixpointIterations, 48 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 77 TotalNumberOfCompositions, 465 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 465, positive: 464, positive conditional: 0, positive unconditional: 464, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 209, positive: 208, positive conditional: 0, positive unconditional: 208, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 465, positive: 256, positive conditional: 0, positive unconditional: 256, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 209, unknown conditional: 0, unknown unconditional: 209] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - 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: 78]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (1678states) and FLOYD_HOARE automaton (currently 22 states, 60 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 125 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 (1678states) and FLOYD_HOARE automaton (currently 22 states, 60 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - TimeoutResultAtElement [Line: 72]: 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 (1678states) and FLOYD_HOARE automaton (currently 22 states, 60 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 125 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 98 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 867.6s, OverallIterations: 143, TraceHistogramMax: 12, PathProgramHistogramMax: 141, EmptinessCheckTime: 0.1s, AutomataDifference: 335.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27988 SdHoareTripleChecker+Valid, 87.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27988 mSDsluCounter, 8838 SdHoareTripleChecker+Invalid, 74.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121968 mSDsCounter, 11612 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 260016 IncrementalHoareTripleChecker+Invalid, 271628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11612 mSolverCounterUnsat, 1553 mSDtfsCounter, 260016 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27070 GetRequests, 10234 SyntacticMatches, 521 SemanticMatches, 16314 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791967 ImplicationChecksByTransitivity, 440.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1948occurred in iteration=137, InterpolantAutomatonStates: 7788, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 142 MinimizatonAttempts, 72318 StatesRemovedByMinimization, 141 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.3s SsaConstructionTime, 4.3s SatisfiabilityAnalysisTime, 174.1s InterpolantComputationTime, 8063 NumberOfCodeBlocks, 8063 NumberOfCodeBlocksAsserted, 630 NumberOfCheckSat, 11661 ConstructedInterpolants, 0 QuantifiedInterpolants, 143901 SizeOfPredicates, 852 NumberOfNonLiveVariables, 23399 ConjunctsInSsa, 7186 ConjunctsInUnsatCore, 427 InterpolantComputations, 1 PerfectInterpolantSequences, 5362/32391 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