/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/safe032_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:42:17,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:42:17,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:42:17,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:42:17,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:42:17,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:42:17,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:42:17,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:42:17,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:42:17,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:42:17,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:42:17,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:42:17,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:42:17,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:42:17,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:42:17,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:42:17,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:42:17,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:42:17,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:42:17,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:42:17,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:42:17,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:42:17,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:42:17,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:42:17,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:42:17,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:42:17,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:42:17,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:42:17,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:42:17,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:42:17,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:42:17,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:42:17,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:42:17,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:42:17,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:42:17,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:42:17,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:42:17,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:42:17,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:42:17,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:42:17,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:42:17,445 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:42:17,483 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:42:17,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:42:17,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:42:17,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:42:17,485 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:42:17,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:42:17,485 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:42:17,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:42:17,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:42:17,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:42:17,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:42:17,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:42:17,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:42:17,488 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:42:17,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:42:17,488 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:42:17,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:42:17,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:42:17,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:42:17,489 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:42:17,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:42:17,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:42:17,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:42:17,490 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:42:17,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:42:17,490 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:42:17,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:42:17,490 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:42:17,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:42:17,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:42:17,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:42:17,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:42:17,816 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:42:17,816 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:42:17,817 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i [2020-10-05 23:42:17,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9909d38c/0e55219f35a0475191f203d28467bd7b/FLAG152d0a423 [2020-10-05 23:42:18,461 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:42:18,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i [2020-10-05 23:42:18,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9909d38c/0e55219f35a0475191f203d28467bd7b/FLAG152d0a423 [2020-10-05 23:42:18,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9909d38c/0e55219f35a0475191f203d28467bd7b [2020-10-05 23:42:18,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:42:18,748 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:42:18,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:42:18,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:42:18,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:42:18,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:42:18" (1/1) ... [2020-10-05 23:42:18,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28fd79a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:18, skipping insertion in model container [2020-10-05 23:42:18,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:42:18" (1/1) ... [2020-10-05 23:42:18,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:42:18,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:42:19,481 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:42:19,503 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:42:19,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:42:19,642 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:42:19,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19 WrapperNode [2020-10-05 23:42:19,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:42:19,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:42:19,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:42:19,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:42:19,652 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:42:19" (1/1) ... [2020-10-05 23:42:19,676 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:42:19" (1/1) ... [2020-10-05 23:42:19,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:42:19,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:42:19,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:42:19,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:42:19,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (1/1) ... [2020-10-05 23:42:19,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:42:19,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:42:19,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:42:19,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:42:19,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (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:42:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:42:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:42:19,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:42:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:42:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:42:19,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:42:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:42:19,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:42:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:42:19,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:42:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:42:19,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:42:19,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:42:19,889 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:42:23,353 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:42:23,353 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:42:23,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:42:23 BoogieIcfgContainer [2020-10-05 23:42:23,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:42:23,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:42:23,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:42:23,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:42:23,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:42:18" (1/3) ... [2020-10-05 23:42:23,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c509d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:42:23, skipping insertion in model container [2020-10-05 23:42:23,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:42:19" (2/3) ... [2020-10-05 23:42:23,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c509d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:42:23, skipping insertion in model container [2020-10-05 23:42:23,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:42:23" (3/3) ... [2020-10-05 23:42:23,367 INFO L109 eAbstractionObserver]: Analyzing ICFG safe032_rmo.opt.i [2020-10-05 23:42:23,383 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:42:23,383 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:42:23,393 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:42:23,395 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:42:23,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,442 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,442 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,442 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,453 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,467 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,467 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,476 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,490 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,494 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,498 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,499 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,500 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:42:23,517 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 23:42:23,540 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:42:23,541 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:42:23,541 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:42:23,541 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:42:23,541 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:42:23,541 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:42:23,541 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:42:23,542 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:42:23,558 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-05 23:42:23,560 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-05 23:42:23,609 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-05 23:42:23,610 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:42:23,615 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:42:23,619 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-05 23:42:23,642 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-05 23:42:23,642 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:42:23,643 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-05 23:42:23,645 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1624 [2020-10-05 23:42:23,646 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:42:24,774 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 23:42:26,389 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-05 23:42:26,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-05 23:42:26,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:42:26,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 23:42:26,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:42:27,615 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 146 DAG size of output: 126 [2020-10-05 23:42:28,680 WARN L193 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-05 23:42:28,986 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-05 23:42:30,365 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-05 23:42:30,702 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-05 23:42:30,945 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-05 23:42:31,078 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-05 23:42:31,087 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4118 [2020-10-05 23:42:31,090 INFO L214 etLargeBlockEncoding]: Total number of compositions: 74 [2020-10-05 23:42:31,096 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-05 23:42:31,159 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 778 states. [2020-10-05 23:42:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states. [2020-10-05 23:42:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-05 23:42:31,170 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:31,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:31,171 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:31,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:31,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1033422208, now seen corresponding path program 1 times [2020-10-05 23:42:31,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:31,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759438476] [2020-10-05 23:42:31,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:31,437 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:42:31,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759438476] [2020-10-05 23:42:31,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:31,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:31,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851375151] [2020-10-05 23:42:31,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:31,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:31,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:31,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:31,465 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 3 states. [2020-10-05 23:42:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:31,614 INFO L93 Difference]: Finished difference Result 658 states and 2050 transitions. [2020-10-05 23:42:31,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:31,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-05 23:42:31,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:31,640 INFO L225 Difference]: With dead ends: 658 [2020-10-05 23:42:31,641 INFO L226 Difference]: Without dead ends: 538 [2020-10-05 23:42:31,642 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:42:31,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-10-05 23:42:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2020-10-05 23:42:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-10-05 23:42:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1644 transitions. [2020-10-05 23:42:31,734 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1644 transitions. Word has length 7 [2020-10-05 23:42:31,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:31,736 INFO L479 AbstractCegarLoop]: Abstraction has 538 states and 1644 transitions. [2020-10-05 23:42:31,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1644 transitions. [2020-10-05 23:42:31,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:42:31,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:31,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:31,738 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:42:31,738 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:31,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:31,739 INFO L82 PathProgramCache]: Analyzing trace with hash 981365630, now seen corresponding path program 1 times [2020-10-05 23:42:31,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:31,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481170396] [2020-10-05 23:42:31,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:31,925 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:42:31,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481170396] [2020-10-05 23:42:31,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:31,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:31,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662744376] [2020-10-05 23:42:31,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:31,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:31,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:31,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:31,933 INFO L87 Difference]: Start difference. First operand 538 states and 1644 transitions. Second operand 3 states. [2020-10-05 23:42:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:31,961 INFO L93 Difference]: Finished difference Result 478 states and 1431 transitions. [2020-10-05 23:42:31,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:31,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:42:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:31,970 INFO L225 Difference]: With dead ends: 478 [2020-10-05 23:42:31,970 INFO L226 Difference]: Without dead ends: 478 [2020-10-05 23:42:31,971 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:42:31,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-10-05 23:42:32,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2020-10-05 23:42:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2020-10-05 23:42:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1431 transitions. [2020-10-05 23:42:32,025 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1431 transitions. Word has length 9 [2020-10-05 23:42:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:32,027 INFO L479 AbstractCegarLoop]: Abstraction has 478 states and 1431 transitions. [2020-10-05 23:42:32,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1431 transitions. [2020-10-05 23:42:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:42:32,031 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:32,031 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:32,031 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:42:32,032 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:32,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:32,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1678623485, now seen corresponding path program 1 times [2020-10-05 23:42:32,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:32,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228934173] [2020-10-05 23:42:32,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:32,206 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:42:32,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228934173] [2020-10-05 23:42:32,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:32,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:42:32,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374800837] [2020-10-05 23:42:32,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:32,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:32,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:32,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:32,210 INFO L87 Difference]: Start difference. First operand 478 states and 1431 transitions. Second operand 3 states. [2020-10-05 23:42:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:32,242 INFO L93 Difference]: Finished difference Result 472 states and 1409 transitions. [2020-10-05 23:42:32,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:32,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-05 23:42:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:32,247 INFO L225 Difference]: With dead ends: 472 [2020-10-05 23:42:32,247 INFO L226 Difference]: Without dead ends: 472 [2020-10-05 23:42:32,248 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:42:32,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2020-10-05 23:42:32,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2020-10-05 23:42:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2020-10-05 23:42:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1409 transitions. [2020-10-05 23:42:32,266 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1409 transitions. Word has length 12 [2020-10-05 23:42:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:32,267 INFO L479 AbstractCegarLoop]: Abstraction has 472 states and 1409 transitions. [2020-10-05 23:42:32,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1409 transitions. [2020-10-05 23:42:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:42:32,270 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:32,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:32,270 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:42:32,270 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:32,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:32,271 INFO L82 PathProgramCache]: Analyzing trace with hash 733241045, now seen corresponding path program 1 times [2020-10-05 23:42:32,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:32,272 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475230815] [2020-10-05 23:42:32,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:32,498 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:42:32,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475230815] [2020-10-05 23:42:32,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:32,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:32,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164693638] [2020-10-05 23:42:32,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:32,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:32,500 INFO L87 Difference]: Start difference. First operand 472 states and 1409 transitions. Second operand 5 states. [2020-10-05 23:42:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:32,713 INFO L93 Difference]: Finished difference Result 539 states and 1627 transitions. [2020-10-05 23:42:32,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:32,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:42:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:32,719 INFO L225 Difference]: With dead ends: 539 [2020-10-05 23:42:32,720 INFO L226 Difference]: Without dead ends: 539 [2020-10-05 23:42:32,720 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2020-10-05 23:42:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 505. [2020-10-05 23:42:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2020-10-05 23:42:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1516 transitions. [2020-10-05 23:42:32,744 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 1516 transitions. Word has length 13 [2020-10-05 23:42:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:32,745 INFO L479 AbstractCegarLoop]: Abstraction has 505 states and 1516 transitions. [2020-10-05 23:42:32,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 1516 transitions. [2020-10-05 23:42:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:42:32,747 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:32,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:32,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:42:32,748 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:32,749 INFO L82 PathProgramCache]: Analyzing trace with hash -929552857, now seen corresponding path program 1 times [2020-10-05 23:42:32,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:32,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539708427] [2020-10-05 23:42:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:33,000 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:42:33,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539708427] [2020-10-05 23:42:33,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:33,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:42:33,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282885292] [2020-10-05 23:42:33,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:42:33,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:33,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:42:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:42:33,003 INFO L87 Difference]: Start difference. First operand 505 states and 1516 transitions. Second operand 4 states. [2020-10-05 23:42:33,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:33,133 INFO L93 Difference]: Finished difference Result 709 states and 2042 transitions. [2020-10-05 23:42:33,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:42:33,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-05 23:42:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:33,141 INFO L225 Difference]: With dead ends: 709 [2020-10-05 23:42:33,141 INFO L226 Difference]: Without dead ends: 685 [2020-10-05 23:42:33,142 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:42:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2020-10-05 23:42:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 555. [2020-10-05 23:42:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-10-05 23:42:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1627 transitions. [2020-10-05 23:42:33,163 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1627 transitions. Word has length 14 [2020-10-05 23:42:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:33,164 INFO L479 AbstractCegarLoop]: Abstraction has 555 states and 1627 transitions. [2020-10-05 23:42:33,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:42:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1627 transitions. [2020-10-05 23:42:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:42:33,165 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:33,166 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:33,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:42:33,166 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:33,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:33,166 INFO L82 PathProgramCache]: Analyzing trace with hash -700519649, now seen corresponding path program 1 times [2020-10-05 23:42:33,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:33,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326658848] [2020-10-05 23:42:33,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:33,627 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:42:33,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326658848] [2020-10-05 23:42:33,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:33,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:42:33,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530008379] [2020-10-05 23:42:33,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:42:33,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:33,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:42:33,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:33,630 INFO L87 Difference]: Start difference. First operand 555 states and 1627 transitions. Second operand 8 states. [2020-10-05 23:42:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:33,883 INFO L93 Difference]: Finished difference Result 686 states and 2021 transitions. [2020-10-05 23:42:33,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:42:33,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-05 23:42:33,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:33,890 INFO L225 Difference]: With dead ends: 686 [2020-10-05 23:42:33,891 INFO L226 Difference]: Without dead ends: 686 [2020-10-05 23:42:33,891 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2020-10-05 23:42:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 547. [2020-10-05 23:42:33,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2020-10-05 23:42:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1621 transitions. [2020-10-05 23:42:33,913 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1621 transitions. Word has length 14 [2020-10-05 23:42:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:33,913 INFO L479 AbstractCegarLoop]: Abstraction has 547 states and 1621 transitions. [2020-10-05 23:42:33,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:42:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1621 transitions. [2020-10-05 23:42:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:42:33,915 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:33,915 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:33,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:42:33,916 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:33,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:33,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1659355165, now seen corresponding path program 1 times [2020-10-05 23:42:33,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:33,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659869138] [2020-10-05 23:42:33,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:34,096 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:42:34,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659869138] [2020-10-05 23:42:34,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:34,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:42:34,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940490346] [2020-10-05 23:42:34,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:42:34,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:34,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:42:34,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:34,099 INFO L87 Difference]: Start difference. First operand 547 states and 1621 transitions. Second operand 8 states. [2020-10-05 23:42:34,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:34,412 INFO L93 Difference]: Finished difference Result 665 states and 1992 transitions. [2020-10-05 23:42:34,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:34,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-05 23:42:34,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:34,419 INFO L225 Difference]: With dead ends: 665 [2020-10-05 23:42:34,419 INFO L226 Difference]: Without dead ends: 665 [2020-10-05 23:42:34,420 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:42:34,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-10-05 23:42:34,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 571. [2020-10-05 23:42:34,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2020-10-05 23:42:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1703 transitions. [2020-10-05 23:42:34,446 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1703 transitions. Word has length 14 [2020-10-05 23:42:34,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:34,446 INFO L479 AbstractCegarLoop]: Abstraction has 571 states and 1703 transitions. [2020-10-05 23:42:34,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:42:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1703 transitions. [2020-10-05 23:42:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:42:34,448 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:34,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:34,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:42:34,448 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:34,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:34,449 INFO L82 PathProgramCache]: Analyzing trace with hash -70668655, now seen corresponding path program 2 times [2020-10-05 23:42:34,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:34,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660303299] [2020-10-05 23:42:34,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:34,790 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:42:34,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660303299] [2020-10-05 23:42:34,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:34,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:34,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68833363] [2020-10-05 23:42:34,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:42:34,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:34,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:42:34,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:34,795 INFO L87 Difference]: Start difference. First operand 571 states and 1703 transitions. Second operand 7 states. [2020-10-05 23:42:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:35,110 INFO L93 Difference]: Finished difference Result 660 states and 1975 transitions. [2020-10-05 23:42:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:35,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-05 23:42:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:35,118 INFO L225 Difference]: With dead ends: 660 [2020-10-05 23:42:35,118 INFO L226 Difference]: Without dead ends: 660 [2020-10-05 23:42:35,118 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2020-10-05 23:42:35,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 528. [2020-10-05 23:42:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2020-10-05 23:42:35,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1551 transitions. [2020-10-05 23:42:35,138 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1551 transitions. Word has length 14 [2020-10-05 23:42:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:35,138 INFO L479 AbstractCegarLoop]: Abstraction has 528 states and 1551 transitions. [2020-10-05 23:42:35,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:42:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1551 transitions. [2020-10-05 23:42:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:42:35,140 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:35,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:35,141 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:42:35,141 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:35,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:35,141 INFO L82 PathProgramCache]: Analyzing trace with hash 251229687, now seen corresponding path program 1 times [2020-10-05 23:42:35,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:35,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268409632] [2020-10-05 23:42:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:35,485 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:42:35,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268409632] [2020-10-05 23:42:35,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:35,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:42:35,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799115518] [2020-10-05 23:42:35,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:42:35,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:35,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:42:35,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:35,487 INFO L87 Difference]: Start difference. First operand 528 states and 1551 transitions. Second operand 8 states. [2020-10-05 23:42:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:36,032 INFO L93 Difference]: Finished difference Result 848 states and 2511 transitions. [2020-10-05 23:42:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 23:42:36,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-05 23:42:36,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:36,040 INFO L225 Difference]: With dead ends: 848 [2020-10-05 23:42:36,040 INFO L226 Difference]: Without dead ends: 848 [2020-10-05 23:42:36,041 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-10-05 23:42:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2020-10-05 23:42:36,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 600. [2020-10-05 23:42:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-10-05 23:42:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1797 transitions. [2020-10-05 23:42:36,062 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1797 transitions. Word has length 15 [2020-10-05 23:42:36,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:36,063 INFO L479 AbstractCegarLoop]: Abstraction has 600 states and 1797 transitions. [2020-10-05 23:42:36,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:42:36,063 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1797 transitions. [2020-10-05 23:42:36,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:42:36,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:36,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:36,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:42:36,066 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:36,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:36,066 INFO L82 PathProgramCache]: Analyzing trace with hash 356368495, now seen corresponding path program 2 times [2020-10-05 23:42:36,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:36,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363239871] [2020-10-05 23:42:36,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:36,408 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:42:36,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363239871] [2020-10-05 23:42:36,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:36,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:42:36,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584042117] [2020-10-05 23:42:36,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:42:36,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:36,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:42:36,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:36,410 INFO L87 Difference]: Start difference. First operand 600 states and 1797 transitions. Second operand 8 states. [2020-10-05 23:42:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:36,831 INFO L93 Difference]: Finished difference Result 920 states and 2683 transitions. [2020-10-05 23:42:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:36,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-05 23:42:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:36,839 INFO L225 Difference]: With dead ends: 920 [2020-10-05 23:42:36,839 INFO L226 Difference]: Without dead ends: 824 [2020-10-05 23:42:36,840 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2020-10-05 23:42:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 558. [2020-10-05 23:42:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2020-10-05 23:42:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1626 transitions. [2020-10-05 23:42:36,863 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1626 transitions. Word has length 15 [2020-10-05 23:42:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:36,864 INFO L479 AbstractCegarLoop]: Abstraction has 558 states and 1626 transitions. [2020-10-05 23:42:36,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:42:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1626 transitions. [2020-10-05 23:42:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:42:36,865 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:36,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:36,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:42:36,866 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:36,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:36,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2101548220, now seen corresponding path program 1 times [2020-10-05 23:42:36,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:36,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740580932] [2020-10-05 23:42:36,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:36,926 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:42:36,927 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740580932] [2020-10-05 23:42:36,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:36,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:42:36,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366287699] [2020-10-05 23:42:36,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:42:36,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:36,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:42:36,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:36,929 INFO L87 Difference]: Start difference. First operand 558 states and 1626 transitions. Second operand 3 states. [2020-10-05 23:42:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:36,942 INFO L93 Difference]: Finished difference Result 780 states and 2221 transitions. [2020-10-05 23:42:36,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:42:36,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-05 23:42:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:36,950 INFO L225 Difference]: With dead ends: 780 [2020-10-05 23:42:36,950 INFO L226 Difference]: Without dead ends: 448 [2020-10-05 23:42:36,951 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:42:36,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2020-10-05 23:42:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 436. [2020-10-05 23:42:36,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2020-10-05 23:42:36,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1190 transitions. [2020-10-05 23:42:36,965 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1190 transitions. Word has length 15 [2020-10-05 23:42:36,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:36,965 INFO L479 AbstractCegarLoop]: Abstraction has 436 states and 1190 transitions. [2020-10-05 23:42:36,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:42:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1190 transitions. [2020-10-05 23:42:36,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:36,967 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:36,967 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:42:36,967 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:42:36,968 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:36,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:36,968 INFO L82 PathProgramCache]: Analyzing trace with hash -810770517, now seen corresponding path program 1 times [2020-10-05 23:42:36,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:36,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269814141] [2020-10-05 23:42:36,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:37,287 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:42:37,287 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269814141] [2020-10-05 23:42:37,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:37,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:37,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927819355] [2020-10-05 23:42:37,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:37,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:37,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:37,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:37,289 INFO L87 Difference]: Start difference. First operand 436 states and 1190 transitions. Second operand 6 states. [2020-10-05 23:42:37,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:37,574 INFO L93 Difference]: Finished difference Result 794 states and 2113 transitions. [2020-10-05 23:42:37,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 23:42:37,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-05 23:42:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:37,583 INFO L225 Difference]: With dead ends: 794 [2020-10-05 23:42:37,583 INFO L226 Difference]: Without dead ends: 682 [2020-10-05 23:42:37,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:42:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2020-10-05 23:42:37,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 500. [2020-10-05 23:42:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-10-05 23:42:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1365 transitions. [2020-10-05 23:42:37,602 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1365 transitions. Word has length 16 [2020-10-05 23:42:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:37,602 INFO L479 AbstractCegarLoop]: Abstraction has 500 states and 1365 transitions. [2020-10-05 23:42:37,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:37,602 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1365 transitions. [2020-10-05 23:42:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:37,604 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:37,604 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:42:37,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:42:37,604 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:37,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:37,605 INFO L82 PathProgramCache]: Analyzing trace with hash -219687627, now seen corresponding path program 2 times [2020-10-05 23:42:37,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:37,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754859723] [2020-10-05 23:42:37,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:38,124 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:42:38,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754859723] [2020-10-05 23:42:38,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:38,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:42:38,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389208758] [2020-10-05 23:42:38,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:42:38,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:38,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:42:38,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:38,127 INFO L87 Difference]: Start difference. First operand 500 states and 1365 transitions. Second operand 9 states. [2020-10-05 23:42:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:38,696 INFO L93 Difference]: Finished difference Result 671 states and 1803 transitions. [2020-10-05 23:42:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 23:42:38,697 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-05 23:42:38,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:38,701 INFO L225 Difference]: With dead ends: 671 [2020-10-05 23:42:38,701 INFO L226 Difference]: Without dead ends: 579 [2020-10-05 23:42:38,702 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:42:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2020-10-05 23:42:38,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 489. [2020-10-05 23:42:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2020-10-05 23:42:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1332 transitions. [2020-10-05 23:42:38,717 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 1332 transitions. Word has length 16 [2020-10-05 23:42:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:38,717 INFO L479 AbstractCegarLoop]: Abstraction has 489 states and 1332 transitions. [2020-10-05 23:42:38,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:42:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 1332 transitions. [2020-10-05 23:42:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:38,719 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:38,719 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:42:38,719 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:42:38,719 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:38,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:38,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1458952055, now seen corresponding path program 3 times [2020-10-05 23:42:38,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:38,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39295077] [2020-10-05 23:42:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:38,883 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:42:38,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39295077] [2020-10-05 23:42:38,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:38,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:38,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146722831] [2020-10-05 23:42:38,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:38,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:38,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:38,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:38,886 INFO L87 Difference]: Start difference. First operand 489 states and 1332 transitions. Second operand 6 states. [2020-10-05 23:42:39,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:39,180 INFO L93 Difference]: Finished difference Result 651 states and 1723 transitions. [2020-10-05 23:42:39,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:39,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-05 23:42:39,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:39,184 INFO L225 Difference]: With dead ends: 651 [2020-10-05 23:42:39,184 INFO L226 Difference]: Without dead ends: 555 [2020-10-05 23:42:39,184 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-10-05 23:42:39,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 501. [2020-10-05 23:42:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2020-10-05 23:42:39,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1340 transitions. [2020-10-05 23:42:39,198 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1340 transitions. Word has length 16 [2020-10-05 23:42:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:39,199 INFO L479 AbstractCegarLoop]: Abstraction has 501 states and 1340 transitions. [2020-10-05 23:42:39,199 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1340 transitions. [2020-10-05 23:42:39,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:39,200 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:39,200 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:42:39,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:42:39,201 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:39,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:39,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1407883895, now seen corresponding path program 4 times [2020-10-05 23:42:39,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:39,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55590081] [2020-10-05 23:42:39,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:39,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:42:39,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55590081] [2020-10-05 23:42:39,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:39,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:42:39,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161213061] [2020-10-05 23:42:39,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:42:39,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:39,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:42:39,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:42:39,415 INFO L87 Difference]: Start difference. First operand 501 states and 1340 transitions. Second operand 8 states. [2020-10-05 23:42:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:40,323 INFO L93 Difference]: Finished difference Result 663 states and 1715 transitions. [2020-10-05 23:42:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 23:42:40,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-10-05 23:42:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:40,328 INFO L225 Difference]: With dead ends: 663 [2020-10-05 23:42:40,328 INFO L226 Difference]: Without dead ends: 469 [2020-10-05 23:42:40,329 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-05 23:42:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2020-10-05 23:42:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 395. [2020-10-05 23:42:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-10-05 23:42:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1047 transitions. [2020-10-05 23:42:40,341 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1047 transitions. Word has length 16 [2020-10-05 23:42:40,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:40,341 INFO L479 AbstractCegarLoop]: Abstraction has 395 states and 1047 transitions. [2020-10-05 23:42:40,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:42:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1047 transitions. [2020-10-05 23:42:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:42:40,342 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:40,343 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:42:40,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:42:40,343 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:40,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:40,343 INFO L82 PathProgramCache]: Analyzing trace with hash -723485020, now seen corresponding path program 1 times [2020-10-05 23:42:40,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:40,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514866499] [2020-10-05 23:42:40,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:40,420 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:42:40,420 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514866499] [2020-10-05 23:42:40,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:40,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:42:40,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587929661] [2020-10-05 23:42:40,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:42:40,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:40,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:42:40,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:42:40,422 INFO L87 Difference]: Start difference. First operand 395 states and 1047 transitions. Second operand 4 states. [2020-10-05 23:42:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:40,454 INFO L93 Difference]: Finished difference Result 392 states and 916 transitions. [2020-10-05 23:42:40,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:42:40,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-05 23:42:40,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:40,457 INFO L225 Difference]: With dead ends: 392 [2020-10-05 23:42:40,457 INFO L226 Difference]: Without dead ends: 270 [2020-10-05 23:42:40,457 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:42:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-10-05 23:42:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2020-10-05 23:42:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-10-05 23:42:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 609 transitions. [2020-10-05 23:42:40,464 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 609 transitions. Word has length 16 [2020-10-05 23:42:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:40,464 INFO L479 AbstractCegarLoop]: Abstraction has 270 states and 609 transitions. [2020-10-05 23:42:40,464 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:42:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 609 transitions. [2020-10-05 23:42:40,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:42:40,465 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:40,465 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:42:40,466 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:42:40,466 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:40,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:40,466 INFO L82 PathProgramCache]: Analyzing trace with hash 233701298, now seen corresponding path program 1 times [2020-10-05 23:42:40,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:40,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867334352] [2020-10-05 23:42:40,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:40,541 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:42:40,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867334352] [2020-10-05 23:42:40,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:40,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:40,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970230896] [2020-10-05 23:42:40,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:42:40,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:40,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:42:40,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:42:40,544 INFO L87 Difference]: Start difference. First operand 270 states and 609 transitions. Second operand 5 states. [2020-10-05 23:42:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:40,591 INFO L93 Difference]: Finished difference Result 228 states and 468 transitions. [2020-10-05 23:42:40,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:40,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:42:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:40,593 INFO L225 Difference]: With dead ends: 228 [2020-10-05 23:42:40,593 INFO L226 Difference]: Without dead ends: 167 [2020-10-05 23:42:40,593 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:42:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2020-10-05 23:42:40,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2020-10-05 23:42:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-10-05 23:42:40,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 307 transitions. [2020-10-05 23:42:40,598 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 307 transitions. Word has length 17 [2020-10-05 23:42:40,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:40,598 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 307 transitions. [2020-10-05 23:42:40,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:42:40,598 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 307 transitions. [2020-10-05 23:42:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 23:42:40,599 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:40,599 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:42:40,599 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:42:40,600 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:40,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:40,600 INFO L82 PathProgramCache]: Analyzing trace with hash -499071186, now seen corresponding path program 1 times [2020-10-05 23:42:40,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:40,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619065131] [2020-10-05 23:42:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:40,708 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:42:40,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619065131] [2020-10-05 23:42:40,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:40,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:42:40,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447918583] [2020-10-05 23:42:40,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:40,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:40,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:40,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:40,710 INFO L87 Difference]: Start difference. First operand 159 states and 307 transitions. Second operand 6 states. [2020-10-05 23:42:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:40,769 INFO L93 Difference]: Finished difference Result 145 states and 277 transitions. [2020-10-05 23:42:40,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:40,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-05 23:42:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:40,771 INFO L225 Difference]: With dead ends: 145 [2020-10-05 23:42:40,771 INFO L226 Difference]: Without dead ends: 90 [2020-10-05 23:42:40,772 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:42:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-05 23:42:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2020-10-05 23:42:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-05 23:42:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 146 transitions. [2020-10-05 23:42:40,775 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 146 transitions. Word has length 19 [2020-10-05 23:42:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:40,775 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 146 transitions. [2020-10-05 23:42:40,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 146 transitions. [2020-10-05 23:42:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:40,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:40,776 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] [2020-10-05 23:42:40,776 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 23:42:40,776 INFO L427 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:40,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:40,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1387093443, now seen corresponding path program 1 times [2020-10-05 23:42:40,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:40,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869577568] [2020-10-05 23:42:40,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:41,180 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-10-05 23:42:41,535 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:42:41,536 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869577568] [2020-10-05 23:42:41,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:41,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 23:42:41,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019484140] [2020-10-05 23:42:41,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:42:41,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:41,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:42:41,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:41,539 INFO L87 Difference]: Start difference. First operand 82 states and 146 transitions. Second operand 11 states. [2020-10-05 23:42:41,862 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2020-10-05 23:42:42,692 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2020-10-05 23:42:43,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:43,051 INFO L93 Difference]: Finished difference Result 121 states and 217 transitions. [2020-10-05 23:42:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-05 23:42:43,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:42:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:43,052 INFO L225 Difference]: With dead ends: 121 [2020-10-05 23:42:43,052 INFO L226 Difference]: Without dead ends: 86 [2020-10-05 23:42:43,053 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2020-10-05 23:42:43,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-05 23:42:43,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2020-10-05 23:42:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-05 23:42:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2020-10-05 23:42:43,055 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2020-10-05 23:42:43,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:43,056 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2020-10-05 23:42:43,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:42:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2020-10-05 23:42:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:43,056 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:43,056 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] [2020-10-05 23:42:43,057 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:42:43,057 INFO L427 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:43,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:43,057 INFO L82 PathProgramCache]: Analyzing trace with hash -503555769, now seen corresponding path program 2 times [2020-10-05 23:42:43,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:43,058 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506268792] [2020-10-05 23:42:43,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:43,195 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:42:43,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506268792] [2020-10-05 23:42:43,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:43,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:43,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890458560] [2020-10-05 23:42:43,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:43,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:43,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:43,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:43,197 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 6 states. [2020-10-05 23:42:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:43,370 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2020-10-05 23:42:43,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:42:43,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-05 23:42:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:43,372 INFO L225 Difference]: With dead ends: 91 [2020-10-05 23:42:43,372 INFO L226 Difference]: Without dead ends: 63 [2020-10-05 23:42:43,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:42:43,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-05 23:42:43,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2020-10-05 23:42:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-05 23:42:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 103 transitions. [2020-10-05 23:42:43,375 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 103 transitions. Word has length 21 [2020-10-05 23:42:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:43,375 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 103 transitions. [2020-10-05 23:42:43,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:43,376 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 103 transitions. [2020-10-05 23:42:43,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:43,376 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:43,376 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] [2020-10-05 23:42:43,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 23:42:43,377 INFO L427 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:43,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:43,377 INFO L82 PathProgramCache]: Analyzing trace with hash 653173231, now seen corresponding path program 3 times [2020-10-05 23:42:43,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:43,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395479804] [2020-10-05 23:42:43,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:43,577 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:42:43,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395479804] [2020-10-05 23:42:43,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:43,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:42:43,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659695727] [2020-10-05 23:42:43,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:42:43,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:43,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:42:43,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:42:43,580 INFO L87 Difference]: Start difference. First operand 59 states and 103 transitions. Second operand 6 states. [2020-10-05 23:42:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:43,753 INFO L93 Difference]: Finished difference Result 75 states and 123 transitions. [2020-10-05 23:42:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:42:43,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-05 23:42:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:43,755 INFO L225 Difference]: With dead ends: 75 [2020-10-05 23:42:43,756 INFO L226 Difference]: Without dead ends: 53 [2020-10-05 23:42:43,756 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:42:43,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-05 23:42:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-10-05 23:42:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-05 23:42:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 90 transitions. [2020-10-05 23:42:43,760 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 90 transitions. Word has length 21 [2020-10-05 23:42:43,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:43,761 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 90 transitions. [2020-10-05 23:42:43,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:42:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 90 transitions. [2020-10-05 23:42:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:43,762 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:43,762 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] [2020-10-05 23:42:43,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-05 23:42:43,762 INFO L427 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:43,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:43,763 INFO L82 PathProgramCache]: Analyzing trace with hash -296722081, now seen corresponding path program 4 times [2020-10-05 23:42:43,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:43,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040979384] [2020-10-05 23:42:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:44,176 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:42:44,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040979384] [2020-10-05 23:42:44,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:44,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 23:42:44,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621175752] [2020-10-05 23:42:44,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:42:44,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:44,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:42:44,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:44,179 INFO L87 Difference]: Start difference. First operand 53 states and 90 transitions. Second operand 11 states. [2020-10-05 23:42:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:44,621 INFO L93 Difference]: Finished difference Result 71 states and 115 transitions. [2020-10-05 23:42:44,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 23:42:44,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:42:44,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:44,623 INFO L225 Difference]: With dead ends: 71 [2020-10-05 23:42:44,624 INFO L226 Difference]: Without dead ends: 55 [2020-10-05 23:42:44,624 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-05 23:42:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-05 23:42:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2020-10-05 23:42:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-05 23:42:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 85 transitions. [2020-10-05 23:42:44,629 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 85 transitions. Word has length 21 [2020-10-05 23:42:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:44,630 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 85 transitions. [2020-10-05 23:42:44,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:42:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 85 transitions. [2020-10-05 23:42:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:44,632 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:44,632 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] [2020-10-05 23:42:44,633 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-05 23:42:44,633 INFO L427 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:44,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:44,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1728662983, now seen corresponding path program 5 times [2020-10-05 23:42:44,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:44,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773295681] [2020-10-05 23:42:44,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:44,952 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:42:44,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773295681] [2020-10-05 23:42:44,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:44,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 23:42:44,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938519006] [2020-10-05 23:42:44,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 23:42:44,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:44,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 23:42:44,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:42:44,954 INFO L87 Difference]: Start difference. First operand 51 states and 85 transitions. Second operand 11 states. [2020-10-05 23:42:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:45,137 INFO L93 Difference]: Finished difference Result 63 states and 100 transitions. [2020-10-05 23:42:45,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 23:42:45,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-05 23:42:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:45,138 INFO L225 Difference]: With dead ends: 63 [2020-10-05 23:42:45,138 INFO L226 Difference]: Without dead ends: 45 [2020-10-05 23:42:45,139 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:42:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-10-05 23:42:45,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-10-05 23:42:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-05 23:42:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. [2020-10-05 23:42:45,140 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 21 [2020-10-05 23:42:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:45,140 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. [2020-10-05 23:42:45,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 23:42:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2020-10-05 23:42:45,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:45,141 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:45,141 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] [2020-10-05 23:42:45,142 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-05 23:42:45,142 INFO L427 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:45,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:45,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1368475, now seen corresponding path program 6 times [2020-10-05 23:42:45,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:45,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60371153] [2020-10-05 23:42:45,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:45,409 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2020-10-05 23:42:45,956 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:42:45,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60371153] [2020-10-05 23:42:45,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:45,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:42:45,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776519877] [2020-10-05 23:42:45,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:42:45,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:45,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:42:45,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:42:45,959 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand 12 states. [2020-10-05 23:42:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:46,560 INFO L93 Difference]: Finished difference Result 53 states and 83 transitions. [2020-10-05 23:42:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 23:42:46,561 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-05 23:42:46,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:46,561 INFO L225 Difference]: With dead ends: 53 [2020-10-05 23:42:46,561 INFO L226 Difference]: Without dead ends: 46 [2020-10-05 23:42:46,562 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-10-05 23:42:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-10-05 23:42:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-10-05 23:42:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-10-05 23:42:46,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 76 transitions. [2020-10-05 23:42:46,563 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 76 transitions. Word has length 21 [2020-10-05 23:42:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:46,564 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 76 transitions. [2020-10-05 23:42:46,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:42:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 76 transitions. [2020-10-05 23:42:46,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:46,564 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:46,564 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] [2020-10-05 23:42:46,565 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-05 23:42:46,565 INFO L427 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:46,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:46,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1093580517, now seen corresponding path program 7 times [2020-10-05 23:42:46,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:46,566 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088571680] [2020-10-05 23:42:46,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:42:47,163 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:42:47,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088571680] [2020-10-05 23:42:47,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:42:47,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 23:42:47,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400048479] [2020-10-05 23:42:47,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 23:42:47,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:42:47,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 23:42:47,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-05 23:42:47,164 INFO L87 Difference]: Start difference. First operand 46 states and 76 transitions. Second operand 12 states. [2020-10-05 23:42:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:42:47,806 INFO L93 Difference]: Finished difference Result 65 states and 102 transitions. [2020-10-05 23:42:47,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 23:42:47,807 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-05 23:42:47,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:42:47,807 INFO L225 Difference]: With dead ends: 65 [2020-10-05 23:42:47,807 INFO L226 Difference]: Without dead ends: 37 [2020-10-05 23:42:47,808 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-10-05 23:42:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-05 23:42:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-05 23:42:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-05 23:42:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2020-10-05 23:42:47,809 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 21 [2020-10-05 23:42:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:42:47,810 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2020-10-05 23:42:47,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 23:42:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2020-10-05 23:42:47,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:42:47,810 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:42:47,810 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] [2020-10-05 23:42:47,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-05 23:42:47,811 INFO L427 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:42:47,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:42:47,811 INFO L82 PathProgramCache]: Analyzing trace with hash 559176997, now seen corresponding path program 8 times [2020-10-05 23:42:47,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:42:47,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124849209] [2020-10-05 23:42:47,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:42:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:42:47,857 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:42:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:42:47,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:42:47,957 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:42:47,958 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:42:47,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-05 23:42:47,959 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:42:47,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1649] [1649] L3-->L854: Formula: (let ((.cse7 (= (mod ~x$w_buff0_used~0_In1747544052 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In1747544052 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In1747544052 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In1747544052 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out1747544052)) (= ~x$r_buff1_thd0~0_Out1747544052 ~x$r_buff1_thd0~0_In1747544052) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1747544052 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1747544052|) (or (and .cse0 (= ~x$w_buff1_used~0_In1747544052 ~x$w_buff1_used~0_Out1747544052)) (and .cse1 (= ~x$w_buff1_used~0_Out1747544052 0) .cse2)) (or (and .cse3 .cse4 (= ~x$w_buff0_used~0_Out1747544052 0)) (and (= ~x$w_buff0_used~0_Out1747544052 ~x$w_buff0_used~0_In1747544052) .cse5)) (= ~x$r_buff0_thd0~0_In1747544052 ~x$r_buff0_thd0~0_Out1747544052) (or (and (or (and .cse0 (= ~x~0_In1747544052 ~x~0_Out1747544052)) (and .cse1 .cse2 (= ~x$w_buff1~0_In1747544052 ~x~0_Out1747544052))) .cse5) (and (= ~x$w_buff0~0_In1747544052 ~x~0_Out1747544052) .cse3 .cse4))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1747544052, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1747544052, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1747544052|, ~x$w_buff1~0=~x$w_buff1~0_In1747544052, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1747544052, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1747544052, ~x~0=~x~0_In1747544052, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1747544052} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1747544052, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1747544052, ~x$w_buff1~0=~x$w_buff1~0_In1747544052, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1747544052, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out1747544052|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1747544052, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1747544052, ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out1747544052|, ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out1747544052|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1747544052|, ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out1747544052|, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out1747544052|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1747544052, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out1747544052|, ~x~0=~x~0_Out1747544052} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite70, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite69, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-05 23:42:47,982 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:42:47,982 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,983 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:42:47,983 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,984 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:42:47,984 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,984 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:42:47,984 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,984 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:42:47,984 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,985 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:42:47,985 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,985 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:42:47,985 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,985 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:42:47,986 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,986 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:42:47,986 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,986 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:42:47,986 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,987 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:42:47,987 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,987 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:42:47,987 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,987 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:42:47,987 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,988 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:42:47,988 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,989 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:42:47,989 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,989 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:42:47,989 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,989 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:42:47,989 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,990 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:42:47,990 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,990 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:42:47,990 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,991 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:42:47,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,991 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:42:47,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,991 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:42:47,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,992 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:42:47,992 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,992 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:42:47,992 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,992 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:42:47,992 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,993 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:42:47,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,993 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:42:47,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,993 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:42:47,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,993 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:42:47,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,994 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:42:47,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,994 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:42:47,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,995 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:42:47,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,995 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:42:47,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,995 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:42:47,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,996 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:42:47,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,996 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:42:47,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,996 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:42:47,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,997 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:42:47,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,997 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:42:47,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,998 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:42:47,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,998 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:42:47,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,998 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:42:47,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,999 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:42:47,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,999 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:42:47,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:47,999 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:42:48,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:48,000 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:42:48,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:48,000 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:42:48,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:48,001 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:42:48,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:48,001 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:42:48,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:48,001 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:42:48,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:48,002 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:42:48,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:48,002 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:42:48,002 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:48,003 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:42:48,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:48,003 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:42:48,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:48,003 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:42:48,003 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:48,004 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:42:48,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:48,004 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:42:48,004 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:42:48,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:42:48 BasicIcfg [2020-10-05 23:42:48,087 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:42:48,089 INFO L168 Benchmark]: Toolchain (without parser) took 29341.55 ms. Allocated memory was 147.3 MB in the beginning and 523.8 MB in the end (delta: 376.4 MB). Free memory was 101.6 MB in the beginning and 149.6 MB in the end (delta: -48.0 MB). Peak memory consumption was 328.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:48,089 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 147.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-05 23:42:48,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 893.93 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 155.2 MB in the end (delta: -53.8 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:48,094 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.03 ms. Allocated memory is still 204.5 MB. Free memory was 155.2 MB in the beginning and 151.8 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:42:48,094 INFO L168 Benchmark]: Boogie Preprocessor took 74.37 ms. Allocated memory is still 204.5 MB. Free memory was 151.8 MB in the beginning and 148.5 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:42:48,095 INFO L168 Benchmark]: RCFGBuilder took 3566.62 ms. Allocated memory was 204.5 MB in the beginning and 292.0 MB in the end (delta: 87.6 MB). Free memory was 148.5 MB in the beginning and 246.7 MB in the end (delta: -98.2 MB). Peak memory consumption was 104.1 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:48,096 INFO L168 Benchmark]: TraceAbstraction took 24729.41 ms. Allocated memory was 292.0 MB in the beginning and 523.8 MB in the end (delta: 231.7 MB). Free memory was 246.7 MB in the beginning and 149.6 MB in the end (delta: 97.2 MB). Peak memory consumption was 328.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:42:48,099 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.22 ms. Allocated memory is still 147.3 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 893.93 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 101.3 MB in the beginning and 155.2 MB in the end (delta: -53.8 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.03 ms. Allocated memory is still 204.5 MB. Free memory was 155.2 MB in the beginning and 151.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.37 ms. Allocated memory is still 204.5 MB. Free memory was 151.8 MB in the beginning and 148.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3566.62 ms. Allocated memory was 204.5 MB in the beginning and 292.0 MB in the end (delta: 87.6 MB). Free memory was 148.5 MB in the beginning and 246.7 MB in the end (delta: -98.2 MB). Peak memory consumption was 104.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24729.41 ms. Allocated memory was 292.0 MB in the beginning and 523.8 MB in the end (delta: 231.7 MB). Free memory was 246.7 MB in the beginning and 149.6 MB in the end (delta: 97.2 MB). Peak memory consumption was 328.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.5s, 100 ProgramPointsBefore, 36 ProgramPointsAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1624 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 801 VarBasedMoverChecksPositive, 39 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4118 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_p1_EAX = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L708] 0 _Bool x$flush_delayed; [L709] 0 int x$mem_tmp; [L710] 0 _Bool x$r_buff0_thd0; [L711] 0 _Bool x$r_buff0_thd1; [L712] 0 _Bool x$r_buff0_thd2; [L713] 0 _Bool x$r_buff0_thd3; [L714] 0 _Bool x$r_buff1_thd0; [L715] 0 _Bool x$r_buff1_thd1; [L716] 0 _Bool x$r_buff1_thd2; [L717] 0 _Bool x$r_buff1_thd3; [L718] 0 _Bool x$read_delayed; [L719] 0 int *x$read_delayed_var; [L720] 0 int x$w_buff0; [L721] 0 _Bool x$w_buff0_used; [L722] 0 int x$w_buff1; [L723] 0 _Bool x$w_buff1_used; [L725] 0 int y = 0; [L726] 0 _Bool weak$$choice0; [L727] 0 _Bool weak$$choice2; [L838] 0 pthread_t t2552; [L839] FCALL, FORK 0 pthread_create(&t2552, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] 0 pthread_t t2553; [L841] FCALL, FORK 0 pthread_create(&t2553, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] 0 pthread_t t2554; [L843] FCALL, FORK 0 pthread_create(&t2554, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 3 x$w_buff1 = x$w_buff0 [L802] 3 x$w_buff0 = 2 [L803] 3 x$w_buff1_used = x$w_buff0_used [L804] 3 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 3 !(!expression) [L806] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L807] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L808] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L809] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L737] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L738] 1 x$flush_delayed = weak$$choice2 [L739] 1 x$mem_tmp = x [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L741] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L742] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L743] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L744] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 __unbuffered_p0_EAX = x [L748] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L748] 1 x = x$flush_delayed ? x$mem_tmp : x [L749] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L767] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L768] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L775] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1 [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x [L783] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L816] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L818] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 x$flush_delayed = weak$$choice2 [L859] 0 x$mem_tmp = x [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L861] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L861] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L865] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L868] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L868] 0 x = x$flush_delayed ? x$mem_tmp : x [L869] 0 x$flush_delayed = (_Bool)0 [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.4s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 500 SDtfs, 822 SDslu, 1095 SDs, 0 SdLazy, 2017 SolverSat, 593 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred 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.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 1492 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 426 NumberOfCodeBlocks, 426 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 96070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...