/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 14:47:11,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 14:47:11,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 14:47:11,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 14:47:11,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 14:47:11,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 14:47:11,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 14:47:11,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 14:47:11,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 14:47:11,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 14:47:11,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 14:47:11,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 14:47:11,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 14:47:11,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 14:47:11,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 14:47:11,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 14:47:11,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 14:47:11,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 14:47:11,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 14:47:11,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 14:47:11,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 14:47:11,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 14:47:11,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 14:47:11,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 14:47:11,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 14:47:11,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 14:47:11,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 14:47:11,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 14:47:11,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 14:47:11,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 14:47:11,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 14:47:11,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 14:47:11,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 14:47:11,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 14:47:11,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 14:47:11,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 14:47:11,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 14:47:11,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 14:47:11,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 14:47:11,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 14:47:11,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 14:47:11,530 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-03-01 14:47:11,566 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 14:47:11,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 14:47:11,567 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 14:47:11,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 14:47:11,568 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 14:47:11,568 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 14:47:11,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 14:47:11,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 14:47:11,569 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 14:47:11,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 14:47:11,570 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 14:47:11,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 14:47:11,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 14:47:11,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 14:47:11,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 14:47:11,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 14:47:11,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 14:47:11,570 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 14:47:11,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 14:47:11,571 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 14:47:11,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 14:47:11,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 14:47:11,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 14:47:11,571 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 14:47:11,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 14:47:11,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 14:47:11,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 14:47:11,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 14:47:11,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 14:47:11,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 14:47:11,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 14:47:11,572 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 14:47:11,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 14:47:11,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-01 14:47:11,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 14:47:11,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 14:47:11,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 14:47:11,850 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 14:47:11,850 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 14:47:11,851 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2022-03-01 14:47:11,921 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b433b34cf/2c34d3d5eb2a4e01a3132f7f62381fc7/FLAGda57eba9a [2022-03-01 14:47:12,397 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 14:47:12,397 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2022-03-01 14:47:12,413 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b433b34cf/2c34d3d5eb2a4e01a3132f7f62381fc7/FLAGda57eba9a [2022-03-01 14:47:12,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b433b34cf/2c34d3d5eb2a4e01a3132f7f62381fc7 [2022-03-01 14:47:12,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 14:47:12,719 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 14:47:12,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 14:47:12,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 14:47:12,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 14:47:12,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 02:47:12" (1/1) ... [2022-03-01 14:47:12,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6617d152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:47:12, skipping insertion in model container [2022-03-01 14:47:12,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 02:47:12" (1/1) ... [2022-03-01 14:47:12,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 14:47:12,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 14:47:12,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i[949,962] [2022-03-01 14:47:13,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 14:47:13,213 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 14:47:13,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i[949,962] [2022-03-01 14:47:13,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 14:47:13,323 INFO L208 MainTranslator]: Completed translation [2022-03-01 14:47:13,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:47:13 WrapperNode [2022-03-01 14:47:13,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 14:47:13,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 14:47:13,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 14:47:13,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 14:47:13,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:47:13" (1/1) ... [2022-03-01 14:47:13,366 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:47:13" (1/1) ... [2022-03-01 14:47:13,413 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 292 [2022-03-01 14:47:13,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 14:47:13,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 14:47:13,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 14:47:13,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 14:47:13,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:47:13" (1/1) ... [2022-03-01 14:47:13,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:47:13" (1/1) ... [2022-03-01 14:47:13,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:47:13" (1/1) ... [2022-03-01 14:47:13,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:47:13" (1/1) ... [2022-03-01 14:47:13,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:47:13" (1/1) ... [2022-03-01 14:47:13,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:47:13" (1/1) ... [2022-03-01 14:47:13,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:47:13" (1/1) ... [2022-03-01 14:47:13,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 14:47:13,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 14:47:13,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 14:47:13,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 14:47:13,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:47:13" (1/1) ... [2022-03-01 14:47:13,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 14:47:13,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 14:47:13,503 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-01 14:47:13,504 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-01 14:47:13,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 14:47:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-01 14:47:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 14:47:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 14:47:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 14:47:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-01 14:47:13,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-01 14:47:13,532 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-01 14:47:13,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-01 14:47:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-01 14:47:13,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-01 14:47:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-03-01 14:47:13,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-03-01 14:47:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 14:47:13,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-01 14:47:13,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 14:47:13,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 14:47:13,535 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 14:47:13,689 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 14:47:13,690 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 14:47:14,180 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 14:47:14,524 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 14:47:14,524 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-01 14:47:14,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 02:47:14 BoogieIcfgContainer [2022-03-01 14:47:14,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 14:47:14,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 14:47:14,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 14:47:14,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 14:47:14,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 02:47:12" (1/3) ... [2022-03-01 14:47:14,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1761ab56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 02:47:14, skipping insertion in model container [2022-03-01 14:47:14,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 02:47:13" (2/3) ... [2022-03-01 14:47:14,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1761ab56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 02:47:14, skipping insertion in model container [2022-03-01 14:47:14,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 02:47:14" (3/3) ... [2022-03-01 14:47:14,535 INFO L111 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2022-03-01 14:47:14,540 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 14:47:14,541 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 14:47:14,541 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-01 14:47:14,541 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 14:47:14,597 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,597 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,597 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,597 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,597 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,597 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,598 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,598 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,598 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,599 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,599 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,599 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,599 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,599 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,599 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,600 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,600 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,600 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,601 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,601 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,601 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,602 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,602 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,602 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,603 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,604 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,604 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,604 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,604 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,604 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,604 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,605 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,605 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,605 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,605 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,605 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,605 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,605 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,606 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,606 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,606 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,606 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,607 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,607 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,607 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,607 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,607 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,607 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,608 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,608 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,608 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,608 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,608 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,609 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,609 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,609 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,609 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,610 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,610 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,610 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,611 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,611 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,611 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,611 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,611 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,611 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,612 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,612 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,612 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,612 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,612 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,612 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,613 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,614 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,614 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,614 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,614 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,614 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,615 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,616 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,616 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,617 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,617 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,617 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,617 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,618 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,618 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,618 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,618 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,618 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,618 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,618 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,619 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,619 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,619 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,619 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,619 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,620 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,620 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,620 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,620 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,620 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,620 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,620 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,622 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,622 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,622 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,622 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,628 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,628 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,628 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,628 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,628 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,628 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,629 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,629 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,629 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,629 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,630 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,631 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,632 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,632 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,632 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,633 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,634 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,634 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,634 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,634 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,635 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,635 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,635 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,635 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,636 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,637 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,637 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 14:47:14,637 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 14:47:14,689 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 14:47:14,695 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, 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=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-01 14:47:14,697 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-03-01 14:47:14,711 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149 places, 138 transitions, 296 flow [2022-03-01 14:47:19,153 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 129056 states, 129053 states have (on average 4.459516632701293) internal successors, (575514), 129055 states have internal predecessors, (575514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:47:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 129056 states, 129053 states have (on average 4.459516632701293) internal successors, (575514), 129055 states have internal predecessors, (575514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:47:19,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-03-01 14:47:19,385 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:47:19,386 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:47:19,388 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:47:19,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:47:19,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1109753730, now seen corresponding path program 1 times [2022-03-01 14:47:19,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:47:19,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846705422] [2022-03-01 14:47:19,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:47:19,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:47:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:47:19,746 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-01 14:47:19,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:47:19,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846705422] [2022-03-01 14:47:19,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846705422] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:47:19,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:47:19,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 14:47:19,748 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828292973] [2022-03-01 14:47:19,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:47:19,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 14:47:19,753 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:47:19,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 14:47:19,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 14:47:20,414 INFO L87 Difference]: Start difference. First operand has 129056 states, 129053 states have (on average 4.459516632701293) internal successors, (575514), 129055 states have internal predecessors, (575514), 0 states have call successors, (0), 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 3 states, 2 states have (on average 28.5) internal successors, (57), 3 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-01 14:47:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:47:22,702 INFO L93 Difference]: Finished difference Result 107816 states and 471721 transitions. [2022-03-01 14:47:22,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 14:47:22,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 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 57 [2022-03-01 14:47:22,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:47:23,859 INFO L225 Difference]: With dead ends: 107816 [2022-03-01 14:47:23,859 INFO L226 Difference]: Without dead ends: 87080 [2022-03-01 14:47:23,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 14:47:23,867 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 63 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:47:23,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 202 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:47:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87080 states. [2022-03-01 14:47:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87080 to 87080. [2022-03-01 14:47:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87080 states, 87079 states have (on average 4.411729578888136) internal successors, (384169), 87079 states have internal predecessors, (384169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:47:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87080 states to 87080 states and 384169 transitions. [2022-03-01 14:47:29,051 INFO L78 Accepts]: Start accepts. Automaton has 87080 states and 384169 transitions. Word has length 57 [2022-03-01 14:47:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:47:29,052 INFO L470 AbstractCegarLoop]: Abstraction has 87080 states and 384169 transitions. [2022-03-01 14:47:29,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 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-01 14:47:29,052 INFO L276 IsEmpty]: Start isEmpty. Operand 87080 states and 384169 transitions. [2022-03-01 14:47:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-03-01 14:47:29,274 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:47:29,274 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:47:29,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 14:47:29,275 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:47:29,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:47:29,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1244501482, now seen corresponding path program 1 times [2022-03-01 14:47:29,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:47:29,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890192552] [2022-03-01 14:47:29,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:47:29,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:47:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:47:29,505 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-01 14:47:29,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:47:29,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890192552] [2022-03-01 14:47:29,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890192552] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:47:29,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:47:29,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 14:47:29,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098085482] [2022-03-01 14:47:29,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:47:29,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 14:47:29,508 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:47:29,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 14:47:29,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-01 14:47:29,512 INFO L87 Difference]: Start difference. First operand 87080 states and 384169 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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-01 14:47:31,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:47:31,372 INFO L93 Difference]: Finished difference Result 99368 states and 435369 transitions. [2022-03-01 14:47:31,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 14:47:31,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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 86 [2022-03-01 14:47:31,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:47:32,529 INFO L225 Difference]: With dead ends: 99368 [2022-03-01 14:47:32,529 INFO L226 Difference]: Without dead ends: 76328 [2022-03-01 14:47:32,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-01 14:47:32,531 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 186 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-01 14:47:32,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 662 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-01 14:47:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76328 states. [2022-03-01 14:47:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76328 to 76328. [2022-03-01 14:47:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76328 states, 76327 states have (on average 4.3816866901620655) internal successors, (334441), 76327 states have internal predecessors, (334441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:47:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76328 states to 76328 states and 334441 transitions. [2022-03-01 14:47:36,581 INFO L78 Accepts]: Start accepts. Automaton has 76328 states and 334441 transitions. Word has length 86 [2022-03-01 14:47:36,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:47:36,586 INFO L470 AbstractCegarLoop]: Abstraction has 76328 states and 334441 transitions. [2022-03-01 14:47:36,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 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-01 14:47:36,586 INFO L276 IsEmpty]: Start isEmpty. Operand 76328 states and 334441 transitions. [2022-03-01 14:47:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-03-01 14:47:36,722 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:47:36,722 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:47:36,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 14:47:36,723 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:47:36,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:47:36,723 INFO L85 PathProgramCache]: Analyzing trace with hash -559800482, now seen corresponding path program 1 times [2022-03-01 14:47:36,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:47:36,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017150067] [2022-03-01 14:47:36,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:47:36,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:47:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:47:37,106 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-01 14:47:37,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:47:37,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017150067] [2022-03-01 14:47:37,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017150067] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:47:37,107 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:47:37,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-01 14:47:37,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210121469] [2022-03-01 14:47:37,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:47:37,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 14:47:37,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:47:37,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 14:47:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-03-01 14:47:37,109 INFO L87 Difference]: Start difference. First operand 76328 states and 334441 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 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-01 14:47:38,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:47:38,982 INFO L93 Difference]: Finished difference Result 94592 states and 413109 transitions. [2022-03-01 14:47:38,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 14:47:38,983 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 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 89 [2022-03-01 14:47:38,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:47:39,502 INFO L225 Difference]: With dead ends: 94592 [2022-03-01 14:47:39,503 INFO L226 Difference]: Without dead ends: 78032 [2022-03-01 14:47:39,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-03-01 14:47:39,504 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 421 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:47:39,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 994 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:47:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78032 states. [2022-03-01 14:47:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78032 to 74312. [2022-03-01 14:47:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74312 states, 74311 states have (on average 4.372825019176165) internal successors, (324949), 74311 states have internal predecessors, (324949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:47:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74312 states to 74312 states and 324949 transitions. [2022-03-01 14:47:43,791 INFO L78 Accepts]: Start accepts. Automaton has 74312 states and 324949 transitions. Word has length 89 [2022-03-01 14:47:43,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:47:43,791 INFO L470 AbstractCegarLoop]: Abstraction has 74312 states and 324949 transitions. [2022-03-01 14:47:43,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 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-01 14:47:43,792 INFO L276 IsEmpty]: Start isEmpty. Operand 74312 states and 324949 transitions. [2022-03-01 14:47:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-03-01 14:47:43,929 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:47:43,930 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:47:43,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 14:47:43,930 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:47:43,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:47:43,931 INFO L85 PathProgramCache]: Analyzing trace with hash 326185756, now seen corresponding path program 1 times [2022-03-01 14:47:43,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:47:43,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372242962] [2022-03-01 14:47:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:47:43,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:47:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:47:44,236 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-01 14:47:44,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:47:44,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372242962] [2022-03-01 14:47:44,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372242962] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:47:44,237 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:47:44,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 14:47:44,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338041257] [2022-03-01 14:47:44,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:47:44,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 14:47:44,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:47:44,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 14:47:44,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-01 14:47:44,238 INFO L87 Difference]: Start difference. First operand 74312 states and 324949 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:47:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:47:45,835 INFO L93 Difference]: Finished difference Result 86462 states and 376495 transitions. [2022-03-01 14:47:45,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-01 14:47:45,835 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-03-01 14:47:45,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:47:46,770 INFO L225 Difference]: With dead ends: 86462 [2022-03-01 14:47:46,770 INFO L226 Difference]: Without dead ends: 74942 [2022-03-01 14:47:46,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-03-01 14:47:46,778 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 351 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-01 14:47:46,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 1331 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-01 14:47:46,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74942 states. [2022-03-01 14:47:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74942 to 74942. [2022-03-01 14:47:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74942 states, 74941 states have (on average 4.37484154201305) internal successors, (327855), 74941 states have internal predecessors, (327855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:47:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74942 states to 74942 states and 327855 transitions. [2022-03-01 14:47:50,379 INFO L78 Accepts]: Start accepts. Automaton has 74942 states and 327855 transitions. Word has length 91 [2022-03-01 14:47:50,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:47:50,380 INFO L470 AbstractCegarLoop]: Abstraction has 74942 states and 327855 transitions. [2022-03-01 14:47:50,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:47:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 74942 states and 327855 transitions. [2022-03-01 14:47:51,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-03-01 14:47:51,019 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:47:51,019 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:47:51,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-01 14:47:51,020 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:47:51,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:47:51,020 INFO L85 PathProgramCache]: Analyzing trace with hash 522228544, now seen corresponding path program 2 times [2022-03-01 14:47:51,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:47:51,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738130904] [2022-03-01 14:47:51,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:47:51,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:47:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:47:51,335 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-01 14:47:51,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:47:51,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738130904] [2022-03-01 14:47:51,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738130904] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:47:51,336 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:47:51,336 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 14:47:51,337 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481700063] [2022-03-01 14:47:51,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:47:51,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 14:47:51,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:47:51,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 14:47:51,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-01 14:47:51,338 INFO L87 Difference]: Start difference. First operand 74942 states and 327855 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:47:52,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:47:52,677 INFO L93 Difference]: Finished difference Result 90926 states and 396735 transitions. [2022-03-01 14:47:52,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-01 14:47:52,678 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-03-01 14:47:52,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:47:53,172 INFO L225 Difference]: With dead ends: 90926 [2022-03-01 14:47:53,172 INFO L226 Difference]: Without dead ends: 78206 [2022-03-01 14:47:53,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-03-01 14:47:53,173 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 314 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:47:53,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 948 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:47:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78206 states. [2022-03-01 14:47:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78206 to 78206. [2022-03-01 14:47:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78206 states, 78205 states have (on average 4.379911770347165) internal successors, (342531), 78205 states have internal predecessors, (342531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:47:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78206 states to 78206 states and 342531 transitions. [2022-03-01 14:47:58,081 INFO L78 Accepts]: Start accepts. Automaton has 78206 states and 342531 transitions. Word has length 91 [2022-03-01 14:47:58,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:47:58,082 INFO L470 AbstractCegarLoop]: Abstraction has 78206 states and 342531 transitions. [2022-03-01 14:47:58,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:47:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand 78206 states and 342531 transitions. [2022-03-01 14:47:58,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-03-01 14:47:58,282 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:47:58,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:47:58,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-01 14:47:58,283 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:47:58,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:47:58,284 INFO L85 PathProgramCache]: Analyzing trace with hash 564851816, now seen corresponding path program 1 times [2022-03-01 14:47:58,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:47:58,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507300138] [2022-03-01 14:47:58,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:47:58,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:47:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:47:58,493 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-01 14:47:58,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:47:58,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507300138] [2022-03-01 14:47:58,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507300138] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:47:58,493 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:47:58,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-01 14:47:58,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108920151] [2022-03-01 14:47:58,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:47:58,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 14:47:58,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:47:58,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 14:47:58,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-01 14:47:58,495 INFO L87 Difference]: Start difference. First operand 78206 states and 342531 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 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-01 14:48:00,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:48:00,419 INFO L93 Difference]: Finished difference Result 89294 states and 389459 transitions. [2022-03-01 14:48:00,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 14:48:00,420 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 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 92 [2022-03-01 14:48:00,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:48:00,951 INFO L225 Difference]: With dead ends: 89294 [2022-03-01 14:48:00,951 INFO L226 Difference]: Without dead ends: 79294 [2022-03-01 14:48:00,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2022-03-01 14:48:00,952 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 389 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:48:00,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 1024 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:48:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79294 states. [2022-03-01 14:48:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79294 to 79294. [2022-03-01 14:48:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79294 states, 79293 states have (on average 4.381509086552407) internal successors, (347423), 79293 states have internal predecessors, (347423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79294 states to 79294 states and 347423 transitions. [2022-03-01 14:48:04,891 INFO L78 Accepts]: Start accepts. Automaton has 79294 states and 347423 transitions. Word has length 92 [2022-03-01 14:48:04,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:48:04,892 INFO L470 AbstractCegarLoop]: Abstraction has 79294 states and 347423 transitions. [2022-03-01 14:48:04,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 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-01 14:48:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 79294 states and 347423 transitions. [2022-03-01 14:48:05,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-01 14:48:05,090 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:48:05,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:48:05,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-01 14:48:05,091 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:48:05,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:48:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash 232551328, now seen corresponding path program 1 times [2022-03-01 14:48:05,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:48:05,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098913969] [2022-03-01 14:48:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:48:05,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:48:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:48:05,383 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-01 14:48:05,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:48:05,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098913969] [2022-03-01 14:48:05,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098913969] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:48:05,383 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:48:05,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-01 14:48:05,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39058749] [2022-03-01 14:48:05,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:48:05,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-01 14:48:05,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:48:05,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-01 14:48:05,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-01 14:48:05,385 INFO L87 Difference]: Start difference. First operand 79294 states and 347423 transitions. Second operand has 12 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:48:07,458 INFO L93 Difference]: Finished difference Result 133226 states and 574596 transitions. [2022-03-01 14:48:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-01 14:48:07,459 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-03-01 14:48:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:48:08,281 INFO L225 Difference]: With dead ends: 133226 [2022-03-01 14:48:08,281 INFO L226 Difference]: Without dead ends: 112186 [2022-03-01 14:48:08,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2022-03-01 14:48:08,282 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 411 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:48:08,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 959 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:48:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112186 states. [2022-03-01 14:48:12,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112186 to 102036. [2022-03-01 14:48:12,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102036 states, 102035 states have (on average 4.33982457000049) internal successors, (442814), 102035 states have internal predecessors, (442814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102036 states to 102036 states and 442814 transitions. [2022-03-01 14:48:13,605 INFO L78 Accepts]: Start accepts. Automaton has 102036 states and 442814 transitions. Word has length 93 [2022-03-01 14:48:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:48:13,605 INFO L470 AbstractCegarLoop]: Abstraction has 102036 states and 442814 transitions. [2022-03-01 14:48:13,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 102036 states and 442814 transitions. [2022-03-01 14:48:14,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-01 14:48:14,279 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:48:14,279 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:48:14,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-01 14:48:14,280 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:48:14,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:48:14,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1644741755, now seen corresponding path program 1 times [2022-03-01 14:48:14,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:48:14,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729888270] [2022-03-01 14:48:14,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:48:14,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:48:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:48:14,616 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-01 14:48:14,616 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:48:14,616 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729888270] [2022-03-01 14:48:14,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729888270] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:48:14,616 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:48:14,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-01 14:48:14,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482142746] [2022-03-01 14:48:14,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:48:14,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-01 14:48:14,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:48:14,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-01 14:48:14,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-03-01 14:48:14,618 INFO L87 Difference]: Start difference. First operand 102036 states and 442814 transitions. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:48:16,143 INFO L93 Difference]: Finished difference Result 110580 states and 478278 transitions. [2022-03-01 14:48:16,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 14:48:16,144 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-03-01 14:48:16,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:48:17,788 INFO L225 Difference]: With dead ends: 110580 [2022-03-01 14:48:17,789 INFO L226 Difference]: Without dead ends: 102420 [2022-03-01 14:48:17,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-03-01 14:48:17,790 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 376 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:48:17,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 1274 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:48:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102420 states. [2022-03-01 14:48:22,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102420 to 100308. [2022-03-01 14:48:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100308 states, 100307 states have (on average 4.333715493435154) internal successors, (434702), 100307 states have internal predecessors, (434702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100308 states to 100308 states and 434702 transitions. [2022-03-01 14:48:23,435 INFO L78 Accepts]: Start accepts. Automaton has 100308 states and 434702 transitions. Word has length 93 [2022-03-01 14:48:23,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:48:23,435 INFO L470 AbstractCegarLoop]: Abstraction has 100308 states and 434702 transitions. [2022-03-01 14:48:23,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:23,435 INFO L276 IsEmpty]: Start isEmpty. Operand 100308 states and 434702 transitions. [2022-03-01 14:48:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-01 14:48:23,710 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:48:23,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:48:23,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-01 14:48:23,710 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:48:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:48:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash -796865957, now seen corresponding path program 1 times [2022-03-01 14:48:23,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:48:23,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386000548] [2022-03-01 14:48:23,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:48:23,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:48:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:48:23,809 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-01 14:48:23,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:48:23,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386000548] [2022-03-01 14:48:23,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386000548] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:48:23,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:48:23,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-01 14:48:23,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220762132] [2022-03-01 14:48:23,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:48:23,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-01 14:48:23,810 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:48:23,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-01 14:48:23,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-01 14:48:23,811 INFO L87 Difference]: Start difference. First operand 100308 states and 434702 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:48:25,723 INFO L93 Difference]: Finished difference Result 126793 states and 543005 transitions. [2022-03-01 14:48:25,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 14:48:25,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-03-01 14:48:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:48:26,796 INFO L225 Difference]: With dead ends: 126793 [2022-03-01 14:48:26,797 INFO L226 Difference]: Without dead ends: 91873 [2022-03-01 14:48:26,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-03-01 14:48:26,797 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 239 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-01 14:48:26,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 500 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-01 14:48:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91873 states. [2022-03-01 14:48:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91873 to 91873. [2022-03-01 14:48:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91873 states, 91872 states have (on average 4.272629310344827) internal successors, (392535), 91872 states have internal predecessors, (392535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:31,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91873 states to 91873 states and 392535 transitions. [2022-03-01 14:48:31,127 INFO L78 Accepts]: Start accepts. Automaton has 91873 states and 392535 transitions. Word has length 93 [2022-03-01 14:48:31,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:48:31,127 INFO L470 AbstractCegarLoop]: Abstraction has 91873 states and 392535 transitions. [2022-03-01 14:48:31,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:31,127 INFO L276 IsEmpty]: Start isEmpty. Operand 91873 states and 392535 transitions. [2022-03-01 14:48:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-03-01 14:48:31,370 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:48:31,370 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:48:31,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-01 14:48:31,370 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:48:31,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:48:31,371 INFO L85 PathProgramCache]: Analyzing trace with hash -650365532, now seen corresponding path program 1 times [2022-03-01 14:48:31,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:48:31,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674571788] [2022-03-01 14:48:31,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:48:31,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:48:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:48:31,503 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-01 14:48:31,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:48:31,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674571788] [2022-03-01 14:48:31,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674571788] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:48:31,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:48:31,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-01 14:48:31,504 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415319725] [2022-03-01 14:48:31,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:48:31,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 14:48:31,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:48:31,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 14:48:31,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-03-01 14:48:31,505 INFO L87 Difference]: Start difference. First operand 91873 states and 392535 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:33,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:48:33,008 INFO L93 Difference]: Finished difference Result 96607 states and 403224 transitions. [2022-03-01 14:48:33,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-01 14:48:33,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-03-01 14:48:33,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:48:33,772 INFO L225 Difference]: With dead ends: 96607 [2022-03-01 14:48:33,772 INFO L226 Difference]: Without dead ends: 66307 [2022-03-01 14:48:33,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-03-01 14:48:33,773 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 411 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:48:33,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 592 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:48:33,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66307 states. [2022-03-01 14:48:35,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66307 to 66307. [2022-03-01 14:48:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66307 states, 66306 states have (on average 4.121783850631918) internal successors, (273299), 66306 states have internal predecessors, (273299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66307 states to 66307 states and 273299 transitions. [2022-03-01 14:48:36,580 INFO L78 Accepts]: Start accepts. Automaton has 66307 states and 273299 transitions. Word has length 94 [2022-03-01 14:48:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:48:36,580 INFO L470 AbstractCegarLoop]: Abstraction has 66307 states and 273299 transitions. [2022-03-01 14:48:36,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 66307 states and 273299 transitions. [2022-03-01 14:48:36,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-03-01 14:48:36,794 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:48:36,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:48:36,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-01 14:48:36,794 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:48:36,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:48:36,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1281094424, now seen corresponding path program 1 times [2022-03-01 14:48:36,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:48:36,795 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731608501] [2022-03-01 14:48:36,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:48:36,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:48:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:48:36,940 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-01 14:48:36,940 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:48:36,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731608501] [2022-03-01 14:48:36,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731608501] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:48:36,941 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:48:36,941 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-01 14:48:36,941 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213002616] [2022-03-01 14:48:36,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:48:36,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 14:48:36,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:48:36,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 14:48:36,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-01 14:48:36,942 INFO L87 Difference]: Start difference. First operand 66307 states and 273299 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 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-01 14:48:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:48:38,300 INFO L93 Difference]: Finished difference Result 102940 states and 423664 transitions. [2022-03-01 14:48:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 14:48:38,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 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 97 [2022-03-01 14:48:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:48:39,065 INFO L225 Difference]: With dead ends: 102940 [2022-03-01 14:48:39,066 INFO L226 Difference]: Without dead ends: 67811 [2022-03-01 14:48:39,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-03-01 14:48:39,076 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 153 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:48:39,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 1005 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:48:39,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67811 states. [2022-03-01 14:48:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67811 to 62619. [2022-03-01 14:48:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62619 states, 62618 states have (on average 4.066067265003673) internal successors, (254609), 62618 states have internal predecessors, (254609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62619 states to 62619 states and 254609 transitions. [2022-03-01 14:48:42,374 INFO L78 Accepts]: Start accepts. Automaton has 62619 states and 254609 transitions. Word has length 97 [2022-03-01 14:48:42,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:48:42,375 INFO L470 AbstractCegarLoop]: Abstraction has 62619 states and 254609 transitions. [2022-03-01 14:48:42,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 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-01 14:48:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 62619 states and 254609 transitions. [2022-03-01 14:48:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-03-01 14:48:42,532 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:48:42,532 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:48:42,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-01 14:48:42,532 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:48:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:48:42,533 INFO L85 PathProgramCache]: Analyzing trace with hash -433282584, now seen corresponding path program 2 times [2022-03-01 14:48:42,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:48:42,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435500203] [2022-03-01 14:48:42,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:48:42,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:48:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:48:43,286 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-01 14:48:43,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:48:43,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435500203] [2022-03-01 14:48:43,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435500203] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:48:43,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:48:43,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-01 14:48:43,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153870410] [2022-03-01 14:48:43,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:48:43,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-01 14:48:43,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:48:43,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-01 14:48:43,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-03-01 14:48:43,289 INFO L87 Difference]: Start difference. First operand 62619 states and 254609 transitions. Second operand has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 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-01 14:48:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:48:44,522 INFO L93 Difference]: Finished difference Result 82869 states and 335591 transitions. [2022-03-01 14:48:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 14:48:44,523 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 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 97 [2022-03-01 14:48:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:48:44,939 INFO L225 Difference]: With dead ends: 82869 [2022-03-01 14:48:44,940 INFO L226 Difference]: Without dead ends: 71229 [2022-03-01 14:48:44,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2022-03-01 14:48:44,940 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 450 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:48:44,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 1053 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:48:45,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71229 states. [2022-03-01 14:48:46,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71229 to 58755. [2022-03-01 14:48:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58755 states, 58754 states have (on average 4.051077373455424) internal successors, (238017), 58754 states have internal predecessors, (238017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58755 states to 58755 states and 238017 transitions. [2022-03-01 14:48:47,653 INFO L78 Accepts]: Start accepts. Automaton has 58755 states and 238017 transitions. Word has length 97 [2022-03-01 14:48:47,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:48:47,654 INFO L470 AbstractCegarLoop]: Abstraction has 58755 states and 238017 transitions. [2022-03-01 14:48:47,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.466666666666667) internal successors, (97), 15 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-01 14:48:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 58755 states and 238017 transitions. [2022-03-01 14:48:47,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-03-01 14:48:47,820 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:48:47,820 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:48:47,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-01 14:48:47,820 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:48:47,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:48:47,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1665972137, now seen corresponding path program 1 times [2022-03-01 14:48:47,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:48:47,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520067306] [2022-03-01 14:48:47,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:48:47,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:48:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:48:47,927 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-01 14:48:47,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:48:47,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520067306] [2022-03-01 14:48:47,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520067306] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:48:47,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:48:47,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-01 14:48:47,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250526099] [2022-03-01 14:48:47,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:48:47,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-01 14:48:47,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:48:47,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-01 14:48:47,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-03-01 14:48:47,929 INFO L87 Difference]: Start difference. First operand 58755 states and 238017 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 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-01 14:48:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:48:48,863 INFO L93 Difference]: Finished difference Result 50340 states and 199626 transitions. [2022-03-01 14:48:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-01 14:48:48,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 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 97 [2022-03-01 14:48:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:48:49,065 INFO L225 Difference]: With dead ends: 50340 [2022-03-01 14:48:49,066 INFO L226 Difference]: Without dead ends: 34781 [2022-03-01 14:48:49,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-03-01 14:48:49,066 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 612 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:48:49,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 600 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:48:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34781 states. [2022-03-01 14:48:49,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34781 to 30937. [2022-03-01 14:48:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30937 states, 30936 states have (on average 3.927592448926817) internal successors, (121504), 30936 states have internal predecessors, (121504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30937 states to 30937 states and 121504 transitions. [2022-03-01 14:48:50,168 INFO L78 Accepts]: Start accepts. Automaton has 30937 states and 121504 transitions. Word has length 97 [2022-03-01 14:48:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:48:50,169 INFO L470 AbstractCegarLoop]: Abstraction has 30937 states and 121504 transitions. [2022-03-01 14:48:50,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 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-01 14:48:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 30937 states and 121504 transitions. [2022-03-01 14:48:50,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-03-01 14:48:50,238 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:48:50,238 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:48:50,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-01 14:48:50,238 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:48:50,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:48:50,239 INFO L85 PathProgramCache]: Analyzing trace with hash 434045978, now seen corresponding path program 1 times [2022-03-01 14:48:50,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:48:50,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457170698] [2022-03-01 14:48:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:48:50,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:48:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:48:50,654 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-01 14:48:50,655 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:48:50,655 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457170698] [2022-03-01 14:48:50,655 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457170698] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:48:50,655 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:48:50,655 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-03-01 14:48:50,655 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334071080] [2022-03-01 14:48:50,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:48:50,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-01 14:48:50,656 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:48:50,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-01 14:48:50,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-03-01 14:48:50,657 INFO L87 Difference]: Start difference. First operand 30937 states and 121504 transitions. Second operand has 17 states, 17 states have (on average 6.0) internal successors, (102), 17 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-01 14:48:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:48:51,557 INFO L93 Difference]: Finished difference Result 36392 states and 143005 transitions. [2022-03-01 14:48:51,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-01 14:48:51,558 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.0) internal successors, (102), 17 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 102 [2022-03-01 14:48:51,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:48:51,721 INFO L225 Difference]: With dead ends: 36392 [2022-03-01 14:48:51,721 INFO L226 Difference]: Without dead ends: 35312 [2022-03-01 14:48:51,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=497, Unknown=0, NotChecked=0, Total=702 [2022-03-01 14:48:51,722 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 549 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:48:51,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 1150 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:48:51,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35312 states. [2022-03-01 14:48:52,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35312 to 29743. [2022-03-01 14:48:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29743 states, 29742 states have (on average 3.925761549324188) internal successors, (116760), 29742 states have internal predecessors, (116760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29743 states to 29743 states and 116760 transitions. [2022-03-01 14:48:52,749 INFO L78 Accepts]: Start accepts. Automaton has 29743 states and 116760 transitions. Word has length 102 [2022-03-01 14:48:52,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:48:52,751 INFO L470 AbstractCegarLoop]: Abstraction has 29743 states and 116760 transitions. [2022-03-01 14:48:52,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.0) internal successors, (102), 17 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-01 14:48:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 29743 states and 116760 transitions. [2022-03-01 14:48:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-03-01 14:48:52,819 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:48:52,820 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:48:52,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-01 14:48:52,820 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:48:52,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:48:52,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1412786124, now seen corresponding path program 1 times [2022-03-01 14:48:52,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:48:52,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089620021] [2022-03-01 14:48:52,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:48:52,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:48:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:48:53,269 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-01 14:48:53,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:48:53,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089620021] [2022-03-01 14:48:53,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089620021] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:48:53,270 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:48:53,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-01 14:48:53,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402698183] [2022-03-01 14:48:53,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:48:53,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-01 14:48:53,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:48:53,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-01 14:48:53,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-03-01 14:48:53,271 INFO L87 Difference]: Start difference. First operand 29743 states and 116760 transitions. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-01 14:48:53,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:48:53,723 INFO L93 Difference]: Finished difference Result 24937 states and 97482 transitions. [2022-03-01 14:48:53,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 14:48:53,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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 102 [2022-03-01 14:48:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:48:53,765 INFO L225 Difference]: With dead ends: 24937 [2022-03-01 14:48:53,765 INFO L226 Difference]: Without dead ends: 12189 [2022-03-01 14:48:53,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2022-03-01 14:48:53,766 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 591 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:48:53,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [591 Valid, 632 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:48:53,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12189 states. [2022-03-01 14:48:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12189 to 10173. [2022-03-01 14:48:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10173 states, 10172 states have (on average 3.887337790011797) internal successors, (39542), 10172 states have internal predecessors, (39542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:54,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10173 states to 10173 states and 39542 transitions. [2022-03-01 14:48:54,014 INFO L78 Accepts]: Start accepts. Automaton has 10173 states and 39542 transitions. Word has length 102 [2022-03-01 14:48:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:48:54,015 INFO L470 AbstractCegarLoop]: Abstraction has 10173 states and 39542 transitions. [2022-03-01 14:48:54,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 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-01 14:48:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand 10173 states and 39542 transitions. [2022-03-01 14:48:54,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-03-01 14:48:54,041 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:48:54,042 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:48:54,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-01 14:48:54,042 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:48:54,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:48:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash 793832288, now seen corresponding path program 1 times [2022-03-01 14:48:54,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:48:54,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760910411] [2022-03-01 14:48:54,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:48:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:48:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:48:54,315 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-01 14:48:54,315 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:48:54,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760910411] [2022-03-01 14:48:54,316 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760910411] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:48:54,316 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:48:54,316 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-01 14:48:54,316 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006983135] [2022-03-01 14:48:54,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:48:54,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 14:48:54,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:48:54,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 14:48:54,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-01 14:48:54,317 INFO L87 Difference]: Start difference. First operand 10173 states and 39542 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 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-01 14:48:54,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:48:54,555 INFO L93 Difference]: Finished difference Result 14638 states and 56165 transitions. [2022-03-01 14:48:54,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 14:48:54,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 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 107 [2022-03-01 14:48:54,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:48:54,584 INFO L225 Difference]: With dead ends: 14638 [2022-03-01 14:48:54,585 INFO L226 Difference]: Without dead ends: 7329 [2022-03-01 14:48:54,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-03-01 14:48:54,586 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 108 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:48:54,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 865 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:48:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7329 states. [2022-03-01 14:48:54,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7329 to 7329. [2022-03-01 14:48:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7329 states, 7328 states have (on average 3.7502729257641922) internal successors, (27482), 7328 states have internal predecessors, (27482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7329 states to 7329 states and 27482 transitions. [2022-03-01 14:48:54,811 INFO L78 Accepts]: Start accepts. Automaton has 7329 states and 27482 transitions. Word has length 107 [2022-03-01 14:48:54,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:48:54,812 INFO L470 AbstractCegarLoop]: Abstraction has 7329 states and 27482 transitions. [2022-03-01 14:48:54,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 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-01 14:48:54,812 INFO L276 IsEmpty]: Start isEmpty. Operand 7329 states and 27482 transitions. [2022-03-01 14:48:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-03-01 14:48:54,830 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:48:54,830 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:48:54,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-01 14:48:54,830 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:48:54,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:48:54,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1431721824, now seen corresponding path program 2 times [2022-03-01 14:48:54,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:48:54,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477765293] [2022-03-01 14:48:54,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:48:54,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:48:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:48:54,950 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-01 14:48:54,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:48:54,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477765293] [2022-03-01 14:48:54,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477765293] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:48:54,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:48:54,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-01 14:48:54,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957555418] [2022-03-01 14:48:54,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:48:54,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-01 14:48:54,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:48:54,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-01 14:48:54,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-03-01 14:48:54,952 INFO L87 Difference]: Start difference. First operand 7329 states and 27482 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 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-01 14:48:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:48:55,167 INFO L93 Difference]: Finished difference Result 10770 states and 40282 transitions. [2022-03-01 14:48:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 14:48:55,168 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 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 107 [2022-03-01 14:48:55,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:48:55,184 INFO L225 Difference]: With dead ends: 10770 [2022-03-01 14:48:55,185 INFO L226 Difference]: Without dead ends: 4557 [2022-03-01 14:48:55,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-03-01 14:48:55,185 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 101 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-01 14:48:55,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 754 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-01 14:48:55,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4557 states. [2022-03-01 14:48:55,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4557 to 4557. [2022-03-01 14:48:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4557 states, 4556 states have (on average 3.5463125548726953) internal successors, (16157), 4556 states have internal predecessors, (16157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4557 states to 4557 states and 16157 transitions. [2022-03-01 14:48:55,445 INFO L78 Accepts]: Start accepts. Automaton has 4557 states and 16157 transitions. Word has length 107 [2022-03-01 14:48:55,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:48:55,445 INFO L470 AbstractCegarLoop]: Abstraction has 4557 states and 16157 transitions. [2022-03-01 14:48:55,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 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-01 14:48:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4557 states and 16157 transitions. [2022-03-01 14:48:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-03-01 14:48:55,456 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:48:55,456 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:48:55,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-01 14:48:55,456 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:48:55,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:48:55,457 INFO L85 PathProgramCache]: Analyzing trace with hash 593015748, now seen corresponding path program 3 times [2022-03-01 14:48:55,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:48:55,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72179578] [2022-03-01 14:48:55,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:48:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:48:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 14:48:55,842 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-01 14:48:55,842 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 14:48:55,842 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72179578] [2022-03-01 14:48:55,842 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72179578] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 14:48:55,843 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 14:48:55,843 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-01 14:48:55,843 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019766292] [2022-03-01 14:48:55,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 14:48:55,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-01 14:48:55,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 14:48:55,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-01 14:48:55,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-03-01 14:48:55,844 INFO L87 Difference]: Start difference. First operand 4557 states and 16157 transitions. Second operand has 16 states, 16 states have (on average 6.6875) internal successors, (107), 16 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-01 14:48:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-01 14:48:56,124 INFO L93 Difference]: Finished difference Result 7110 states and 25743 transitions. [2022-03-01 14:48:56,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 14:48:56,125 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.6875) internal successors, (107), 16 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 107 [2022-03-01 14:48:56,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-01 14:48:56,136 INFO L225 Difference]: With dead ends: 7110 [2022-03-01 14:48:56,136 INFO L226 Difference]: Without dead ends: 3857 [2022-03-01 14:48:56,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-03-01 14:48:56,137 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 397 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-01 14:48:56,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 1221 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-01 14:48:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3857 states. [2022-03-01 14:48:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3857 to 3857. [2022-03-01 14:48:56,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3857 states, 3856 states have (on average 3.587396265560166) internal successors, (13833), 3856 states have internal predecessors, (13833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 14:48:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3857 states to 3857 states and 13833 transitions. [2022-03-01 14:48:56,213 INFO L78 Accepts]: Start accepts. Automaton has 3857 states and 13833 transitions. Word has length 107 [2022-03-01 14:48:56,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-01 14:48:56,213 INFO L470 AbstractCegarLoop]: Abstraction has 3857 states and 13833 transitions. [2022-03-01 14:48:56,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.6875) internal successors, (107), 16 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-01 14:48:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3857 states and 13833 transitions. [2022-03-01 14:48:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-03-01 14:48:56,220 INFO L506 BasicCegarLoop]: Found error trace [2022-03-01 14:48:56,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:48:56,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-01 14:48:56,221 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-03-01 14:48:56,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 14:48:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash -741625468, now seen corresponding path program 4 times [2022-03-01 14:48:56,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 14:48:56,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565796671] [2022-03-01 14:48:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 14:48:56,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 14:48:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 14:48:56,296 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-01 14:48:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-01 14:48:56,412 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-01 14:48:56,412 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-01 14:48:56,414 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-03-01 14:48:56,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-03-01 14:48:56,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-03-01 14:48:56,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-03-01 14:48:56,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-03-01 14:48:56,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-03-01 14:48:56,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-03-01 14:48:56,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-01 14:48:56,419 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-01 14:48:56,424 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-01 14:48:56,424 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 14:48:56,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 02:48:56 BasicIcfg [2022-03-01 14:48:56,587 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 14:48:56,588 INFO L158 Benchmark]: Toolchain (without parser) took 103868.22ms. Allocated memory was 182.5MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 124.1MB in the beginning and 5.2GB in the end (delta: -5.1GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-03-01 14:48:56,588 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 14:48:56,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.49ms. Allocated memory was 182.5MB in the beginning and 247.5MB in the end (delta: 65.0MB). Free memory was 124.0MB in the beginning and 205.9MB in the end (delta: -81.9MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. [2022-03-01 14:48:56,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.00ms. Allocated memory is still 247.5MB. Free memory was 205.9MB in the beginning and 202.2MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-01 14:48:56,589 INFO L158 Benchmark]: Boogie Preprocessor took 42.76ms. Allocated memory is still 247.5MB. Free memory was 202.2MB in the beginning and 200.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 14:48:56,589 INFO L158 Benchmark]: RCFGBuilder took 1068.17ms. Allocated memory is still 247.5MB. Free memory was 200.1MB in the beginning and 201.6MB in the end (delta: -1.5MB). Peak memory consumption was 88.6MB. Max. memory is 8.0GB. [2022-03-01 14:48:56,593 INFO L158 Benchmark]: TraceAbstraction took 102059.51ms. Allocated memory was 247.5MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 201.1MB in the beginning and 5.2GB in the end (delta: -5.0GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-03-01 14:48:56,596 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.12ms. Allocated memory is still 182.5MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 603.49ms. Allocated memory was 182.5MB in the beginning and 247.5MB in the end (delta: 65.0MB). Free memory was 124.0MB in the beginning and 205.9MB in the end (delta: -81.9MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 89.00ms. Allocated memory is still 247.5MB. Free memory was 205.9MB in the beginning and 202.2MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.76ms. Allocated memory is still 247.5MB. Free memory was 202.2MB in the beginning and 200.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1068.17ms. Allocated memory is still 247.5MB. Free memory was 200.1MB in the beginning and 201.6MB in the end (delta: -1.5MB). Peak memory consumption was 88.6MB. Max. memory is 8.0GB. * TraceAbstraction took 102059.51ms. Allocated memory was 247.5MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 201.1MB in the beginning and 5.2GB in the end (delta: -5.0GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L725] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L726] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L727] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L728] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L729] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L730] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L731] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L732] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L733] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L734] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L735] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L736] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L737] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L738] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L739] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L740] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L741] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L742] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L744] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t489; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t489, ((void *)0), P0, ((void *)0))=-3, t489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t490; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t489={5:0}, t490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t490, ((void *)0), P1, ((void *)0))=-2, t489={5:0}, t490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t491; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t489={5:0}, t490={6:0}, t491={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t491, ((void *)0), P2, ((void *)0))=-1, t489={5:0}, t490={6:0}, t491={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L859] 0 pthread_t t492; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t492, ((void *)0), P3, ((void *)0))=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L752] 1 a = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L755] 1 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L831] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L866] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 175 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 101.7s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 3.7s, AutomataDifference: 35.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6122 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6122 mSDsluCounter, 15766 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13591 mSDsCounter, 433 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2866 IncrementalHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 433 mSolverCounterUnsat, 3114 mSDtfsCounter, 2866 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129056occurred in iteration=0, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 53.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 45077 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1802 NumberOfCodeBlocks, 1802 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1677 ConstructedInterpolants, 0 QuantifiedInterpolants, 11894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2022-03-01 14:48:56,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...