/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 17:52:07,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 17:52:07,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 17:52:07,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 17:52:07,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 17:52:07,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 17:52:07,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 17:52:07,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 17:52:07,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 17:52:07,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 17:52:07,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 17:52:07,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 17:52:07,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 17:52:07,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 17:52:07,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 17:52:07,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 17:52:07,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 17:52:07,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 17:52:07,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 17:52:07,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 17:52:07,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 17:52:07,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 17:52:07,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 17:52:07,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 17:52:07,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 17:52:07,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 17:52:07,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 17:52:07,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 17:52:07,550 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 17:52:07,551 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 17:52:07,551 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 17:52:07,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 17:52:07,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 17:52:07,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 17:52:07,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 17:52:07,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 17:52:07,554 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 17:52:07,554 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 17:52:07,554 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 17:52:07,555 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 17:52:07,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 17:52:07,556 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 17:52:07,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 17:52:07,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 17:52:07,583 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 17:52:07,583 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 17:52:07,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 17:52:07,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 17:52:07,583 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 17:52:07,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 17:52:07,584 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 17:52:07,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 17:52:07,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 17:52:07,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 17:52:07,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 17:52:07,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 17:52:07,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 17:52:07,585 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 17:52:07,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 17:52:07,585 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 17:52:07,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 17:52:07,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 17:52:07,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 17:52:07,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 17:52:07,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 17:52:07,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:52:07,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 17:52:07,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 17:52:07,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 17:52:07,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 17:52:07,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 17:52:07,587 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 17:52:07,587 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 17:52:07,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 17:52:07,587 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 17:52:07,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 17:52:07,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 17:52:07,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 17:52:07,787 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 17:52:07,788 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 17:52:07,788 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2022-03-15 17:52:07,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c8de249/4a7f88a3773b4f0eba3047bca471a14f/FLAG881dbd4e7 [2022-03-15 17:52:08,200 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 17:52:08,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_pso.opt_tso.opt.i [2022-03-15 17:52:08,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c8de249/4a7f88a3773b4f0eba3047bca471a14f/FLAG881dbd4e7 [2022-03-15 17:52:08,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c8de249/4a7f88a3773b4f0eba3047bca471a14f [2022-03-15 17:52:08,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 17:52:08,593 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 17:52:08,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 17:52:08,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 17:52:08,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 17:52:08,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:52:08" (1/1) ... [2022-03-15 17:52:08,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75b7059c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:08, skipping insertion in model container [2022-03-15 17:52:08,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 05:52:08" (1/1) ... [2022-03-15 17:52:08,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 17:52:08,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 17:52:08,818 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/mix035_pso.opt_tso.opt.i[956,969] [2022-03-15 17:52:09,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:52:09,009 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 17:52:09,020 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/mix035_pso.opt_tso.opt.i[956,969] [2022-03-15 17:52:09,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 17:52:09,099 INFO L208 MainTranslator]: Completed translation [2022-03-15 17:52:09,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:09 WrapperNode [2022-03-15 17:52:09,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 17:52:09,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 17:52:09,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 17:52:09,100 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 17:52:09,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:09" (1/1) ... [2022-03-15 17:52:09,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:09" (1/1) ... [2022-03-15 17:52:09,152 INFO L137 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 185 [2022-03-15 17:52:09,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 17:52:09,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 17:52:09,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 17:52:09,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 17:52:09,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:09" (1/1) ... [2022-03-15 17:52:09,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:09" (1/1) ... [2022-03-15 17:52:09,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:09" (1/1) ... [2022-03-15 17:52:09,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:09" (1/1) ... [2022-03-15 17:52:09,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:09" (1/1) ... [2022-03-15 17:52:09,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:09" (1/1) ... [2022-03-15 17:52:09,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:09" (1/1) ... [2022-03-15 17:52:09,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 17:52:09,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 17:52:09,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 17:52:09,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 17:52:09,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:09" (1/1) ... [2022-03-15 17:52:09,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 17:52:09,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 17:52:09,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 17:52:09,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 17:52:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 17:52:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 17:52:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 17:52:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 17:52:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 17:52:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-03-15 17:52:09,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-03-15 17:52:09,259 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-03-15 17:52:09,259 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-03-15 17:52:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-03-15 17:52:09,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-03-15 17:52:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 17:52:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 17:52:09,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 17:52:09,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 17:52:09,261 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 17:52:09,406 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 17:52:09,407 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 17:52:09,776 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 17:52:09,986 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 17:52:09,986 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 17:52:09,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:52:09 BoogieIcfgContainer [2022-03-15 17:52:09,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 17:52:09,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 17:52:09,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 17:52:09,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 17:52:09,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 05:52:08" (1/3) ... [2022-03-15 17:52:09,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5c7c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:52:09, skipping insertion in model container [2022-03-15 17:52:09,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 05:52:09" (2/3) ... [2022-03-15 17:52:09,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5c7c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 05:52:09, skipping insertion in model container [2022-03-15 17:52:09,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 05:52:09" (3/3) ... [2022-03-15 17:52:09,993 INFO L111 eAbstractionObserver]: Analyzing ICFG mix035_pso.opt_tso.opt.i [2022-03-15 17:52:09,997 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 17:52:09,997 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 17:52:09,998 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-15 17:52:09,998 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 17:52:10,030 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,030 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,030 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,030 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,030 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,031 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,031 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,031 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,031 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,031 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,031 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,031 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,032 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,032 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,033 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,033 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,033 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,033 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,033 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,033 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,033 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,034 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,034 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,034 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,034 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,034 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,034 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,035 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,035 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,035 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,035 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,035 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,035 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,035 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,035 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,036 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,037 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,041 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,041 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,041 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,041 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,041 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,041 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,041 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,041 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,041 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,041 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,041 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,041 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,042 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,042 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,042 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,042 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,042 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,042 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,042 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,042 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,042 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,043 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,043 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,043 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,043 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,043 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,043 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,044 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,044 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,044 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,045 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,045 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,046 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,050 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,050 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,050 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,050 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,050 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,052 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,052 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,052 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,052 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,053 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,054 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,054 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,054 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,054 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,054 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,054 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,054 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,054 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,054 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,055 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,056 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,057 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,058 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,058 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,058 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,058 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,060 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,060 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,060 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,060 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,061 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,061 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,061 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,061 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,061 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,061 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,062 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,062 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,062 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,062 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,062 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,062 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,062 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,062 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,062 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,062 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,062 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,063 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,063 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,063 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,064 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,064 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,064 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,064 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,064 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,064 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,064 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,064 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,065 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,065 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,065 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,065 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,065 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,065 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,065 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,065 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,065 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,065 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,065 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 17:52:10,065 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-15 17:52:10,093 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 17:52:10,098 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 17:52:10,098 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-15 17:52:10,107 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 17:52:10,116 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 118 transitions, 251 flow [2022-03-15 17:52:10,121 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 118 transitions, 251 flow [2022-03-15 17:52:10,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2022-03-15 17:52:10,164 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2022-03-15 17:52:10,164 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-03-15 17:52:10,168 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-03-15 17:52:10,171 INFO L116 LiptonReduction]: Number of co-enabled transitions 2016 [2022-03-15 17:52:13,619 INFO L131 LiptonReduction]: Checked pairs total: 4679 [2022-03-15 17:52:13,619 INFO L133 LiptonReduction]: Total number of compositions: 104 [2022-03-15 17:52:13,624 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2022-03-15 17:52:13,666 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 522 states, 519 states have (on average 3.052023121387283) internal successors, (1584), 521 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 522 states, 519 states have (on average 3.052023121387283) internal successors, (1584), 521 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-03-15 17:52:13,673 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:13,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:13,674 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:13,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:13,677 INFO L85 PathProgramCache]: Analyzing trace with hash -91756949, now seen corresponding path program 1 times [2022-03-15 17:52:13,689 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:13,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758879397] [2022-03-15 17:52:13,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:13,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:13,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:13,868 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:13,868 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758879397] [2022-03-15 17:52:13,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758879397] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:13,868 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:13,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:52:13,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2068308500] [2022-03-15 17:52:13,870 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:13,871 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:13,881 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2022-03-15 17:52:13,881 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:13,884 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:13,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:52:13,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:13,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:52:13,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:52:13,908 INFO L87 Difference]: Start difference. First operand has 522 states, 519 states have (on average 3.052023121387283) internal successors, (1584), 521 states have internal predecessors, (1584), 0 states have call successors, (0), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:13,980 INFO L93 Difference]: Finished difference Result 442 states and 1320 transitions. [2022-03-15 17:52:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:52:13,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-03-15 17:52:13,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:13,997 INFO L225 Difference]: With dead ends: 442 [2022-03-15 17:52:13,997 INFO L226 Difference]: Without dead ends: 426 [2022-03-15 17:52:13,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-15 17:52:14,001 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:14,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:52:14,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-03-15 17:52:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2022-03-15 17:52:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 3.011764705882353) internal successors, (1280), 425 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1280 transitions. [2022-03-15 17:52:14,049 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1280 transitions. Word has length 7 [2022-03-15 17:52:14,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:14,049 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 1280 transitions. [2022-03-15 17:52:14,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1280 transitions. [2022-03-15 17:52:14,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-03-15 17:52:14,050 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:14,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:14,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 17:52:14,050 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:14,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:14,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2015986698, now seen corresponding path program 1 times [2022-03-15 17:52:14,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:14,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688326095] [2022-03-15 17:52:14,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:14,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:14,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:14,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688326095] [2022-03-15 17:52:14,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688326095] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:14,173 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:14,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 17:52:14,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [260521571] [2022-03-15 17:52:14,173 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:14,174 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:14,175 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2022-03-15 17:52:14,175 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:14,175 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:14,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 17:52:14,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:14,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 17:52:14,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 17:52:14,187 INFO L87 Difference]: Start difference. First operand 426 states and 1280 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:14,229 INFO L93 Difference]: Finished difference Result 418 states and 1248 transitions. [2022-03-15 17:52:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:52:14,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-03-15 17:52:14,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:14,233 INFO L225 Difference]: With dead ends: 418 [2022-03-15 17:52:14,234 INFO L226 Difference]: Without dead ends: 418 [2022-03-15 17:52:14,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-15 17:52:14,235 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:14,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 2 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:52:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-03-15 17:52:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2022-03-15 17:52:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.9928057553956835) internal successors, (1248), 417 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1248 transitions. [2022-03-15 17:52:14,271 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1248 transitions. Word has length 9 [2022-03-15 17:52:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:14,271 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 1248 transitions. [2022-03-15 17:52:14,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1248 transitions. [2022-03-15 17:52:14,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 17:52:14,273 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:14,274 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:14,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 17:52:14,274 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:14,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:14,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1310034986, now seen corresponding path program 1 times [2022-03-15 17:52:14,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:14,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659943059] [2022-03-15 17:52:14,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:14,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:14,349 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:14,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659943059] [2022-03-15 17:52:14,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659943059] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:14,349 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:14,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 17:52:14,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1097911556] [2022-03-15 17:52:14,349 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:14,350 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:14,352 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2022-03-15 17:52:14,352 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:15,692 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3731#(or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)))] [2022-03-15 17:52:15,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:52:15,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:15,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:52:15,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:15,693 INFO L87 Difference]: Start difference. First operand 418 states and 1248 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:15,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:15,734 INFO L93 Difference]: Finished difference Result 394 states and 1168 transitions. [2022-03-15 17:52:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 17:52:15,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 11 [2022-03-15 17:52:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:15,737 INFO L225 Difference]: With dead ends: 394 [2022-03-15 17:52:15,737 INFO L226 Difference]: Without dead ends: 394 [2022-03-15 17:52:15,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:15,738 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:15,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 2 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 17:52:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-03-15 17:52:15,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2022-03-15 17:52:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 2.9720101781170483) internal successors, (1168), 393 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1168 transitions. [2022-03-15 17:52:15,750 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1168 transitions. Word has length 11 [2022-03-15 17:52:15,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:15,750 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 1168 transitions. [2022-03-15 17:52:15,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:15,750 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1168 transitions. [2022-03-15 17:52:15,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 17:52:15,751 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:15,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:15,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 17:52:15,751 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:15,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash 332916225, now seen corresponding path program 1 times [2022-03-15 17:52:15,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:15,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320434332] [2022-03-15 17:52:15,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:15,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:15,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:15,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320434332] [2022-03-15 17:52:15,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320434332] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:15,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:15,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 17:52:15,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [761475613] [2022-03-15 17:52:15,802 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:15,803 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:15,804 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2022-03-15 17:52:15,804 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:15,804 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:15,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 17:52:15,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:15,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 17:52:15,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-15 17:52:15,805 INFO L87 Difference]: Start difference. First operand 394 states and 1168 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:15,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:15,868 INFO L93 Difference]: Finished difference Result 373 states and 969 transitions. [2022-03-15 17:52:15,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 17:52:15,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-03-15 17:52:15,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:15,870 INFO L225 Difference]: With dead ends: 373 [2022-03-15 17:52:15,870 INFO L226 Difference]: Without dead ends: 277 [2022-03-15 17:52:15,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:15,871 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:15,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 10 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-03-15 17:52:15,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2022-03-15 17:52:15,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 2.536231884057971) internal successors, (700), 276 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 700 transitions. [2022-03-15 17:52:15,876 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 700 transitions. Word has length 11 [2022-03-15 17:52:15,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:15,877 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 700 transitions. [2022-03-15 17:52:15,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 700 transitions. [2022-03-15 17:52:15,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 17:52:15,878 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:15,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:15,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-15 17:52:15,878 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:15,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:15,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1012896352, now seen corresponding path program 1 times [2022-03-15 17:52:15,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:15,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183841050] [2022-03-15 17:52:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:15,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:15,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:15,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183841050] [2022-03-15 17:52:15,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183841050] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:15,955 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:15,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:52:15,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1391028015] [2022-03-15 17:52:15,955 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:15,957 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:15,961 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2022-03-15 17:52:15,961 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:16,720 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:16,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 17:52:16,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:16,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 17:52:16,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-15 17:52:16,721 INFO L87 Difference]: Start difference. First operand 277 states and 700 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:16,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:16,803 INFO L93 Difference]: Finished difference Result 223 states and 513 transitions. [2022-03-15 17:52:16,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 17:52:16,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 17:52:16,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:16,804 INFO L225 Difference]: With dead ends: 223 [2022-03-15 17:52:16,804 INFO L226 Difference]: Without dead ends: 172 [2022-03-15 17:52:16,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:52:16,805 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 37 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:16,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 14 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:16,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-03-15 17:52:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-03-15 17:52:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 2.2514619883040936) internal successors, (385), 171 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:16,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 385 transitions. [2022-03-15 17:52:16,809 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 385 transitions. Word has length 14 [2022-03-15 17:52:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:16,809 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 385 transitions. [2022-03-15 17:52:16,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 385 transitions. [2022-03-15 17:52:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 17:52:16,810 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:16,810 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:16,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-15 17:52:16,810 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:16,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:16,810 INFO L85 PathProgramCache]: Analyzing trace with hash -630189650, now seen corresponding path program 1 times [2022-03-15 17:52:16,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:16,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003583312] [2022-03-15 17:52:16,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:16,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:16,885 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:16,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003583312] [2022-03-15 17:52:16,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003583312] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:16,885 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:16,885 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:52:16,885 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2088912264] [2022-03-15 17:52:16,885 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:16,887 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:16,892 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 25 transitions. [2022-03-15 17:52:16,892 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:17,467 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:17,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:52:17,467 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:17,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:52:17,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:52:17,468 INFO L87 Difference]: Start difference. First operand 172 states and 385 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:17,547 INFO L93 Difference]: Finished difference Result 153 states and 345 transitions. [2022-03-15 17:52:17,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:52:17,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 17:52:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:17,548 INFO L225 Difference]: With dead ends: 153 [2022-03-15 17:52:17,548 INFO L226 Difference]: Without dead ends: 141 [2022-03-15 17:52:17,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-03-15 17:52:17,549 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 67 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:17,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 14 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:17,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-03-15 17:52:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-03-15 17:52:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.307142857142857) internal successors, (323), 140 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 323 transitions. [2022-03-15 17:52:17,552 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 323 transitions. Word has length 17 [2022-03-15 17:52:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:17,553 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 323 transitions. [2022-03-15 17:52:17,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 323 transitions. [2022-03-15 17:52:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 17:52:17,553 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:17,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:17,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-15 17:52:17,554 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:17,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1851279258, now seen corresponding path program 1 times [2022-03-15 17:52:17,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:17,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46615915] [2022-03-15 17:52:17,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:17,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:17,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:17,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46615915] [2022-03-15 17:52:17,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46615915] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:17,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:17,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-15 17:52:17,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1959258289] [2022-03-15 17:52:17,654 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:17,656 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:17,664 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 40 transitions. [2022-03-15 17:52:17,664 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:18,434 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 17:52:18,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:52:18,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:18,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:52:18,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:52:18,435 INFO L87 Difference]: Start difference. First operand 141 states and 323 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:18,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:18,530 INFO L93 Difference]: Finished difference Result 245 states and 549 transitions. [2022-03-15 17:52:18,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:52:18,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 17:52:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:18,531 INFO L225 Difference]: With dead ends: 245 [2022-03-15 17:52:18,531 INFO L226 Difference]: Without dead ends: 211 [2022-03-15 17:52:18,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:52:18,532 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:18,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 8 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:18,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-03-15 17:52:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 129. [2022-03-15 17:52:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.2421875) internal successors, (287), 128 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 287 transitions. [2022-03-15 17:52:18,535 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 287 transitions. Word has length 20 [2022-03-15 17:52:18,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:18,536 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 287 transitions. [2022-03-15 17:52:18,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 287 transitions. [2022-03-15 17:52:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 17:52:18,536 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:18,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:18,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-15 17:52:18,536 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:18,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:18,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1169264352, now seen corresponding path program 2 times [2022-03-15 17:52:18,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:18,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832016158] [2022-03-15 17:52:18,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:18,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:18,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:18,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832016158] [2022-03-15 17:52:18,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832016158] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:18,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:18,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:52:18,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [551188649] [2022-03-15 17:52:18,590 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:18,593 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:18,606 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 134 transitions. [2022-03-15 17:52:18,606 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:20,577 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [7383#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~x~0 0)))] [2022-03-15 17:52:20,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 17:52:20,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:20,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 17:52:20,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-03-15 17:52:20,578 INFO L87 Difference]: Start difference. First operand 129 states and 287 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:20,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:20,674 INFO L93 Difference]: Finished difference Result 179 states and 387 transitions. [2022-03-15 17:52:20,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 17:52:20,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 17:52:20,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:20,675 INFO L225 Difference]: With dead ends: 179 [2022-03-15 17:52:20,675 INFO L226 Difference]: Without dead ends: 93 [2022-03-15 17:52:20,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-15 17:52:20,675 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 41 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:20,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 4 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:20,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-03-15 17:52:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-03-15 17:52:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.010869565217391) internal successors, (185), 92 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:20,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 185 transitions. [2022-03-15 17:52:20,678 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 185 transitions. Word has length 20 [2022-03-15 17:52:20,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:20,678 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 185 transitions. [2022-03-15 17:52:20,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:20,678 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 185 transitions. [2022-03-15 17:52:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 17:52:20,679 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:20,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:20,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-15 17:52:20,679 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:20,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash -900440800, now seen corresponding path program 3 times [2022-03-15 17:52:20,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:20,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310490610] [2022-03-15 17:52:20,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:20,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 17:52:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 17:52:20,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 17:52:20,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310490610] [2022-03-15 17:52:20,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310490610] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 17:52:20,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 17:52:20,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 17:52:20,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2089706651] [2022-03-15 17:52:20,756 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 17:52:20,760 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 17:52:20,766 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 38 transitions. [2022-03-15 17:52:20,766 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 17:52:21,952 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [7765#(and (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff1_thd2~0 256) 0) (not (= (mod ~y$r_buff0_thd2~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y~0 1)) (or (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (= ~y~0 1)) (or (= (mod ~y$w_buff0_used~0 256) 0) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff0~0 1))), 7764#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (not (= (mod ~y$r_buff0_thd3~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$w_buff0~0 1))] [2022-03-15 17:52:21,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 17:52:21,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 17:52:21,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 17:52:21,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-03-15 17:52:21,953 INFO L87 Difference]: Start difference. First operand 93 states and 185 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 17:52:22,053 INFO L93 Difference]: Finished difference Result 103 states and 199 transitions. [2022-03-15 17:52:22,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 17:52:22,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-03-15 17:52:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 17:52:22,054 INFO L225 Difference]: With dead ends: 103 [2022-03-15 17:52:22,054 INFO L226 Difference]: Without dead ends: 81 [2022-03-15 17:52:22,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-03-15 17:52:22,054 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 17:52:22,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 18 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 17:52:22,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-03-15 17:52:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-03-15 17:52:22,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.9625) internal successors, (157), 80 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 157 transitions. [2022-03-15 17:52:22,056 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 157 transitions. Word has length 20 [2022-03-15 17:52:22,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 17:52:22,056 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 157 transitions. [2022-03-15 17:52:22,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 17:52:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 157 transitions. [2022-03-15 17:52:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 17:52:22,057 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 17:52:22,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:22,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-15 17:52:22,057 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-03-15 17:52:22,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 17:52:22,057 INFO L85 PathProgramCache]: Analyzing trace with hash -293500860, now seen corresponding path program 4 times [2022-03-15 17:52:22,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 17:52:22,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124111273] [2022-03-15 17:52:22,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 17:52:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 17:52:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:52:22,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-03-15 17:52:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-03-15 17:52:22,133 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-03-15 17:52:22,133 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-03-15 17:52:22,133 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-03-15 17:52:22,134 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-03-15 17:52:22,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-03-15 17:52:22,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-03-15 17:52:22,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-03-15 17:52:22,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-15 17:52:22,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-15 17:52:22,137 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-03-15 17:52:22,140 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 17:52:22,140 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 17:52:22,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 05:52:22 BasicIcfg [2022-03-15 17:52:22,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 17:52:22,212 INFO L158 Benchmark]: Toolchain (without parser) took 13618.55ms. Allocated memory was 178.3MB in the beginning and 488.6MB in the end (delta: 310.4MB). Free memory was 126.2MB in the beginning and 451.6MB in the end (delta: -325.4MB). Peak memory consumption was 271.4MB. Max. memory is 8.0GB. [2022-03-15 17:52:22,212 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory was 144.0MB in the beginning and 143.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 17:52:22,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.35ms. Allocated memory is still 178.3MB. Free memory was 126.0MB in the beginning and 141.3MB in the end (delta: -15.3MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. [2022-03-15 17:52:22,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.77ms. Allocated memory is still 178.3MB. Free memory was 141.3MB in the beginning and 138.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-15 17:52:22,212 INFO L158 Benchmark]: Boogie Preprocessor took 21.59ms. Allocated memory is still 178.3MB. Free memory was 138.6MB in the beginning and 136.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 17:52:22,213 INFO L158 Benchmark]: RCFGBuilder took 812.21ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 136.9MB in the beginning and 164.1MB in the end (delta: -27.1MB). Peak memory consumption was 45.7MB. Max. memory is 8.0GB. [2022-03-15 17:52:22,213 INFO L158 Benchmark]: TraceAbstraction took 12222.73ms. Allocated memory was 213.9MB in the beginning and 488.6MB in the end (delta: 274.7MB). Free memory was 163.5MB in the beginning and 451.6MB in the end (delta: -288.1MB). Peak memory consumption was 272.7MB. Max. memory is 8.0GB. [2022-03-15 17:52:22,214 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.10ms. Allocated memory is still 178.3MB. Free memory was 144.0MB in the beginning and 143.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 505.35ms. Allocated memory is still 178.3MB. Free memory was 126.0MB in the beginning and 141.3MB in the end (delta: -15.3MB). Peak memory consumption was 13.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.77ms. Allocated memory is still 178.3MB. Free memory was 141.3MB in the beginning and 138.6MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.59ms. Allocated memory is still 178.3MB. Free memory was 138.6MB in the beginning and 136.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 812.21ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 136.9MB in the beginning and 164.1MB in the end (delta: -27.1MB). Peak memory consumption was 45.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12222.73ms. Allocated memory was 213.9MB in the beginning and 488.6MB in the end (delta: 274.7MB). Free memory was 163.5MB in the beginning and 451.6MB in the end (delta: -288.1MB). Peak memory consumption was 272.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 126 PlacesBefore, 35 PlacesAfterwards, 118 TransitionsBefore, 25 TransitionsAfterwards, 2016 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 4679 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2209, positive: 2048, positive conditional: 0, positive unconditional: 2048, negative: 161, negative conditional: 0, negative unconditional: 161, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1112, positive: 1075, positive conditional: 0, positive unconditional: 1075, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2209, positive: 973, positive conditional: 0, positive unconditional: 973, negative: 124, negative conditional: 0, negative unconditional: 124, unknown: 1112, unknown conditional: 0, unknown unconditional: 1112] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t922; [L836] FCALL, FORK 0 pthread_create(&t922, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t922, ((void *)0), P0, ((void *)0))=-3, t922={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t923; [L838] FCALL, FORK 0 pthread_create(&t923, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t923, ((void *)0), P1, ((void *)0))=-2, t922={5:0}, t923={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] 0 pthread_t t924; [L840] FCALL, FORK 0 pthread_create(&t924, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t924, ((void *)0), P2, ((void *)0))=-1, t922={5:0}, t923={6:0}, t924={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 y$w_buff1 = y$w_buff0 [L793] 3 y$w_buff0 = 1 [L794] 3 y$w_buff1_used = y$w_buff0_used [L795] 3 y$w_buff0_used = (_Bool)1 [L796] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L796] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L797] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L798] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L799] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L800] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L801] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 3 z = 1 [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y [L771] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L771] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L772] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L772] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L773] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L774] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L775] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L776] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L776] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L777] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L777] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y [L779] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L847] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L849] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L850] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 836]: 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: 838]: 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: 840]: 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 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 387 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 709 IncrementalHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 29 mSDtfsCounter, 709 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=522occurred in iteration=0, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 82 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-15 17:52:22,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...