/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:40:58,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:40:58,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:40:58,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:40:58,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:40:58,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:40:58,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:40:58,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:40:58,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:40:58,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:40:58,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:40:58,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:40:58,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:40:58,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:40:58,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:40:58,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:40:58,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:40:58,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:40:58,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:40:58,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:40:58,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:40:58,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:40:58,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:40:58,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:40:58,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:40:58,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:40:58,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:40:58,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:40:58,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:40:58,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:40:58,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:40:58,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:40:58,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:40:58,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:40:58,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:40:58,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:40:58,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:40:58,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:40:58,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:40:58,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:40:58,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:40:58,346 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:40:58,395 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:40:58,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:40:58,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:40:58,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:40:58,399 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:40:58,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:40:58,399 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:40:58,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:40:58,400 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:40:58,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:40:58,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:40:58,400 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:40:58,400 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:40:58,400 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:40:58,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:40:58,401 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:40:58,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:40:58,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:40:58,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:40:58,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:40:58,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:40:58,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:40:58,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:40:58,404 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:40:58,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:40:58,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:40:58,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:40:58,405 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:40:58,405 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:40:58,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:40:58,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:40:58,700 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:40:58,701 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:40:58,702 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:40:58,702 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i [2020-10-05 23:40:58,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5155bb96/2c6a699db085453aabd8236ed0b30cf4/FLAGd6745e0e4 [2020-10-05 23:40:59,429 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:40:59,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_pso.opt.i [2020-10-05 23:40:59,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5155bb96/2c6a699db085453aabd8236ed0b30cf4/FLAGd6745e0e4 [2020-10-05 23:40:59,653 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5155bb96/2c6a699db085453aabd8236ed0b30cf4 [2020-10-05 23:40:59,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:40:59,664 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:40:59,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:40:59,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:40:59,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:40:59,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:40:59" (1/1) ... [2020-10-05 23:40:59,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c2a4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:40:59, skipping insertion in model container [2020-10-05 23:40:59,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:40:59" (1/1) ... [2020-10-05 23:40:59,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:40:59,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:41:00,376 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:41:00,396 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:41:00,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:41:00,587 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:41:00,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:00 WrapperNode [2020-10-05 23:41:00,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:41:00,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:41:00,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:41:00,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:41:00,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:00" (1/1) ... [2020-10-05 23:41:00,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:00" (1/1) ... [2020-10-05 23:41:00,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:41:00,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:41:00,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:41:00,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:41:00,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:00" (1/1) ... [2020-10-05 23:41:00,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:00" (1/1) ... [2020-10-05 23:41:00,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:00" (1/1) ... [2020-10-05 23:41:00,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:00" (1/1) ... [2020-10-05 23:41:00,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:00" (1/1) ... [2020-10-05 23:41:00,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:00" (1/1) ... [2020-10-05 23:41:00,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:00" (1/1) ... [2020-10-05 23:41:00,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:41:00,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:41:00,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:41:00,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:41:00,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:41:00,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:41:00,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:41:00,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:41:00,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:41:00,799 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:41:00,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:41:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:41:00,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:41:00,800 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:41:00,800 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:41:00,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:41:00,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:41:00,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:41:00,804 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:41:04,803 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:41:04,803 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:41:04,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:41:04 BoogieIcfgContainer [2020-10-05 23:41:04,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:41:04,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:41:04,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:41:04,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:41:04,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:40:59" (1/3) ... [2020-10-05 23:41:04,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac06e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:41:04, skipping insertion in model container [2020-10-05 23:41:04,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:41:00" (2/3) ... [2020-10-05 23:41:04,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac06e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:41:04, skipping insertion in model container [2020-10-05 23:41:04,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:41:04" (3/3) ... [2020-10-05 23:41:04,818 INFO L109 eAbstractionObserver]: Analyzing ICFG safe023_pso.opt.i [2020-10-05 23:41:04,835 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:41:04,835 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:41:04,846 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:41:04,848 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:41:04,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,899 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,899 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,899 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,900 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,901 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,905 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,906 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,907 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,908 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,910 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,911 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,912 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,912 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,912 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,913 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,913 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,913 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,914 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,915 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,916 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,916 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,916 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,921 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,922 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,923 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,925 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,926 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,930 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,931 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,931 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,932 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,938 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,939 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,941 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,942 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,949 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,950 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:41:04,973 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:41:04,996 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:41:04,997 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:41:04,997 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:41:04,997 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:41:04,997 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:41:04,997 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:41:04,997 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:41:04,998 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:41:05,015 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 203 flow [2020-10-05 23:41:05,018 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-05 23:41:05,069 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-05 23:41:05,069 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:41:05,074 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-05 23:41:05,078 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-05 23:41:05,103 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-05 23:41:05,103 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:41:05,104 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-05 23:41:05,106 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1740 [2020-10-05 23:41:05,107 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:41:05,592 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:41:05,724 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-05 23:41:06,295 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:41:06,434 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:41:07,329 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-05 23:41:07,653 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-05 23:41:07,776 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-05 23:41:07,785 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5794 [2020-10-05 23:41:07,785 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2020-10-05 23:41:07,789 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2020-10-05 23:41:07,871 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1346 states. [2020-10-05 23:41:07,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states. [2020-10-05 23:41:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:41:07,880 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:07,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:41:07,882 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:07,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1710719517, now seen corresponding path program 1 times [2020-10-05 23:41:07,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:07,899 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767930073] [2020-10-05 23:41:07,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:08,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:08,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767930073] [2020-10-05 23:41:08,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:08,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:41:08,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805820813] [2020-10-05 23:41:08,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:41:08,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:08,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:41:08,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:41:08,188 INFO L87 Difference]: Start difference. First operand 1346 states. Second operand 3 states. [2020-10-05 23:41:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:08,328 INFO L93 Difference]: Finished difference Result 1124 states and 3637 transitions. [2020-10-05 23:41:08,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:41:08,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:41:08,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:08,376 INFO L225 Difference]: With dead ends: 1124 [2020-10-05 23:41:08,376 INFO L226 Difference]: Without dead ends: 824 [2020-10-05 23:41:08,377 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:41:08,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2020-10-05 23:41:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2020-10-05 23:41:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2020-10-05 23:41:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2607 transitions. [2020-10-05 23:41:08,526 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2607 transitions. Word has length 5 [2020-10-05 23:41:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:08,527 INFO L479 AbstractCegarLoop]: Abstraction has 824 states and 2607 transitions. [2020-10-05 23:41:08,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:41:08,527 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2607 transitions. [2020-10-05 23:41:08,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 23:41:08,530 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:08,531 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:41:08,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:41:08,531 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:08,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:08,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1176658182, now seen corresponding path program 1 times [2020-10-05 23:41:08,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:08,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125741179] [2020-10-05 23:41:08,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:08,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125741179] [2020-10-05 23:41:08,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:08,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:41:08,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447953997] [2020-10-05 23:41:08,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:41:08,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:08,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:41:08,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:41:08,724 INFO L87 Difference]: Start difference. First operand 824 states and 2607 transitions. Second operand 4 states. [2020-10-05 23:41:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:08,785 INFO L93 Difference]: Finished difference Result 824 states and 2507 transitions. [2020-10-05 23:41:08,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:41:08,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-05 23:41:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:08,791 INFO L225 Difference]: With dead ends: 824 [2020-10-05 23:41:08,791 INFO L226 Difference]: Without dead ends: 674 [2020-10-05 23:41:08,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:41:08,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2020-10-05 23:41:08,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2020-10-05 23:41:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-10-05 23:41:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 2067 transitions. [2020-10-05 23:41:08,817 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 2067 transitions. Word has length 10 [2020-10-05 23:41:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:08,818 INFO L479 AbstractCegarLoop]: Abstraction has 674 states and 2067 transitions. [2020-10-05 23:41:08,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:41:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 2067 transitions. [2020-10-05 23:41:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:41:08,822 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:08,822 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:41:08,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:41:08,822 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:08,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:08,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1344113875, now seen corresponding path program 1 times [2020-10-05 23:41:08,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:08,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323356632] [2020-10-05 23:41:08,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:08,990 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323356632] [2020-10-05 23:41:08,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:08,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:41:08,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425763076] [2020-10-05 23:41:08,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:41:08,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:08,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:41:08,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:41:08,992 INFO L87 Difference]: Start difference. First operand 674 states and 2067 transitions. Second operand 4 states. [2020-10-05 23:41:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:09,037 INFO L93 Difference]: Finished difference Result 719 states and 2148 transitions. [2020-10-05 23:41:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:41:09,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-05 23:41:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:09,043 INFO L225 Difference]: With dead ends: 719 [2020-10-05 23:41:09,043 INFO L226 Difference]: Without dead ends: 644 [2020-10-05 23:41:09,044 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:41:09,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2020-10-05 23:41:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2020-10-05 23:41:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2020-10-05 23:41:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1963 transitions. [2020-10-05 23:41:09,069 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1963 transitions. Word has length 13 [2020-10-05 23:41:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:09,070 INFO L479 AbstractCegarLoop]: Abstraction has 644 states and 1963 transitions. [2020-10-05 23:41:09,070 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:41:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1963 transitions. [2020-10-05 23:41:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:41:09,073 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:09,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:41:09,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:41:09,074 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:09,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:09,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1320556469, now seen corresponding path program 1 times [2020-10-05 23:41:09,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:09,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150722848] [2020-10-05 23:41:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:09,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150722848] [2020-10-05 23:41:09,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:09,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:41:09,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094612370] [2020-10-05 23:41:09,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:41:09,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:09,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:41:09,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:41:09,314 INFO L87 Difference]: Start difference. First operand 644 states and 1963 transitions. Second operand 5 states. [2020-10-05 23:41:09,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:09,399 INFO L93 Difference]: Finished difference Result 872 states and 2622 transitions. [2020-10-05 23:41:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:41:09,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 23:41:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:09,403 INFO L225 Difference]: With dead ends: 872 [2020-10-05 23:41:09,403 INFO L226 Difference]: Without dead ends: 452 [2020-10-05 23:41:09,404 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:41:09,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-05 23:41:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-10-05 23:41:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-10-05 23:41:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1295 transitions. [2020-10-05 23:41:09,418 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1295 transitions. Word has length 14 [2020-10-05 23:41:09,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:09,419 INFO L479 AbstractCegarLoop]: Abstraction has 452 states and 1295 transitions. [2020-10-05 23:41:09,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:41:09,419 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1295 transitions. [2020-10-05 23:41:09,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:41:09,421 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:09,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:41:09,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:41:09,421 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:09,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:09,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1717675043, now seen corresponding path program 1 times [2020-10-05 23:41:09,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:09,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262591579] [2020-10-05 23:41:09,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:09,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262591579] [2020-10-05 23:41:09,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:09,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:41:09,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097795104] [2020-10-05 23:41:09,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:41:09,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:09,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:41:09,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:41:09,732 INFO L87 Difference]: Start difference. First operand 452 states and 1295 transitions. Second operand 9 states. [2020-10-05 23:41:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:10,167 INFO L93 Difference]: Finished difference Result 556 states and 1579 transitions. [2020-10-05 23:41:10,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 23:41:10,168 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-05 23:41:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:10,172 INFO L225 Difference]: With dead ends: 556 [2020-10-05 23:41:10,172 INFO L226 Difference]: Without dead ends: 517 [2020-10-05 23:41:10,173 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:41:10,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-10-05 23:41:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 504. [2020-10-05 23:41:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2020-10-05 23:41:10,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1450 transitions. [2020-10-05 23:41:10,189 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1450 transitions. Word has length 16 [2020-10-05 23:41:10,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:10,189 INFO L479 AbstractCegarLoop]: Abstraction has 504 states and 1450 transitions. [2020-10-05 23:41:10,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:41:10,190 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1450 transitions. [2020-10-05 23:41:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:41:10,191 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:10,191 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:41:10,192 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:41:10,192 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:10,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1645143937, now seen corresponding path program 2 times [2020-10-05 23:41:10,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:10,193 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61767508] [2020-10-05 23:41:10,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:10,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61767508] [2020-10-05 23:41:10,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:10,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:41:10,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883119889] [2020-10-05 23:41:10,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:41:10,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:10,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:41:10,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:41:10,416 INFO L87 Difference]: Start difference. First operand 504 states and 1450 transitions. Second operand 9 states. [2020-10-05 23:41:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:10,789 INFO L93 Difference]: Finished difference Result 605 states and 1725 transitions. [2020-10-05 23:41:10,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 23:41:10,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-05 23:41:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:10,794 INFO L225 Difference]: With dead ends: 605 [2020-10-05 23:41:10,795 INFO L226 Difference]: Without dead ends: 569 [2020-10-05 23:41:10,795 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:41:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2020-10-05 23:41:10,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 517. [2020-10-05 23:41:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-05 23:41:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1492 transitions. [2020-10-05 23:41:10,811 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1492 transitions. Word has length 16 [2020-10-05 23:41:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:10,811 INFO L479 AbstractCegarLoop]: Abstraction has 517 states and 1492 transitions. [2020-10-05 23:41:10,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:41:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1492 transitions. [2020-10-05 23:41:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:41:10,813 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:10,814 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:41:10,814 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:41:10,814 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:10,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:10,815 INFO L82 PathProgramCache]: Analyzing trace with hash 732991879, now seen corresponding path program 3 times [2020-10-05 23:41:10,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:10,815 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868419368] [2020-10-05 23:41:10,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:11,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868419368] [2020-10-05 23:41:11,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:11,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:41:11,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275808493] [2020-10-05 23:41:11,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:41:11,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:11,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:41:11,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:41:11,014 INFO L87 Difference]: Start difference. First operand 517 states and 1492 transitions. Second operand 9 states. [2020-10-05 23:41:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:11,550 INFO L93 Difference]: Finished difference Result 957 states and 2694 transitions. [2020-10-05 23:41:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 23:41:11,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-05 23:41:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:11,557 INFO L225 Difference]: With dead ends: 957 [2020-10-05 23:41:11,557 INFO L226 Difference]: Without dead ends: 723 [2020-10-05 23:41:11,558 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:41:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2020-10-05 23:41:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 503. [2020-10-05 23:41:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2020-10-05 23:41:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 1401 transitions. [2020-10-05 23:41:11,580 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 1401 transitions. Word has length 16 [2020-10-05 23:41:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:11,580 INFO L479 AbstractCegarLoop]: Abstraction has 503 states and 1401 transitions. [2020-10-05 23:41:11,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:41:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 1401 transitions. [2020-10-05 23:41:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:41:11,582 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:11,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:41:11,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:41:11,583 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash 452774403, now seen corresponding path program 1 times [2020-10-05 23:41:11,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:11,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5192211] [2020-10-05 23:41:11,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:11,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5192211] [2020-10-05 23:41:11,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:11,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:41:11,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394236104] [2020-10-05 23:41:11,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:41:11,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:11,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:41:11,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:41:11,739 INFO L87 Difference]: Start difference. First operand 503 states and 1401 transitions. Second operand 4 states. [2020-10-05 23:41:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:11,768 INFO L93 Difference]: Finished difference Result 486 states and 1207 transitions. [2020-10-05 23:41:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:41:11,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-05 23:41:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:11,771 INFO L225 Difference]: With dead ends: 486 [2020-10-05 23:41:11,772 INFO L226 Difference]: Without dead ends: 369 [2020-10-05 23:41:11,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:41:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2020-10-05 23:41:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2020-10-05 23:41:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-10-05 23:41:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 897 transitions. [2020-10-05 23:41:11,782 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 897 transitions. Word has length 17 [2020-10-05 23:41:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:11,783 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 897 transitions. [2020-10-05 23:41:11,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:41:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 897 transitions. [2020-10-05 23:41:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:41:11,784 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:11,784 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:41:11,784 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:41:11,784 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:11,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1797287306, now seen corresponding path program 1 times [2020-10-05 23:41:11,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:11,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141634667] [2020-10-05 23:41:11,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:11,910 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141634667] [2020-10-05 23:41:11,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:11,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:41:11,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650241] [2020-10-05 23:41:11,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:41:11,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:11,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:41:11,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:41:11,912 INFO L87 Difference]: Start difference. First operand 369 states and 897 transitions. Second operand 5 states. [2020-10-05 23:41:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:11,950 INFO L93 Difference]: Finished difference Result 305 states and 686 transitions. [2020-10-05 23:41:11,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:41:11,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-05 23:41:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:11,952 INFO L225 Difference]: With dead ends: 305 [2020-10-05 23:41:11,952 INFO L226 Difference]: Without dead ends: 245 [2020-10-05 23:41:11,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:41:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-10-05 23:41:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2020-10-05 23:41:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-10-05 23:41:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 533 transitions. [2020-10-05 23:41:11,959 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 533 transitions. Word has length 18 [2020-10-05 23:41:11,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:11,960 INFO L479 AbstractCegarLoop]: Abstraction has 242 states and 533 transitions. [2020-10-05 23:41:11,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:41:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 533 transitions. [2020-10-05 23:41:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:41:11,961 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:11,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:41:11,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:41:11,961 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:11,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:11,962 INFO L82 PathProgramCache]: Analyzing trace with hash -897419567, now seen corresponding path program 1 times [2020-10-05 23:41:11,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:11,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135540401] [2020-10-05 23:41:11,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:12,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135540401] [2020-10-05 23:41:12,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:12,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:41:12,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908576905] [2020-10-05 23:41:12,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:41:12,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:12,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:41:12,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:41:12,090 INFO L87 Difference]: Start difference. First operand 242 states and 533 transitions. Second operand 6 states. [2020-10-05 23:41:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:12,137 INFO L93 Difference]: Finished difference Result 217 states and 481 transitions. [2020-10-05 23:41:12,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:41:12,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-05 23:41:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:12,139 INFO L225 Difference]: With dead ends: 217 [2020-10-05 23:41:12,139 INFO L226 Difference]: Without dead ends: 204 [2020-10-05 23:41:12,140 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:41:12,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-10-05 23:41:12,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 168. [2020-10-05 23:41:12,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-05 23:41:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 379 transitions. [2020-10-05 23:41:12,145 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 379 transitions. Word has length 20 [2020-10-05 23:41:12,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:12,145 INFO L479 AbstractCegarLoop]: Abstraction has 168 states and 379 transitions. [2020-10-05 23:41:12,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:41:12,146 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 379 transitions. [2020-10-05 23:41:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:41:12,146 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:12,147 INFO L422 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] [2020-10-05 23:41:12,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:41:12,147 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:12,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:12,147 INFO L82 PathProgramCache]: Analyzing trace with hash -48895144, now seen corresponding path program 1 times [2020-10-05 23:41:12,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:12,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221610003] [2020-10-05 23:41:12,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:12,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:12,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221610003] [2020-10-05 23:41:12,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:12,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:41:12,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888005526] [2020-10-05 23:41:12,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:41:12,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:12,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:41:12,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:41:12,332 INFO L87 Difference]: Start difference. First operand 168 states and 379 transitions. Second operand 7 states. [2020-10-05 23:41:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:12,590 INFO L93 Difference]: Finished difference Result 321 states and 698 transitions. [2020-10-05 23:41:12,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:41:12,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:41:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:12,593 INFO L225 Difference]: With dead ends: 321 [2020-10-05 23:41:12,593 INFO L226 Difference]: Without dead ends: 255 [2020-10-05 23:41:12,594 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:41:12,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-10-05 23:41:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 220. [2020-10-05 23:41:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2020-10-05 23:41:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 496 transitions. [2020-10-05 23:41:12,601 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 496 transitions. Word has length 23 [2020-10-05 23:41:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:12,601 INFO L479 AbstractCegarLoop]: Abstraction has 220 states and 496 transitions. [2020-10-05 23:41:12,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:41:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 496 transitions. [2020-10-05 23:41:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:41:12,602 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:12,603 INFO L422 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] [2020-10-05 23:41:12,603 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:41:12,603 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:12,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1940087594, now seen corresponding path program 2 times [2020-10-05 23:41:12,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:12,604 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642422967] [2020-10-05 23:41:12,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:13,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642422967] [2020-10-05 23:41:13,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:13,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 23:41:13,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025559636] [2020-10-05 23:41:13,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 23:41:13,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:13,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 23:41:13,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:41:13,192 INFO L87 Difference]: Start difference. First operand 220 states and 496 transitions. Second operand 14 states. [2020-10-05 23:41:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:13,787 INFO L93 Difference]: Finished difference Result 267 states and 600 transitions. [2020-10-05 23:41:13,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-05 23:41:13,787 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2020-10-05 23:41:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:13,789 INFO L225 Difference]: With dead ends: 267 [2020-10-05 23:41:13,789 INFO L226 Difference]: Without dead ends: 243 [2020-10-05 23:41:13,790 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2020-10-05 23:41:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-10-05 23:41:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 215. [2020-10-05 23:41:13,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-10-05 23:41:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 484 transitions. [2020-10-05 23:41:13,799 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 484 transitions. Word has length 23 [2020-10-05 23:41:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:13,799 INFO L479 AbstractCegarLoop]: Abstraction has 215 states and 484 transitions. [2020-10-05 23:41:13,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 23:41:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 484 transitions. [2020-10-05 23:41:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:41:13,801 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:13,801 INFO L422 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] [2020-10-05 23:41:13,801 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:41:13,801 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:13,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:13,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1385413476, now seen corresponding path program 3 times [2020-10-05 23:41:13,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:13,802 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485410597] [2020-10-05 23:41:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:14,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485410597] [2020-10-05 23:41:14,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:14,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 23:41:14,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16393257] [2020-10-05 23:41:14,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 23:41:14,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:14,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 23:41:14,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:41:14,359 INFO L87 Difference]: Start difference. First operand 215 states and 484 transitions. Second operand 14 states. [2020-10-05 23:41:15,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:15,098 INFO L93 Difference]: Finished difference Result 289 states and 642 transitions. [2020-10-05 23:41:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-05 23:41:15,099 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2020-10-05 23:41:15,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:15,101 INFO L225 Difference]: With dead ends: 289 [2020-10-05 23:41:15,101 INFO L226 Difference]: Without dead ends: 228 [2020-10-05 23:41:15,102 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2020-10-05 23:41:15,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-10-05 23:41:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 196. [2020-10-05 23:41:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-10-05 23:41:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 443 transitions. [2020-10-05 23:41:15,108 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 443 transitions. Word has length 23 [2020-10-05 23:41:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:15,108 INFO L479 AbstractCegarLoop]: Abstraction has 196 states and 443 transitions. [2020-10-05 23:41:15,108 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 23:41:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 443 transitions. [2020-10-05 23:41:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:41:15,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:15,109 INFO L422 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] [2020-10-05 23:41:15,109 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:41:15,110 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:15,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1638973074, now seen corresponding path program 4 times [2020-10-05 23:41:15,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:15,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492546905] [2020-10-05 23:41:15,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:15,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492546905] [2020-10-05 23:41:15,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:15,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:41:15,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508660614] [2020-10-05 23:41:15,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:41:15,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:15,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:41:15,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:41:15,416 INFO L87 Difference]: Start difference. First operand 196 states and 443 transitions. Second operand 8 states. [2020-10-05 23:41:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:15,732 INFO L93 Difference]: Finished difference Result 309 states and 675 transitions. [2020-10-05 23:41:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-05 23:41:15,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-05 23:41:15,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:15,735 INFO L225 Difference]: With dead ends: 309 [2020-10-05 23:41:15,735 INFO L226 Difference]: Without dead ends: 237 [2020-10-05 23:41:15,735 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:41:15,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-10-05 23:41:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 203. [2020-10-05 23:41:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-10-05 23:41:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 455 transitions. [2020-10-05 23:41:15,741 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 455 transitions. Word has length 23 [2020-10-05 23:41:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:15,741 INFO L479 AbstractCegarLoop]: Abstraction has 203 states and 455 transitions. [2020-10-05 23:41:15,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:41:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 455 transitions. [2020-10-05 23:41:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:41:15,743 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:15,743 INFO L422 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] [2020-10-05 23:41:15,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:41:15,743 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:15,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:15,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1205062680, now seen corresponding path program 5 times [2020-10-05 23:41:15,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:15,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457268341] [2020-10-05 23:41:15,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:16,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457268341] [2020-10-05 23:41:16,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:16,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:41:16,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365524484] [2020-10-05 23:41:16,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:41:16,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:16,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:41:16,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:41:16,045 INFO L87 Difference]: Start difference. First operand 203 states and 455 transitions. Second operand 9 states. [2020-10-05 23:41:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:16,457 INFO L93 Difference]: Finished difference Result 351 states and 743 transitions. [2020-10-05 23:41:16,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:41:16,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-05 23:41:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:16,461 INFO L225 Difference]: With dead ends: 351 [2020-10-05 23:41:16,461 INFO L226 Difference]: Without dead ends: 260 [2020-10-05 23:41:16,465 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:41:16,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-10-05 23:41:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 183. [2020-10-05 23:41:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-05 23:41:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 405 transitions. [2020-10-05 23:41:16,474 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 405 transitions. Word has length 23 [2020-10-05 23:41:16,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:16,474 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 405 transitions. [2020-10-05 23:41:16,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:41:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 405 transitions. [2020-10-05 23:41:16,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:41:16,475 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:16,476 INFO L422 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] [2020-10-05 23:41:16,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:41:16,477 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:16,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:16,477 INFO L82 PathProgramCache]: Analyzing trace with hash 289309428, now seen corresponding path program 6 times [2020-10-05 23:41:16,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:16,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586165016] [2020-10-05 23:41:16,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:17,092 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 37 [2020-10-05 23:41:17,241 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2020-10-05 23:41:17,562 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2020-10-05 23:41:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:17,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586165016] [2020-10-05 23:41:17,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:17,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-05 23:41:17,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052605691] [2020-10-05 23:41:17,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-05 23:41:17,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:17,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-05 23:41:17,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-10-05 23:41:17,785 INFO L87 Difference]: Start difference. First operand 183 states and 405 transitions. Second operand 16 states. [2020-10-05 23:41:17,978 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 36 [2020-10-05 23:41:18,108 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 32 [2020-10-05 23:41:19,135 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2020-10-05 23:41:19,674 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2020-10-05 23:41:20,064 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-10-05 23:41:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:20,676 INFO L93 Difference]: Finished difference Result 346 states and 740 transitions. [2020-10-05 23:41:20,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-05 23:41:20,676 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2020-10-05 23:41:20,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:20,678 INFO L225 Difference]: With dead ends: 346 [2020-10-05 23:41:20,678 INFO L226 Difference]: Without dead ends: 313 [2020-10-05 23:41:20,679 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2020-10-05 23:41:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-10-05 23:41:20,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 205. [2020-10-05 23:41:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-10-05 23:41:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 449 transitions. [2020-10-05 23:41:20,686 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 449 transitions. Word has length 23 [2020-10-05 23:41:20,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:20,686 INFO L479 AbstractCegarLoop]: Abstraction has 205 states and 449 transitions. [2020-10-05 23:41:20,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-05 23:41:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 449 transitions. [2020-10-05 23:41:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:41:20,687 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:20,687 INFO L422 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] [2020-10-05 23:41:20,688 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:41:20,688 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:20,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:20,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1654614334, now seen corresponding path program 7 times [2020-10-05 23:41:20,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:20,689 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043827556] [2020-10-05 23:41:20,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:20,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043827556] [2020-10-05 23:41:20,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:20,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:41:20,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407476940] [2020-10-05 23:41:20,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:41:20,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:20,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:41:20,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:41:20,962 INFO L87 Difference]: Start difference. First operand 205 states and 449 transitions. Second operand 7 states. [2020-10-05 23:41:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:21,246 INFO L93 Difference]: Finished difference Result 236 states and 503 transitions. [2020-10-05 23:41:21,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:41:21,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 23:41:21,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:21,248 INFO L225 Difference]: With dead ends: 236 [2020-10-05 23:41:21,248 INFO L226 Difference]: Without dead ends: 154 [2020-10-05 23:41:21,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:41:21,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-10-05 23:41:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2020-10-05 23:41:21,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-05 23:41:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 283 transitions. [2020-10-05 23:41:21,256 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 283 transitions. Word has length 23 [2020-10-05 23:41:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:21,256 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 283 transitions. [2020-10-05 23:41:21,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:41:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 283 transitions. [2020-10-05 23:41:21,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:41:21,257 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:21,257 INFO L422 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] [2020-10-05 23:41:21,258 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:41:21,258 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:21,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:21,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2128492446, now seen corresponding path program 8 times [2020-10-05 23:41:21,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:21,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110039489] [2020-10-05 23:41:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:21,605 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110039489] [2020-10-05 23:41:21,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:21,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:41:21,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001429606] [2020-10-05 23:41:21,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:41:21,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:21,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:41:21,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:41:21,610 INFO L87 Difference]: Start difference. First operand 138 states and 283 transitions. Second operand 8 states. [2020-10-05 23:41:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:21,909 INFO L93 Difference]: Finished difference Result 220 states and 445 transitions. [2020-10-05 23:41:21,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:41:21,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-05 23:41:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:21,911 INFO L225 Difference]: With dead ends: 220 [2020-10-05 23:41:21,911 INFO L226 Difference]: Without dead ends: 126 [2020-10-05 23:41:21,912 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:41:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-10-05 23:41:21,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2020-10-05 23:41:21,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-05 23:41:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 250 transitions. [2020-10-05 23:41:21,915 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 250 transitions. Word has length 23 [2020-10-05 23:41:21,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:21,915 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 250 transitions. [2020-10-05 23:41:21,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:41:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 250 transitions. [2020-10-05 23:41:21,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:41:21,916 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:21,916 INFO L422 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] [2020-10-05 23:41:21,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 23:41:21,916 INFO L427 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:21,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:21,917 INFO L82 PathProgramCache]: Analyzing trace with hash 68882756, now seen corresponding path program 9 times [2020-10-05 23:41:21,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:21,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617647693] [2020-10-05 23:41:21,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:22,534 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 24 [2020-10-05 23:41:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:22,709 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617647693] [2020-10-05 23:41:22,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:22,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-05 23:41:22,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368939844] [2020-10-05 23:41:22,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-05 23:41:22,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:22,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-05 23:41:22,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-05 23:41:22,712 INFO L87 Difference]: Start difference. First operand 121 states and 250 transitions. Second operand 13 states. [2020-10-05 23:41:23,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:23,833 INFO L93 Difference]: Finished difference Result 250 states and 466 transitions. [2020-10-05 23:41:23,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-05 23:41:23,834 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2020-10-05 23:41:23,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:23,835 INFO L225 Difference]: With dead ends: 250 [2020-10-05 23:41:23,835 INFO L226 Difference]: Without dead ends: 68 [2020-10-05 23:41:23,836 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2020-10-05 23:41:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-05 23:41:23,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-10-05 23:41:23,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-05 23:41:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 123 transitions. [2020-10-05 23:41:23,838 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 123 transitions. Word has length 23 [2020-10-05 23:41:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:23,839 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 123 transitions. [2020-10-05 23:41:23,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-05 23:41:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 123 transitions. [2020-10-05 23:41:23,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:41:23,839 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:23,840 INFO L422 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] [2020-10-05 23:41:23,841 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:41:23,841 INFO L427 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:23,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:23,842 INFO L82 PathProgramCache]: Analyzing trace with hash -38633998, now seen corresponding path program 10 times [2020-10-05 23:41:23,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:23,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921487602] [2020-10-05 23:41:23,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:41:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:41:24,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921487602] [2020-10-05 23:41:24,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:41:24,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:41:24,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523540803] [2020-10-05 23:41:24,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:41:24,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:41:24,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:41:24,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:41:24,159 INFO L87 Difference]: Start difference. First operand 68 states and 123 transitions. Second operand 8 states. [2020-10-05 23:41:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:41:24,519 INFO L93 Difference]: Finished difference Result 114 states and 209 transitions. [2020-10-05 23:41:24,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:41:24,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-05 23:41:24,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:41:24,520 INFO L225 Difference]: With dead ends: 114 [2020-10-05 23:41:24,521 INFO L226 Difference]: Without dead ends: 64 [2020-10-05 23:41:24,521 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:41:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-05 23:41:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2020-10-05 23:41:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-05 23:41:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions. [2020-10-05 23:41:24,523 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 91 transitions. Word has length 23 [2020-10-05 23:41:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:41:24,523 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 91 transitions. [2020-10-05 23:41:24,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:41:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 91 transitions. [2020-10-05 23:41:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 23:41:24,524 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:41:24,524 INFO L422 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] [2020-10-05 23:41:24,524 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:41:24,524 INFO L427 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:41:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:41:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash -725561230, now seen corresponding path program 11 times [2020-10-05 23:41:24,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:41:24,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976071805] [2020-10-05 23:41:24,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:41:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:41:24,617 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:41:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:41:24,699 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:41:24,741 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:41:24,741 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:41:24,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-05 23:41:24,778 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,781 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,781 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,781 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,783 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,783 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,784 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,784 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,784 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,785 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,785 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,785 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,786 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,786 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,787 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,787 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,787 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,788 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,788 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,788 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,790 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,790 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,790 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,791 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,791 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,792 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,792 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,792 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,793 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,793 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,793 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,793 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,793 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,794 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,794 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,794 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,794 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,794 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,795 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,796 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,796 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,796 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,797 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,797 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,798 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,798 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,798 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,798 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,798 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,799 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,799 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,800 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,800 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,801 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,801 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,801 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,802 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,802 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,802 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,803 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,803 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,803 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,804 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 23:41:24,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:41:24,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:41:24 BasicIcfg [2020-10-05 23:41:24,867 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:41:24,868 INFO L168 Benchmark]: Toolchain (without parser) took 25204.87 ms. Allocated memory was 140.5 MB in the beginning and 539.5 MB in the end (delta: 399.0 MB). Free memory was 101.9 MB in the beginning and 391.7 MB in the end (delta: -289.8 MB). Peak memory consumption was 109.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:41:24,869 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-05 23:41:24,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 924.39 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 101.7 MB in the beginning and 155.8 MB in the end (delta: -54.1 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:41:24,870 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.68 ms. Allocated memory is still 204.5 MB. Free memory was 155.8 MB in the beginning and 152.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-05 23:41:24,870 INFO L168 Benchmark]: Boogie Preprocessor took 51.21 ms. Allocated memory is still 204.5 MB. Free memory was 152.4 MB in the beginning and 149.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:41:24,871 INFO L168 Benchmark]: RCFGBuilder took 4097.43 ms. Allocated memory was 204.5 MB in the beginning and 296.2 MB in the end (delta: 91.8 MB). Free memory was 149.1 MB in the beginning and 219.9 MB in the end (delta: -70.8 MB). Peak memory consumption was 106.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:41:24,872 INFO L168 Benchmark]: TraceAbstraction took 20058.12 ms. Allocated memory was 296.2 MB in the beginning and 539.5 MB in the end (delta: 243.3 MB). Free memory was 219.9 MB in the beginning and 391.7 MB in the end (delta: -171.8 MB). Peak memory consumption was 71.5 MB. Max. memory is 7.1 GB. [2020-10-05 23:41:24,874 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 924.39 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 101.7 MB in the beginning and 155.8 MB in the end (delta: -54.1 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.68 ms. Allocated memory is still 204.5 MB. Free memory was 155.8 MB in the beginning and 152.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.21 ms. Allocated memory is still 204.5 MB. Free memory was 152.4 MB in the beginning and 149.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4097.43 ms. Allocated memory was 204.5 MB in the beginning and 296.2 MB in the end (delta: 91.8 MB). Free memory was 149.1 MB in the beginning and 219.9 MB in the end (delta: -70.8 MB). Peak memory consumption was 106.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20058.12 ms. Allocated memory was 296.2 MB in the beginning and 539.5 MB in the end (delta: 243.3 MB). Free memory was 219.9 MB in the beginning and 391.7 MB in the end (delta: -171.8 MB). Peak memory consumption was 71.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 102 ProgramPointsBefore, 39 ProgramPointsAfterwards, 94 TransitionsBefore, 30 TransitionsAfterwards, 1740 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 779 VarBasedMoverChecksPositive, 26 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5794 CheckedPairsTotal, 74 TotalNumberOfCompositions - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L712] 0 _Bool y$flush_delayed; [L713] 0 int y$mem_tmp; [L714] 0 _Bool y$r_buff0_thd0; [L715] 0 _Bool y$r_buff0_thd1; [L716] 0 _Bool y$r_buff0_thd2; [L717] 0 _Bool y$r_buff0_thd3; [L718] 0 _Bool y$r_buff1_thd0; [L719] 0 _Bool y$r_buff1_thd1; [L720] 0 _Bool y$r_buff1_thd2; [L721] 0 _Bool y$r_buff1_thd3; [L722] 0 _Bool y$read_delayed; [L723] 0 int *y$read_delayed_var; [L724] 0 int y$w_buff0; [L725] 0 _Bool y$w_buff0_used; [L726] 0 int y$w_buff1; [L727] 0 _Bool y$w_buff1_used; [L728] 0 _Bool weak$$choice0; [L729] 0 _Bool weak$$choice2; [L843] 0 pthread_t t2330; [L844] FCALL, FORK 0 pthread_create(&t2330, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] 0 pthread_t t2331; [L846] FCALL, FORK 0 pthread_create(&t2331, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 2 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L847] 0 pthread_t t2332; [L848] FCALL, FORK 0 pthread_create(&t2332, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L812] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = y [L817] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L821] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L821] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L821] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L822] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L823] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L824] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L825] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L733] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L744] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L745] 1 y$flush_delayed = weak$$choice2 [L746] 1 y$mem_tmp = y [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L748] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L749] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L749] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L750] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L750] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L751] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L753] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L753] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L754] 1 __unbuffered_p0_EAX = y [L755] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L755] 1 y = y$flush_delayed ? y$mem_tmp : y [L756] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L762] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L763] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L763] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 93 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.7s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 548 SDtfs, 960 SDslu, 1963 SDs, 0 SdLazy, 2293 SolverSat, 535 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1346occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 669 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 398 NumberOfCodeBlocks, 398 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 355 ConstructedInterpolants, 0 QuantifiedInterpolants, 88991 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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! Received shutdown request...