/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-bc289cb [2022-01-28 12:18:07,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-28 12:18:07,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-28 12:18:07,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-28 12:18:07,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-28 12:18:07,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-28 12:18:07,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-28 12:18:07,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-28 12:18:07,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-28 12:18:07,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-28 12:18:07,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-28 12:18:07,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-28 12:18:07,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-28 12:18:07,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-28 12:18:07,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-28 12:18:07,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-28 12:18:07,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-28 12:18:07,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-28 12:18:07,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-28 12:18:07,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-28 12:18:07,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-28 12:18:07,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-28 12:18:07,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-28 12:18:07,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-28 12:18:07,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-28 12:18:07,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-28 12:18:07,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-28 12:18:07,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-28 12:18:07,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-28 12:18:07,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-28 12:18:07,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-28 12:18:07,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-28 12:18:07,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-28 12:18:07,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-28 12:18:07,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-28 12:18:07,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-28 12:18:07,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-28 12:18:07,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-28 12:18:07,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-28 12:18:07,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-28 12:18:07,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-28 12:18:07,582 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2022-01-28 12:18:07,606 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-28 12:18:07,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-28 12:18:07,607 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-28 12:18:07,607 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-28 12:18:07,608 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-28 12:18:07,608 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-28 12:18:07,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-28 12:18:07,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-28 12:18:07,609 INFO L138 SettingsManager]: * Use SBE=true [2022-01-28 12:18:07,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-28 12:18:07,609 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-28 12:18:07,610 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-28 12:18:07,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-28 12:18:07,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-28 12:18:07,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-28 12:18:07,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-28 12:18:07,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-28 12:18:07,610 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-28 12:18:07,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-28 12:18:07,610 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-28 12:18:07,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-28 12:18:07,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-28 12:18:07,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-28 12:18:07,611 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-28 12:18:07,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-28 12:18:07,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 12:18:07,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-28 12:18:07,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-28 12:18:07,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-28 12:18:07,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-28 12:18:07,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-28 12:18:07,612 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-28 12:18:07,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-28 12:18:07,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-28 12:18:07,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-28 12:18:07,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-28 12:18:07,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-28 12:18:07,822 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-28 12:18:07,822 INFO L275 PluginConnector]: CDTParser initialized [2022-01-28 12:18:07,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-01-28 12:18:07,872 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3381ab6d8/c13c3a8bc52648cf964a69ebcf44a28a/FLAGb0859c1c6 [2022-01-28 12:18:08,314 INFO L306 CDTParser]: Found 1 translation units. [2022-01-28 12:18:08,315 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-01-28 12:18:08,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3381ab6d8/c13c3a8bc52648cf964a69ebcf44a28a/FLAGb0859c1c6 [2022-01-28 12:18:08,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3381ab6d8/c13c3a8bc52648cf964a69ebcf44a28a [2022-01-28 12:18:08,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-28 12:18:08,716 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-28 12:18:08,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-28 12:18:08,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-28 12:18:08,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-28 12:18:08,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:18:08" (1/1) ... [2022-01-28 12:18:08,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51987e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:18:08, skipping insertion in model container [2022-01-28 12:18:08,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:18:08" (1/1) ... [2022-01-28 12:18:08,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-28 12:18:08,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-28 12:18:09,072 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/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-01-28 12:18:09,260 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 12:18:09,274 INFO L203 MainTranslator]: Completed pre-run [2022-01-28 12:18:09,286 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/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-01-28 12:18:09,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2022-01-28 12:18:09,419 INFO L208 MainTranslator]: Completed translation [2022-01-28 12:18:09,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:18:09 WrapperNode [2022-01-28 12:18:09,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-28 12:18:09,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-28 12:18:09,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-28 12:18:09,421 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-28 12:18:09,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:18:09" (1/1) ... [2022-01-28 12:18:09,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:18:09" (1/1) ... [2022-01-28 12:18:09,506 INFO L137 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 258 [2022-01-28 12:18:09,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-28 12:18:09,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-28 12:18:09,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-28 12:18:09,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-28 12:18:09,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:18:09" (1/1) ... [2022-01-28 12:18:09,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:18:09" (1/1) ... [2022-01-28 12:18:09,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:18:09" (1/1) ... [2022-01-28 12:18:09,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:18:09" (1/1) ... [2022-01-28 12:18:09,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:18:09" (1/1) ... [2022-01-28 12:18:09,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:18:09" (1/1) ... [2022-01-28 12:18:09,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:18:09" (1/1) ... [2022-01-28 12:18:09,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-28 12:18:09,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-28 12:18:09,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-28 12:18:09,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-28 12:18:09,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:18:09" (1/1) ... [2022-01-28 12:18:09,599 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-28 12:18:09,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-28 12:18:09,630 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-01-28 12:18:09,650 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-01-28 12:18:09,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-28 12:18:09,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-28 12:18:09,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-28 12:18:09,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-28 12:18:09,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-28 12:18:09,677 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-28 12:18:09,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-28 12:18:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-28 12:18:09,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-28 12:18:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-28 12:18:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-28 12:18:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-28 12:18:09,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-28 12:18:09,696 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-28 12:18:09,892 INFO L234 CfgBuilder]: Building ICFG [2022-01-28 12:18:09,894 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-28 12:18:10,337 INFO L275 CfgBuilder]: Performing block encoding [2022-01-28 12:18:10,602 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-28 12:18:10,602 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-28 12:18:10,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:18:10 BoogieIcfgContainer [2022-01-28 12:18:10,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-28 12:18:10,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-28 12:18:10,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-28 12:18:10,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-28 12:18:10,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:18:08" (1/3) ... [2022-01-28 12:18:10,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a67a0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:18:10, skipping insertion in model container [2022-01-28 12:18:10,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:18:09" (2/3) ... [2022-01-28 12:18:10,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a67a0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:18:10, skipping insertion in model container [2022-01-28 12:18:10,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:18:10" (3/3) ... [2022-01-28 12:18:10,611 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2022-01-28 12:18:10,615 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-01-28 12:18:10,616 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-28 12:18:10,616 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-28 12:18:10,616 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-28 12:18:10,649 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,650 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,650 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,650 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,650 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,650 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,650 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,650 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,650 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,650 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,650 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,651 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,651 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,651 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,651 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,652 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,652 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,652 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,652 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,652 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,652 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,652 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,653 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,654 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,655 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,655 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,655 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,655 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,655 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,656 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,656 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,656 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,657 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,658 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,662 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,662 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,662 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,663 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,664 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,665 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,666 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,666 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,666 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-28 12:18:10,666 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-28 12:18:10,699 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-28 12:18:10,704 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-28 12:18:10,704 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-28 12:18:10,719 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 93 transitions, 196 flow [2022-01-28 12:18:10,802 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1733 states, 1730 states have (on average 2.678034682080925) internal successors, (4633), 1732 states have internal predecessors, (4633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 1733 states, 1730 states have (on average 2.678034682080925) internal successors, (4633), 1732 states have internal predecessors, (4633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-28 12:18:10,813 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:18:10,813 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:18:10,814 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-28 12:18:10,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:18:10,821 INFO L85 PathProgramCache]: Analyzing trace with hash -761824995, now seen corresponding path program 1 times [2022-01-28 12:18:10,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:18:10,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574426485] [2022-01-28 12:18:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:18:10,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:18:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:18:11,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:18:11,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:18:11,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574426485] [2022-01-28 12:18:11,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574426485] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:18:11,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:18:11,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-28 12:18:11,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872855965] [2022-01-28 12:18:11,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:18:11,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-28 12:18:11,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:18:11,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-28 12:18:11,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 12:18:11,101 INFO L87 Difference]: Start difference. First operand has 1733 states, 1730 states have (on average 2.678034682080925) internal successors, (4633), 1732 states have internal predecessors, (4633), 0 states have call successors, (0), 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 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:18:11,195 INFO L93 Difference]: Finished difference Result 1470 states and 3803 transitions. [2022-01-28 12:18:11,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-28 12:18:11,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-01-28 12:18:11,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:18:11,217 INFO L225 Difference]: With dead ends: 1470 [2022-01-28 12:18:11,217 INFO L226 Difference]: Without dead ends: 1246 [2022-01-28 12:18:11,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-28 12:18:11,222 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 39 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-28 12:18:11,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 136 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-28 12:18:11,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2022-01-28 12:18:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1246. [2022-01-28 12:18:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1245 states have (on average 2.6080321285140564) internal successors, (3247), 1245 states have internal predecessors, (3247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 3247 transitions. [2022-01-28 12:18:11,318 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 3247 transitions. Word has length 40 [2022-01-28 12:18:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:18:11,318 INFO L470 AbstractCegarLoop]: Abstraction has 1246 states and 3247 transitions. [2022-01-28 12:18:11,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 3247 transitions. [2022-01-28 12:18:11,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-28 12:18:11,329 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:18:11,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:18:11,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-28 12:18:11,330 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-28 12:18:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:18:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash -29849764, now seen corresponding path program 1 times [2022-01-28 12:18:11,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:18:11,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128968390] [2022-01-28 12:18:11,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:18:11,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:18:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:18:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:18:11,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:18:11,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128968390] [2022-01-28 12:18:11,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128968390] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:18:11,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:18:11,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 12:18:11,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369197089] [2022-01-28 12:18:11,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:18:11,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 12:18:11,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:18:11,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 12:18:11,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-28 12:18:11,540 INFO L87 Difference]: Start difference. First operand 1246 states and 3247 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:18:11,677 INFO L93 Difference]: Finished difference Result 1524 states and 3943 transitions. [2022-01-28 12:18:11,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-28 12:18:11,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-01-28 12:18:11,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:18:11,682 INFO L225 Difference]: With dead ends: 1524 [2022-01-28 12:18:11,682 INFO L226 Difference]: Without dead ends: 1204 [2022-01-28 12:18:11,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:18:11,683 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 73 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:18:11,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 402 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:18:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2022-01-28 12:18:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1204. [2022-01-28 12:18:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1203 states have (on average 2.594347464671654) internal successors, (3121), 1203 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 3121 transitions. [2022-01-28 12:18:11,733 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 3121 transitions. Word has length 62 [2022-01-28 12:18:11,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:18:11,734 INFO L470 AbstractCegarLoop]: Abstraction has 1204 states and 3121 transitions. [2022-01-28 12:18:11,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:11,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 3121 transitions. [2022-01-28 12:18:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-28 12:18:11,738 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:18:11,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:18:11,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-28 12:18:11,739 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-28 12:18:11,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:18:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1931306917, now seen corresponding path program 1 times [2022-01-28 12:18:11,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:18:11,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401677700] [2022-01-28 12:18:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:18:11,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:18:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:18:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:18:11,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:18:11,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401677700] [2022-01-28 12:18:11,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401677700] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:18:11,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:18:11,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-28 12:18:11,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882344147] [2022-01-28 12:18:11,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:18:11,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-28 12:18:11,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:18:11,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-28 12:18:11,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-28 12:18:11,951 INFO L87 Difference]: Start difference. First operand 1204 states and 3121 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:18:12,203 INFO L93 Difference]: Finished difference Result 1452 states and 3733 transitions. [2022-01-28 12:18:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-28 12:18:12,204 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-01-28 12:18:12,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:18:12,208 INFO L225 Difference]: With dead ends: 1452 [2022-01-28 12:18:12,208 INFO L226 Difference]: Without dead ends: 1162 [2022-01-28 12:18:12,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-01-28 12:18:12,209 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 175 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:18:12,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 637 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:18:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2022-01-28 12:18:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2022-01-28 12:18:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1161 states have (on average 2.5796726959517655) internal successors, (2995), 1161 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 2995 transitions. [2022-01-28 12:18:12,231 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 2995 transitions. Word has length 64 [2022-01-28 12:18:12,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:18:12,231 INFO L470 AbstractCegarLoop]: Abstraction has 1162 states and 2995 transitions. [2022-01-28 12:18:12,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 2995 transitions. [2022-01-28 12:18:12,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-28 12:18:12,239 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:18:12,240 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:18:12,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-28 12:18:12,240 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-28 12:18:12,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:18:12,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2075845646, now seen corresponding path program 1 times [2022-01-28 12:18:12,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:18:12,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321291798] [2022-01-28 12:18:12,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:18:12,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:18:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:18:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:18:12,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:18:12,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321291798] [2022-01-28 12:18:12,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321291798] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:18:12,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:18:12,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-28 12:18:12,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818424864] [2022-01-28 12:18:12,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:18:12,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-28 12:18:12,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:18:12,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-28 12:18:12,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:18:12,562 INFO L87 Difference]: Start difference. First operand 1162 states and 2995 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:18:12,812 INFO L93 Difference]: Finished difference Result 1348 states and 3450 transitions. [2022-01-28 12:18:12,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-28 12:18:12,812 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-01-28 12:18:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:18:12,816 INFO L225 Difference]: With dead ends: 1348 [2022-01-28 12:18:12,817 INFO L226 Difference]: Without dead ends: 1148 [2022-01-28 12:18:12,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2022-01-28 12:18:12,818 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 233 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:18:12,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 590 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:18:12,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2022-01-28 12:18:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1148. [2022-01-28 12:18:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 2.5745422842197034) internal successors, (2953), 1147 states have internal predecessors, (2953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 2953 transitions. [2022-01-28 12:18:12,845 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 2953 transitions. Word has length 65 [2022-01-28 12:18:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:18:12,846 INFO L470 AbstractCegarLoop]: Abstraction has 1148 states and 2953 transitions. [2022-01-28 12:18:12,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 2953 transitions. [2022-01-28 12:18:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-28 12:18:12,849 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:18:12,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:18:12,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-28 12:18:12,905 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-28 12:18:12,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:18:12,905 INFO L85 PathProgramCache]: Analyzing trace with hash 886411519, now seen corresponding path program 1 times [2022-01-28 12:18:12,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:18:12,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587887030] [2022-01-28 12:18:12,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:18:12,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:18:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:18:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:18:13,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:18:13,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587887030] [2022-01-28 12:18:13,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587887030] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:18:13,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:18:13,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 12:18:13,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546531732] [2022-01-28 12:18:13,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:18:13,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 12:18:13,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:18:13,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 12:18:13,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-28 12:18:13,033 INFO L87 Difference]: Start difference. First operand 1148 states and 2953 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:18:13,164 INFO L93 Difference]: Finished difference Result 1902 states and 4844 transitions. [2022-01-28 12:18:13,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-28 12:18:13,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-28 12:18:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:18:13,170 INFO L225 Difference]: With dead ends: 1902 [2022-01-28 12:18:13,170 INFO L226 Difference]: Without dead ends: 1267 [2022-01-28 12:18:13,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:18:13,175 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 82 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:18:13,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 510 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:18:13,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2022-01-28 12:18:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1092. [2022-01-28 12:18:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1091 states have (on average 2.5050412465627865) internal successors, (2733), 1091 states have internal predecessors, (2733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 2733 transitions. [2022-01-28 12:18:13,197 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 2733 transitions. Word has length 66 [2022-01-28 12:18:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:18:13,197 INFO L470 AbstractCegarLoop]: Abstraction has 1092 states and 2733 transitions. [2022-01-28 12:18:13,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 2733 transitions. [2022-01-28 12:18:13,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-28 12:18:13,199 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:18:13,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:18:13,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-28 12:18:13,200 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-28 12:18:13,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:18:13,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1036315994, now seen corresponding path program 1 times [2022-01-28 12:18:13,200 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:18:13,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593213970] [2022-01-28 12:18:13,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:18:13,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:18:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:18:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:18:13,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:18:13,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593213970] [2022-01-28 12:18:13,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593213970] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:18:13,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:18:13,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-28 12:18:13,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122423254] [2022-01-28 12:18:13,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:18:13,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-28 12:18:13,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:18:13,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-28 12:18:13,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:18:13,391 INFO L87 Difference]: Start difference. First operand 1092 states and 2733 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:13,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:18:13,585 INFO L93 Difference]: Finished difference Result 1616 states and 4001 transitions. [2022-01-28 12:18:13,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-28 12:18:13,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-28 12:18:13,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:18:13,589 INFO L225 Difference]: With dead ends: 1616 [2022-01-28 12:18:13,590 INFO L226 Difference]: Without dead ends: 908 [2022-01-28 12:18:13,590 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2022-01-28 12:18:13,591 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 173 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:18:13,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 562 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:18:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2022-01-28 12:18:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 768. [2022-01-28 12:18:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 2.3846153846153846) internal successors, (1829), 767 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1829 transitions. [2022-01-28 12:18:13,605 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1829 transitions. Word has length 66 [2022-01-28 12:18:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:18:13,605 INFO L470 AbstractCegarLoop]: Abstraction has 768 states and 1829 transitions. [2022-01-28 12:18:13,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1829 transitions. [2022-01-28 12:18:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-28 12:18:13,606 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:18:13,607 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:18:13,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-28 12:18:13,607 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-28 12:18:13,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:18:13,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1872509634, now seen corresponding path program 1 times [2022-01-28 12:18:13,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:18:13,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812183753] [2022-01-28 12:18:13,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:18:13,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:18:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:18:13,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:18:13,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:18:13,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812183753] [2022-01-28 12:18:13,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812183753] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:18:13,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:18:13,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-28 12:18:13,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043710340] [2022-01-28 12:18:13,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:18:13,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-28 12:18:13,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:18:13,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-28 12:18:13,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-28 12:18:13,675 INFO L87 Difference]: Start difference. First operand 768 states and 1829 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:18:13,787 INFO L93 Difference]: Finished difference Result 849 states and 1974 transitions. [2022-01-28 12:18:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-28 12:18:13,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-01-28 12:18:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:18:13,790 INFO L225 Difference]: With dead ends: 849 [2022-01-28 12:18:13,790 INFO L226 Difference]: Without dead ends: 619 [2022-01-28 12:18:13,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-28 12:18:13,791 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 114 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:18:13,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 295 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:18:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-01-28 12:18:13,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2022-01-28 12:18:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 618 states have (on average 2.2880258899676376) internal successors, (1414), 618 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 1414 transitions. [2022-01-28 12:18:13,801 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 1414 transitions. Word has length 68 [2022-01-28 12:18:13,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:18:13,801 INFO L470 AbstractCegarLoop]: Abstraction has 619 states and 1414 transitions. [2022-01-28 12:18:13,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1414 transitions. [2022-01-28 12:18:13,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-28 12:18:13,803 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:18:13,803 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:18:13,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-28 12:18:13,803 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-28 12:18:13,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:18:13,803 INFO L85 PathProgramCache]: Analyzing trace with hash 465198888, now seen corresponding path program 1 times [2022-01-28 12:18:13,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:18:13,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537095835] [2022-01-28 12:18:13,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:18:13,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:18:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-28 12:18:13,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-28 12:18:13,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-28 12:18:13,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537095835] [2022-01-28 12:18:13,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537095835] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-28 12:18:13,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-28 12:18:13,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-28 12:18:13,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110938423] [2022-01-28 12:18:13,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-28 12:18:13,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-28 12:18:13,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-28 12:18:13,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-28 12:18:13,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-28 12:18:13,899 INFO L87 Difference]: Start difference. First operand 619 states and 1414 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-28 12:18:14,020 INFO L93 Difference]: Finished difference Result 517 states and 1127 transitions. [2022-01-28 12:18:14,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-28 12:18:14,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-01-28 12:18:14,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-28 12:18:14,022 INFO L225 Difference]: With dead ends: 517 [2022-01-28 12:18:14,022 INFO L226 Difference]: Without dead ends: 303 [2022-01-28 12:18:14,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-01-28 12:18:14,023 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 156 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-28 12:18:14,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 308 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-28 12:18:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-01-28 12:18:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2022-01-28 12:18:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 2.0728476821192054) internal successors, (626), 302 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 626 transitions. [2022-01-28 12:18:14,029 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 626 transitions. Word has length 69 [2022-01-28 12:18:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-28 12:18:14,029 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 626 transitions. [2022-01-28 12:18:14,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-28 12:18:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 626 transitions. [2022-01-28 12:18:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-28 12:18:14,030 INFO L506 BasicCegarLoop]: Found error trace [2022-01-28 12:18:14,030 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:18:14,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-28 12:18:14,030 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-28 12:18:14,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-28 12:18:14,031 INFO L85 PathProgramCache]: Analyzing trace with hash 876422978, now seen corresponding path program 1 times [2022-01-28 12:18:14,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-28 12:18:14,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746973422] [2022-01-28 12:18:14,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-28 12:18:14,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-28 12:18:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-28 12:18:14,078 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-28 12:18:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-28 12:18:14,155 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-28 12:18:14,156 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-28 12:18:14,157 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-28 12:18:14,158 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-01-28 12:18:14,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-01-28 12:18:14,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-01-28 12:18:14,159 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-01-28 12:18:14,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-28 12:18:14,161 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-28 12:18:14,165 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-28 12:18:14,165 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-28 12:18:14,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:18:14 BasicIcfg [2022-01-28 12:18:14,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-28 12:18:14,268 INFO L158 Benchmark]: Toolchain (without parser) took 5551.66ms. Allocated memory was 228.6MB in the beginning and 459.3MB in the end (delta: 230.7MB). Free memory was 172.5MB in the beginning and 354.2MB in the end (delta: -181.8MB). Peak memory consumption was 48.0MB. Max. memory is 8.0GB. [2022-01-28 12:18:14,268 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 228.6MB. Free memory was 189.9MB in the beginning and 189.9MB in the end (delta: 76.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-28 12:18:14,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 700.53ms. Allocated memory was 228.6MB in the beginning and 307.2MB in the end (delta: 78.6MB). Free memory was 172.3MB in the beginning and 267.0MB in the end (delta: -94.7MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. [2022-01-28 12:18:14,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.33ms. Allocated memory is still 307.2MB. Free memory was 267.0MB in the beginning and 264.3MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-28 12:18:14,268 INFO L158 Benchmark]: Boogie Preprocessor took 61.73ms. Allocated memory is still 307.2MB. Free memory was 264.3MB in the beginning and 262.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-28 12:18:14,269 INFO L158 Benchmark]: RCFGBuilder took 1034.48ms. Allocated memory is still 307.2MB. Free memory was 262.2MB in the beginning and 271.0MB in the end (delta: -8.8MB). Peak memory consumption was 69.2MB. Max. memory is 8.0GB. [2022-01-28 12:18:14,269 INFO L158 Benchmark]: TraceAbstraction took 3661.84ms. Allocated memory was 307.2MB in the beginning and 459.3MB in the end (delta: 152.0MB). Free memory was 270.4MB in the beginning and 354.2MB in the end (delta: -83.8MB). Peak memory consumption was 67.8MB. Max. memory is 8.0GB. [2022-01-28 12:18:14,270 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 228.6MB. Free memory was 189.9MB in the beginning and 189.9MB in the end (delta: 76.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 700.53ms. Allocated memory was 228.6MB in the beginning and 307.2MB in the end (delta: 78.6MB). Free memory was 172.3MB in the beginning and 267.0MB in the end (delta: -94.7MB). Peak memory consumption was 9.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 86.33ms. Allocated memory is still 307.2MB. Free memory was 267.0MB in the beginning and 264.3MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.73ms. Allocated memory is still 307.2MB. Free memory was 264.3MB in the beginning and 262.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1034.48ms. Allocated memory is still 307.2MB. Free memory was 262.2MB in the beginning and 271.0MB in the end (delta: -8.8MB). Peak memory consumption was 69.2MB. Max. memory is 8.0GB. * TraceAbstraction took 3661.84ms. Allocated memory was 307.2MB in the beginning and 459.3MB in the end (delta: 152.0MB). Free memory was 270.4MB in the beginning and 354.2MB in the end (delta: -83.8MB). Peak memory consumption was 67.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L716] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L717] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L718] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L719] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] 0 pthread_t t2473; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2473, ((void *)0), P0, ((void *)0))=-1, t2473={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473={5:0}, t2474={3: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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2474, ((void *)0), P1, ((void *)0))=0, t2473={5:0}, t2474={3: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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] 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) [L799] 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) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 791]: 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: 793]: 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 5 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1045 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1045 mSDsluCounter, 3440 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2875 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 719 IncrementalHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 767 mSDtfsCounter, 719 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1733occurred in iteration=0, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 315 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 492 ConstructedInterpolants, 0 QuantifiedInterpolants, 2455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-01-28 12:18:14,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...