/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/safe031_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-10 21:47:04,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 21:47:04,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 21:47:04,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 21:47:04,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 21:47:04,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 21:47:04,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 21:47:04,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 21:47:04,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 21:47:04,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 21:47:04,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 21:47:04,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 21:47:04,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 21:47:04,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 21:47:04,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 21:47:04,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 21:47:04,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 21:47:04,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 21:47:04,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 21:47:04,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 21:47:04,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 21:47:04,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 21:47:04,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 21:47:04,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 21:47:04,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 21:47:04,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 21:47:04,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 21:47:04,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 21:47:04,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 21:47:04,321 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 21:47:04,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 21:47:04,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 21:47:04,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 21:47:04,323 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 21:47:04,324 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 21:47:04,324 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 21:47:04,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 21:47:04,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 21:47:04,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 21:47:04,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 21:47:04,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 21:47:04,328 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-02-10 21:47:04,363 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 21:47:04,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 21:47:04,364 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 21:47:04,365 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 21:47:04,365 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 21:47:04,366 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 21:47:04,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 21:47:04,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 21:47:04,367 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 21:47:04,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 21:47:04,367 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 21:47:04,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 21:47:04,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 21:47:04,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 21:47:04,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 21:47:04,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 21:47:04,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 21:47:04,368 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 21:47:04,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 21:47:04,369 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 21:47:04,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 21:47:04,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 21:47:04,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 21:47:04,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 21:47:04,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 21:47:04,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:47:04,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 21:47:04,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 21:47:04,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 21:47:04,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 21:47:04,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 21:47:04,373 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 21:47:04,373 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 21:47:04,373 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-02-10 21:47:04,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 21:47:04,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 21:47:04,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 21:47:04,603 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-10 21:47:04,604 INFO L275 PluginConnector]: CDTParser initialized [2022-02-10 21:47:04,605 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-02-10 21:47:04,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c630bb29/09dc97a1b36248f5b2e3970aadb84145/FLAG41ddc63c2 [2022-02-10 21:47:05,091 INFO L306 CDTParser]: Found 1 translation units. [2022-02-10 21:47:05,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-02-10 21:47:05,106 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c630bb29/09dc97a1b36248f5b2e3970aadb84145/FLAG41ddc63c2 [2022-02-10 21:47:05,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c630bb29/09dc97a1b36248f5b2e3970aadb84145 [2022-02-10 21:47:05,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 21:47:05,121 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-10 21:47:05,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-10 21:47:05,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-10 21:47:05,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-10 21:47:05,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:47:05" (1/1) ... [2022-02-10 21:47:05,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@705a9c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:47:05, skipping insertion in model container [2022-02-10 21:47:05,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 09:47:05" (1/1) ... [2022-02-10 21:47:05,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-10 21:47:05,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-10 21:47:05,352 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/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2022-02-10 21:47:05,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:47:05,589 INFO L203 MainTranslator]: Completed pre-run [2022-02-10 21:47:05,601 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/safe031_power.oepc_pso.oepc_rmo.oepc.i[1013,1026] [2022-02-10 21:47:05,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-10 21:47:05,688 INFO L208 MainTranslator]: Completed translation [2022-02-10 21:47:05,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:47:05 WrapperNode [2022-02-10 21:47:05,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-10 21:47:05,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 21:47:05,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 21:47:05,690 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 21:47:05,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:47:05" (1/1) ... [2022-02-10 21:47:05,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:47:05" (1/1) ... [2022-02-10 21:47:05,762 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 175 [2022-02-10 21:47:05,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 21:47:05,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 21:47:05,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 21:47:05,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 21:47:05,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:47:05" (1/1) ... [2022-02-10 21:47:05,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:47:05" (1/1) ... [2022-02-10 21:47:05,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:47:05" (1/1) ... [2022-02-10 21:47:05,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:47:05" (1/1) ... [2022-02-10 21:47:05,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:47:05" (1/1) ... [2022-02-10 21:47:05,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:47:05" (1/1) ... [2022-02-10 21:47:05,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:47:05" (1/1) ... [2022-02-10 21:47:05,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 21:47:05,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 21:47:05,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 21:47:05,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 21:47:05,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:47:05" (1/1) ... [2022-02-10 21:47:05,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 21:47:05,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 21:47:05,861 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-02-10 21:47:05,871 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-02-10 21:47:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-10 21:47:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-10 21:47:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-10 21:47:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-10 21:47:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-10 21:47:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-02-10 21:47:05,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-02-10 21:47:05,905 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-02-10 21:47:05,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-02-10 21:47:05,906 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-02-10 21:47:05,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-02-10 21:47:05,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-10 21:47:05,906 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-10 21:47:05,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 21:47:05,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 21:47:05,908 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 21:47:06,075 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 21:47:06,076 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 21:47:06,466 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 21:47:06,735 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 21:47:06,735 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-10 21:47:06,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:47:06 BoogieIcfgContainer [2022-02-10 21:47:06,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 21:47:06,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 21:47:06,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 21:47:06,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 21:47:06,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.02 09:47:05" (1/3) ... [2022-02-10 21:47:06,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb77a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:47:06, skipping insertion in model container [2022-02-10 21:47:06,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 09:47:05" (2/3) ... [2022-02-10 21:47:06,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb77a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 09:47:06, skipping insertion in model container [2022-02-10 21:47:06,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 09:47:06" (3/3) ... [2022-02-10 21:47:06,747 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2022-02-10 21:47:06,752 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 21:47:06,753 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 21:47:06,753 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-10 21:47:06,753 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 21:47:06,800 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,801 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,801 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,801 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,801 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,801 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,802 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,802 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,802 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,803 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,803 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,803 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,803 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,803 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,804 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,804 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,804 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,804 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,804 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,804 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,805 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,805 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,805 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,806 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,806 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,806 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,806 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,806 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,806 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,807 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,807 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,807 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,807 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,807 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,807 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,807 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,807 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,807 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,808 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,808 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,808 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,808 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,808 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,808 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,808 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,808 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,813 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,814 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,814 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,814 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,814 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,814 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,814 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,814 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,814 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,815 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,815 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,815 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,815 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,815 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,815 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,815 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,816 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,816 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,816 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,816 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,816 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,816 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,816 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,817 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,817 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,817 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,817 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,817 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,817 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,817 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,817 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,817 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,818 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,818 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,818 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,818 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,818 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,818 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,822 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,822 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,822 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,822 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,823 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,825 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,830 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,830 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,830 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,831 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,831 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,831 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,831 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,831 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,831 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,832 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,832 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,832 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,833 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,833 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,833 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,833 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,834 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,834 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,834 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,834 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,834 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,835 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,836 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,836 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,836 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,836 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,836 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,836 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,837 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,837 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,837 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,837 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,837 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,838 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,838 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,838 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,838 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,838 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,838 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,838 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,838 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,838 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,839 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,839 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,839 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,839 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,839 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,840 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,840 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,840 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,840 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,840 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,840 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,840 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,841 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,841 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,841 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,841 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,845 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,845 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,845 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,845 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,845 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,845 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,847 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,847 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,847 WARN L322 ript$VariableManager]: TermVariable P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,847 WARN L322 ript$VariableManager]: TermVariable |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,849 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,849 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,849 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,849 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,849 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,849 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,849 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,849 WARN L322 ript$VariableManager]: TermVariable P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,849 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,850 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,850 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,850 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,850 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,850 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,850 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,850 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,850 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,850 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,850 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,851 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,851 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,851 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,851 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,851 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,851 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,851 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,851 WARN L322 ript$VariableManager]: TermVariable |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,852 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,852 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,852 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,852 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,852 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,853 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,853 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,853 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,853 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,853 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,853 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,854 WARN L322 ript$VariableManager]: TermVariable |P1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 21:47:06,854 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-10 21:47:06,910 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 21:47:06,919 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-02-10 21:47:06,919 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-10 21:47:06,931 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 121 places, 113 transitions, 241 flow [2022-02-10 21:47:07,436 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12292 states, 12289 states have (on average 3.5487020913011635) internal successors, (43610), 12291 states have internal predecessors, (43610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 12292 states, 12289 states have (on average 3.5487020913011635) internal successors, (43610), 12291 states have internal predecessors, (43610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-10 21:47:07,496 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:07,497 INFO L515 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] [2022-02-10 21:47:07,497 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:47:07,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:07,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1563682019, now seen corresponding path program 1 times [2022-02-10 21:47:07,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:07,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29597634] [2022-02-10 21:47:07,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:07,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:47:07,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:07,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29597634] [2022-02-10 21:47:07,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29597634] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:07,850 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:07,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-10 21:47:07,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917732010] [2022-02-10 21:47:07,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:07,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 21:47:07,855 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:07,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 21:47:07,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 21:47:07,925 INFO L87 Difference]: Start difference. First operand has 12292 states, 12289 states have (on average 3.5487020913011635) internal successors, (43610), 12291 states have internal predecessors, (43610), 0 states have call successors, (0), 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 25.5) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:08,236 INFO L93 Difference]: Finished difference Result 10339 states and 35804 transitions. [2022-02-10 21:47:08,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 21:47:08,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-02-10 21:47:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:08,342 INFO L225 Difference]: With dead ends: 10339 [2022-02-10 21:47:08,342 INFO L226 Difference]: Without dead ends: 8547 [2022-02-10 21:47:08,343 INFO L933 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-02-10 21:47:08,349 INFO L934 BasicCegarLoop]: 98 mSDtfsCounter, 47 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:08,350 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 162 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 21:47:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8547 states. [2022-02-10 21:47:08,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8547 to 8547. [2022-02-10 21:47:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8547 states, 8546 states have (on average 3.492160074888837) internal successors, (29844), 8546 states have internal predecessors, (29844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8547 states to 8547 states and 29844 transitions. [2022-02-10 21:47:08,915 INFO L78 Accepts]: Start accepts. Automaton has 8547 states and 29844 transitions. Word has length 51 [2022-02-10 21:47:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:08,915 INFO L470 AbstractCegarLoop]: Abstraction has 8547 states and 29844 transitions. [2022-02-10 21:47:08,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 25.5) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 8547 states and 29844 transitions. [2022-02-10 21:47:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-10 21:47:08,940 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:08,940 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:47:08,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 21:47:08,941 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:47:08,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:08,943 INFO L85 PathProgramCache]: Analyzing trace with hash -320516293, now seen corresponding path program 1 times [2022-02-10 21:47:08,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:08,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291882526] [2022-02-10 21:47:08,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:08,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:47:09,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:09,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291882526] [2022-02-10 21:47:09,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291882526] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:09,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:09,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:47:09,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137117343] [2022-02-10 21:47:09,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:09,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:47:09,259 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:09,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:47:09,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:47:09,260 INFO L87 Difference]: Start difference. First operand 8547 states and 29844 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:09,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:09,845 INFO L93 Difference]: Finished difference Result 17293 states and 59594 transitions. [2022-02-10 21:47:09,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:47:09,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2022-02-10 21:47:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:09,928 INFO L225 Difference]: With dead ends: 17293 [2022-02-10 21:47:09,928 INFO L226 Difference]: Without dead ends: 11648 [2022-02-10 21:47:09,931 INFO L933 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-02-10 21:47:09,933 INFO L934 BasicCegarLoop]: 148 mSDtfsCounter, 139 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:09,933 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 578 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-10 21:47:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11648 states. [2022-02-10 21:47:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11648 to 9653. [2022-02-10 21:47:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9653 states, 9652 states have (on average 3.403854123497721) internal successors, (32854), 9652 states have internal predecessors, (32854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9653 states to 9653 states and 32854 transitions. [2022-02-10 21:47:10,474 INFO L78 Accepts]: Start accepts. Automaton has 9653 states and 32854 transitions. Word has length 73 [2022-02-10 21:47:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:10,475 INFO L470 AbstractCegarLoop]: Abstraction has 9653 states and 32854 transitions. [2022-02-10 21:47:10,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 9653 states and 32854 transitions. [2022-02-10 21:47:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-10 21:47:10,498 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:10,498 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:47:10,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 21:47:10,499 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:47:10,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash -10127972, now seen corresponding path program 1 times [2022-02-10 21:47:10,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:10,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29704667] [2022-02-10 21:47:10,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:47:10,696 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:10,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29704667] [2022-02-10 21:47:10,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29704667] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:10,697 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:10,697 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:47:10,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730101674] [2022-02-10 21:47:10,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:10,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:47:10,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:10,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:47:10,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:47:10,699 INFO L87 Difference]: Start difference. First operand 9653 states and 32854 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:11,230 INFO L93 Difference]: Finished difference Result 13813 states and 46647 transitions. [2022-02-10 21:47:11,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-10 21:47:11,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-10 21:47:11,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:11,285 INFO L225 Difference]: With dead ends: 13813 [2022-02-10 21:47:11,285 INFO L226 Difference]: Without dead ends: 11088 [2022-02-10 21:47:11,286 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-02-10 21:47:11,289 INFO L934 BasicCegarLoop]: 130 mSDtfsCounter, 190 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:11,289 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 663 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:47:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11088 states. [2022-02-10 21:47:11,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11088 to 9443. [2022-02-10 21:47:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9443 states, 9442 states have (on average 3.395043423003601) internal successors, (32056), 9442 states have internal predecessors, (32056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9443 states to 9443 states and 32056 transitions. [2022-02-10 21:47:11,694 INFO L78 Accepts]: Start accepts. Automaton has 9443 states and 32056 transitions. Word has length 75 [2022-02-10 21:47:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:11,696 INFO L470 AbstractCegarLoop]: Abstraction has 9443 states and 32056 transitions. [2022-02-10 21:47:11,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 9443 states and 32056 transitions. [2022-02-10 21:47:11,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-10 21:47:11,717 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:11,717 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:47:11,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 21:47:11,718 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:47:11,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash 734122810, now seen corresponding path program 1 times [2022-02-10 21:47:11,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:11,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113069421] [2022-02-10 21:47:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:11,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:47:11,860 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:11,860 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113069421] [2022-02-10 21:47:11,860 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113069421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:11,861 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:11,861 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:47:11,861 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229046994] [2022-02-10 21:47:11,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:11,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:47:11,862 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:11,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:47:11,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:47:11,863 INFO L87 Difference]: Start difference. First operand 9443 states and 32056 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:12,339 INFO L93 Difference]: Finished difference Result 13151 states and 44284 transitions. [2022-02-10 21:47:12,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-10 21:47:12,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-02-10 21:47:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:12,394 INFO L225 Difference]: With dead ends: 13151 [2022-02-10 21:47:12,394 INFO L226 Difference]: Without dead ends: 10346 [2022-02-10 21:47:12,395 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-02-10 21:47:12,402 INFO L934 BasicCegarLoop]: 138 mSDtfsCounter, 211 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:12,404 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 687 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:47:12,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10346 states. [2022-02-10 21:47:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10346 to 8661. [2022-02-10 21:47:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8661 states, 8660 states have (on average 3.3759815242494224) internal successors, (29236), 8660 states have internal predecessors, (29236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8661 states to 8661 states and 29236 transitions. [2022-02-10 21:47:12,770 INFO L78 Accepts]: Start accepts. Automaton has 8661 states and 29236 transitions. Word has length 75 [2022-02-10 21:47:12,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:12,772 INFO L470 AbstractCegarLoop]: Abstraction has 8661 states and 29236 transitions. [2022-02-10 21:47:12,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:12,772 INFO L276 IsEmpty]: Start isEmpty. Operand 8661 states and 29236 transitions. [2022-02-10 21:47:12,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-10 21:47:12,794 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:12,794 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:47:12,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 21:47:12,795 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:47:12,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:12,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1630411429, now seen corresponding path program 1 times [2022-02-10 21:47:12,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:12,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705125880] [2022-02-10 21:47:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:12,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:47:12,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:12,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705125880] [2022-02-10 21:47:12,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705125880] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:12,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:12,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:47:12,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866047980] [2022-02-10 21:47:12,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:12,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:47:12,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:12,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:47:12,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:47:12,944 INFO L87 Difference]: Start difference. First operand 8661 states and 29236 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:13,250 INFO L93 Difference]: Finished difference Result 10150 states and 33503 transitions. [2022-02-10 21:47:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-10 21:47:13,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-02-10 21:47:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:13,279 INFO L225 Difference]: With dead ends: 10150 [2022-02-10 21:47:13,279 INFO L226 Difference]: Without dead ends: 7435 [2022-02-10 21:47:13,279 INFO L933 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-02-10 21:47:13,282 INFO L934 BasicCegarLoop]: 105 mSDtfsCounter, 175 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:13,282 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 388 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 21:47:13,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-02-10 21:47:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7435. [2022-02-10 21:47:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7435 states, 7434 states have (on average 3.281678773204197) internal successors, (24396), 7434 states have internal predecessors, (24396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 24396 transitions. [2022-02-10 21:47:13,544 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 24396 transitions. Word has length 77 [2022-02-10 21:47:13,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:13,544 INFO L470 AbstractCegarLoop]: Abstraction has 7435 states and 24396 transitions. [2022-02-10 21:47:13,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:13,544 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 24396 transitions. [2022-02-10 21:47:13,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-10 21:47:13,569 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:13,569 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:47:13,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 21:47:13,569 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:47:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1599972292, now seen corresponding path program 1 times [2022-02-10 21:47:13,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:13,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952406184] [2022-02-10 21:47:13,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:13,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:47:13,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:13,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952406184] [2022-02-10 21:47:13,726 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952406184] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:13,726 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:13,726 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:47:13,727 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052315164] [2022-02-10 21:47:13,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:13,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:47:13,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:13,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:47:13,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:47:13,728 INFO L87 Difference]: Start difference. First operand 7435 states and 24396 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:13,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:13,944 INFO L93 Difference]: Finished difference Result 6787 states and 21495 transitions. [2022-02-10 21:47:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 21:47:13,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-02-10 21:47:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:13,965 INFO L225 Difference]: With dead ends: 6787 [2022-02-10 21:47:13,965 INFO L226 Difference]: Without dead ends: 4636 [2022-02-10 21:47:13,966 INFO L933 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-02-10 21:47:13,967 INFO L934 BasicCegarLoop]: 105 mSDtfsCounter, 278 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:13,967 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 450 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:13,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4636 states. [2022-02-10 21:47:14,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4636 to 4511. [2022-02-10 21:47:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4511 states, 4510 states have (on average 3.098669623059867) internal successors, (13975), 4510 states have internal predecessors, (13975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4511 states to 4511 states and 13975 transitions. [2022-02-10 21:47:14,202 INFO L78 Accepts]: Start accepts. Automaton has 4511 states and 13975 transitions. Word has length 79 [2022-02-10 21:47:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:14,202 INFO L470 AbstractCegarLoop]: Abstraction has 4511 states and 13975 transitions. [2022-02-10 21:47:14,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:14,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4511 states and 13975 transitions. [2022-02-10 21:47:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-10 21:47:14,219 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:14,220 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:47:14,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 21:47:14,220 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:47:14,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:14,220 INFO L85 PathProgramCache]: Analyzing trace with hash 605857366, now seen corresponding path program 1 times [2022-02-10 21:47:14,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:14,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617180184] [2022-02-10 21:47:14,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:14,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:47:14,349 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:14,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617180184] [2022-02-10 21:47:14,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617180184] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:14,349 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:14,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 21:47:14,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145817430] [2022-02-10 21:47:14,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:14,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-10 21:47:14,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:14,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-10 21:47:14,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-10 21:47:14,351 INFO L87 Difference]: Start difference. First operand 4511 states and 13975 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:14,604 INFO L93 Difference]: Finished difference Result 7511 states and 23301 transitions. [2022-02-10 21:47:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-10 21:47:14,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-02-10 21:47:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:14,619 INFO L225 Difference]: With dead ends: 7511 [2022-02-10 21:47:14,619 INFO L226 Difference]: Without dead ends: 5060 [2022-02-10 21:47:14,620 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-02-10 21:47:14,620 INFO L934 BasicCegarLoop]: 147 mSDtfsCounter, 153 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:14,621 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 728 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5060 states. [2022-02-10 21:47:14,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5060 to 3981. [2022-02-10 21:47:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3981 states, 3980 states have (on average 3.084924623115578) internal successors, (12278), 3980 states have internal predecessors, (12278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 12278 transitions. [2022-02-10 21:47:14,708 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 12278 transitions. Word has length 82 [2022-02-10 21:47:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:14,708 INFO L470 AbstractCegarLoop]: Abstraction has 3981 states and 12278 transitions. [2022-02-10 21:47:14,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 12278 transitions. [2022-02-10 21:47:14,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-10 21:47:14,717 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:14,717 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:47:14,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 21:47:14,717 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:47:14,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:14,718 INFO L85 PathProgramCache]: Analyzing trace with hash 2011465000, now seen corresponding path program 1 times [2022-02-10 21:47:14,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:14,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890900283] [2022-02-10 21:47:14,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:14,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:47:14,832 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:14,832 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890900283] [2022-02-10 21:47:14,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890900283] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:14,832 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:14,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-10 21:47:14,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593156655] [2022-02-10 21:47:14,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:14,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-10 21:47:14,833 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:14,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-10 21:47:14,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-10 21:47:14,834 INFO L87 Difference]: Start difference. First operand 3981 states and 12278 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:15,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:15,065 INFO L93 Difference]: Finished difference Result 6108 states and 18886 transitions. [2022-02-10 21:47:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-10 21:47:15,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-02-10 21:47:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:15,080 INFO L225 Difference]: With dead ends: 6108 [2022-02-10 21:47:15,080 INFO L226 Difference]: Without dead ends: 4140 [2022-02-10 21:47:15,080 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-10 21:47:15,081 INFO L934 BasicCegarLoop]: 135 mSDtfsCounter, 69 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:15,081 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 556 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2022-02-10 21:47:15,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 3825. [2022-02-10 21:47:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3825 states, 3824 states have (on average 3.0698221757322175) internal successors, (11739), 3824 states have internal predecessors, (11739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3825 states and 11739 transitions. [2022-02-10 21:47:15,186 INFO L78 Accepts]: Start accepts. Automaton has 3825 states and 11739 transitions. Word has length 82 [2022-02-10 21:47:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:15,187 INFO L470 AbstractCegarLoop]: Abstraction has 3825 states and 11739 transitions. [2022-02-10 21:47:15,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3825 states and 11739 transitions. [2022-02-10 21:47:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-10 21:47:15,195 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:15,195 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:47:15,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 21:47:15,196 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:47:15,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:15,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1556842874, now seen corresponding path program 2 times [2022-02-10 21:47:15,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:15,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138080434] [2022-02-10 21:47:15,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:15,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:47:15,350 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:15,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138080434] [2022-02-10 21:47:15,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138080434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:15,351 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:15,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-10 21:47:15,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98450105] [2022-02-10 21:47:15,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:15,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-10 21:47:15,352 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:15,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-10 21:47:15,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-10 21:47:15,353 INFO L87 Difference]: Start difference. First operand 3825 states and 11739 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:15,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:15,557 INFO L93 Difference]: Finished difference Result 2952 states and 8811 transitions. [2022-02-10 21:47:15,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-10 21:47:15,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-02-10 21:47:15,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:15,561 INFO L225 Difference]: With dead ends: 2952 [2022-02-10 21:47:15,561 INFO L226 Difference]: Without dead ends: 1224 [2022-02-10 21:47:15,561 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-02-10 21:47:15,562 INFO L934 BasicCegarLoop]: 101 mSDtfsCounter, 384 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:15,562 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [384 Valid, 433 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2022-02-10 21:47:15,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1224. [2022-02-10 21:47:15,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1223 states have (on average 2.900245298446443) internal successors, (3547), 1223 states have internal predecessors, (3547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 3547 transitions. [2022-02-10 21:47:15,585 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 3547 transitions. Word has length 82 [2022-02-10 21:47:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:15,586 INFO L470 AbstractCegarLoop]: Abstraction has 1224 states and 3547 transitions. [2022-02-10 21:47:15,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 3547 transitions. [2022-02-10 21:47:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-10 21:47:15,589 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:15,589 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:47:15,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 21:47:15,590 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:47:15,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2066902099, now seen corresponding path program 1 times [2022-02-10 21:47:15,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:15,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559084673] [2022-02-10 21:47:15,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:15,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 21:47:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-10 21:47:15,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 21:47:15,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559084673] [2022-02-10 21:47:15,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559084673] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 21:47:15,844 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 21:47:15,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-10 21:47:15,845 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003127024] [2022-02-10 21:47:15,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 21:47:15,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 21:47:15,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 21:47:15,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 21:47:15,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-10 21:47:15,846 INFO L87 Difference]: Start difference. First operand 1224 states and 3547 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 21:47:16,077 INFO L93 Difference]: Finished difference Result 1815 states and 5312 transitions. [2022-02-10 21:47:16,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-10 21:47:16,093 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-02-10 21:47:16,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 21:47:16,095 INFO L225 Difference]: With dead ends: 1815 [2022-02-10 21:47:16,095 INFO L226 Difference]: Without dead ends: 916 [2022-02-10 21:47:16,096 INFO L933 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-02-10 21:47:16,097 INFO L934 BasicCegarLoop]: 137 mSDtfsCounter, 255 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 21:47:16,097 INFO L935 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 923 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 21:47:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2022-02-10 21:47:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 916. [2022-02-10 21:47:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 915 states have (on average 2.7923497267759565) internal successors, (2555), 915 states have internal predecessors, (2555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 2555 transitions. [2022-02-10 21:47:16,113 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 2555 transitions. Word has length 87 [2022-02-10 21:47:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 21:47:16,113 INFO L470 AbstractCegarLoop]: Abstraction has 916 states and 2555 transitions. [2022-02-10 21:47:16,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 21:47:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 2555 transitions. [2022-02-10 21:47:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-10 21:47:16,118 INFO L507 BasicCegarLoop]: Found error trace [2022-02-10 21:47:16,118 INFO L515 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:47:16,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-10 21:47:16,119 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-02-10 21:47:16,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 21:47:16,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1175237457, now seen corresponding path program 2 times [2022-02-10 21:47:16,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 21:47:16,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844226076] [2022-02-10 21:47:16,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 21:47:16,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 21:47:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 21:47:16,177 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-10 21:47:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 21:47:16,279 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-10 21:47:16,279 INFO L629 BasicCegarLoop]: Counterexample is feasible [2022-02-10 21:47:16,280 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-02-10 21:47:16,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-02-10 21:47:16,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-02-10 21:47:16,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-02-10 21:47:16,281 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-02-10 21:47:16,282 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-02-10 21:47:16,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-10 21:47:16,284 INFO L733 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 21:47:16,288 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 21:47:16,289 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 21:47:16,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 09:47:16 BasicIcfg [2022-02-10 21:47:16,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 21:47:16,428 INFO L158 Benchmark]: Toolchain (without parser) took 11307.07ms. Allocated memory was 177.2MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 118.2MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 386.6MB. Max. memory is 8.0GB. [2022-02-10 21:47:16,429 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 177.2MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 21:47:16,429 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.42ms. Allocated memory was 177.2MB in the beginning and 243.3MB in the end (delta: 66.1MB). Free memory was 118.1MB in the beginning and 202.9MB in the end (delta: -84.8MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-02-10 21:47:16,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.23ms. Allocated memory is still 243.3MB. Free memory was 202.4MB in the beginning and 200.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 21:47:16,429 INFO L158 Benchmark]: Boogie Preprocessor took 48.84ms. Allocated memory is still 243.3MB. Free memory was 200.3MB in the beginning and 198.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-10 21:47:16,429 INFO L158 Benchmark]: RCFGBuilder took 924.18ms. Allocated memory is still 243.3MB. Free memory was 198.2MB in the beginning and 126.9MB in the end (delta: 71.3MB). Peak memory consumption was 71.3MB. Max. memory is 8.0GB. [2022-02-10 21:47:16,430 INFO L158 Benchmark]: TraceAbstraction took 9689.04ms. Allocated memory was 243.3MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 126.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 329.0MB. Max. memory is 8.0GB. [2022-02-10 21:47:16,431 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.15ms. Allocated memory is still 177.2MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 561.42ms. Allocated memory was 177.2MB in the beginning and 243.3MB in the end (delta: 66.1MB). Free memory was 118.1MB in the beginning and 202.9MB in the end (delta: -84.8MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.23ms. Allocated memory is still 243.3MB. Free memory was 202.4MB in the beginning and 200.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.84ms. Allocated memory is still 243.3MB. Free memory was 200.3MB in the beginning and 198.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 924.18ms. Allocated memory is still 243.3MB. Free memory was 198.2MB in the beginning and 126.9MB in the end (delta: 71.3MB). Peak memory consumption was 71.3MB. Max. memory is 8.0GB. * TraceAbstraction took 9689.04ms. Allocated memory was 243.3MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 126.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 329.0MB. 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L718] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L719] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L720] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L721] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L722] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L723] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L724] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L725] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L726] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L727] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L728] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L729] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L730] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L731] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L732] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L734] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L737] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L738] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t2513; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L830] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2513, ((void *)0), P0, ((void *)0))=-2, t2513={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2514; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2514, ((void *)0), P1, ((void *)0))=-1, t2513={5:0}, t2514={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L833] 0 pthread_t t2515; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L834] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2515, ((void *)0), P2, ((void *)0))=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L801] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L742] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L840] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L847] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 19]: 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: 834]: 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: 832]: 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: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1901 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1901 mSDsluCounter, 5568 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4834 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1136 IncrementalHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 1244 mSDtfsCounter, 1136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12292occurred in iteration=0, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 6844 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 850 NumberOfCodeBlocks, 850 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 753 ConstructedInterpolants, 0 QuantifiedInterpolants, 3189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-02-10 21:47:16,468 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...