/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:06:06,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:06:06,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:06:06,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:06:06,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:06:06,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:06:06,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:06:06,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:06:06,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:06:06,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:06:06,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:06:06,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:06:06,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:06:06,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:06:06,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:06:06,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:06:06,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:06:06,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:06:06,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:06:06,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:06:06,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:06:06,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:06:06,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:06:06,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:06:06,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:06:06,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:06:06,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:06:06,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:06:06,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:06:06,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:06:06,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:06:06,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:06:06,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:06:06,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:06:06,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:06:06,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:06:06,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:06:06,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:06:06,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:06:06,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:06:06,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:06:06,670 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 23:06:06,683 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:06:06,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:06:06,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:06:06,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:06:06,685 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:06:06,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:06:06,686 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:06:06,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:06:06,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:06:06,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:06:06,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:06:06,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:06:06,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:06:06,687 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:06:06,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:06:06,687 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:06:06,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:06:06,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:06:06,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:06:06,688 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:06:06,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:06:06,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:06:06,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:06:06,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:06:06,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:06:06,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:06:06,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:06:06,690 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:06:06,690 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:06:06,690 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:06:06,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:06:06,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:06:06,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:06:06,991 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:06:06,991 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:06:06,992 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_rmo.oepc.i [2019-12-18 23:06:07,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/271c5ca69/9894d975e71d44c291bb6df0ff7a3e66/FLAG13b8ce6da [2019-12-18 23:06:07,649 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:06:07,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_rmo.oepc.i [2019-12-18 23:06:07,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/271c5ca69/9894d975e71d44c291bb6df0ff7a3e66/FLAG13b8ce6da [2019-12-18 23:06:07,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/271c5ca69/9894d975e71d44c291bb6df0ff7a3e66 [2019-12-18 23:06:07,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:06:07,892 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:06:07,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:06:07,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:06:07,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:06:07,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:06:07" (1/1) ... [2019-12-18 23:06:07,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afd1b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:06:07, skipping insertion in model container [2019-12-18 23:06:07,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:06:07" (1/1) ... [2019-12-18 23:06:07,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:06:07,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:06:08,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:06:08,487 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:06:08,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:06:08,630 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:06:08,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:06:08 WrapperNode [2019-12-18 23:06:08,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:06:08,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:06:08,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:06:08,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:06:08,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:06:08" (1/1) ... [2019-12-18 23:06:08,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:06:08" (1/1) ... [2019-12-18 23:06:08,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:06:08,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:06:08,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:06:08,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:06:08,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:06:08" (1/1) ... [2019-12-18 23:06:08,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:06:08" (1/1) ... [2019-12-18 23:06:08,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:06:08" (1/1) ... [2019-12-18 23:06:08,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:06:08" (1/1) ... [2019-12-18 23:06:08,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:06:08" (1/1) ... [2019-12-18 23:06:08,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:06:08" (1/1) ... [2019-12-18 23:06:08,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:06:08" (1/1) ... [2019-12-18 23:06:08,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:06:08,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:06:08,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:06:08,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:06:08,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:06:08" (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 [2019-12-18 23:06:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:06:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 23:06:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:06:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:06:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 23:06:08,826 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 23:06:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 23:06:08,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 23:06:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 23:06:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:06:08,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:06:08,831 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:06:09,495 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:06:09,495 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 23:06:09,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:06:09 BoogieIcfgContainer [2019-12-18 23:06:09,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:06:09,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:06:09,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:06:09,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:06:09,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:06:07" (1/3) ... [2019-12-18 23:06:09,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295a46eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:06:09, skipping insertion in model container [2019-12-18 23:06:09,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:06:08" (2/3) ... [2019-12-18 23:06:09,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295a46eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:06:09, skipping insertion in model container [2019-12-18 23:06:09,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:06:09" (3/3) ... [2019-12-18 23:06:09,505 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_rmo.oepc.i [2019-12-18 23:06:09,516 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:06:09,517 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:06:09,525 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:06:09,526 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:06:09,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,565 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,589 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,589 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,590 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,590 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,590 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,601 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,601 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,601 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,608 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,609 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:06:09,628 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 23:06:09,646 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:06:09,646 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:06:09,647 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:06:09,647 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:06:09,647 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:06:09,647 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:06:09,647 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:06:09,647 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:06:09,665 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-18 23:06:09,667 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-18 23:06:09,756 INFO L126 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-18 23:06:09,757 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:06:09,772 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 23:06:09,790 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-18 23:06:09,825 INFO L126 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-18 23:06:09,826 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:06:09,831 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 23:06:09,844 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 23:06:09,845 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:06:12,757 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 23:06:12,866 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 23:06:12,960 INFO L206 etLargeBlockEncoding]: Checked pairs total: 42110 [2019-12-18 23:06:12,960 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 23:06:12,963 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 79 transitions [2019-12-18 23:06:13,315 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6782 states. [2019-12-18 23:06:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states. [2019-12-18 23:06:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 23:06:13,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:06:13,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 23:06:13,325 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:06:13,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:06:13,332 INFO L82 PathProgramCache]: Analyzing trace with hash 670284731, now seen corresponding path program 1 times [2019-12-18 23:06:13,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:06:13,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145423469] [2019-12-18 23:06:13,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:06:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:06:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:06:13,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145423469] [2019-12-18 23:06:13,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:06:13,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:06:13,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910257912] [2019-12-18 23:06:13,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:06:13,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:06:13,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:06:13,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:06:13,588 INFO L87 Difference]: Start difference. First operand 6782 states. Second operand 3 states. [2019-12-18 23:06:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:06:13,852 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-18 23:06:13,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:06:13,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 23:06:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:06:13,927 INFO L225 Difference]: With dead ends: 6240 [2019-12-18 23:06:13,927 INFO L226 Difference]: Without dead ends: 5850 [2019-12-18 23:06:13,929 INFO L631 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 [2019-12-18 23:06:14,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-18 23:06:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-18 23:06:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-18 23:06:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-18 23:06:14,376 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-18 23:06:14,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:06:14,376 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-18 23:06:14,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:06:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-18 23:06:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 23:06:14,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:06:14,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:06:14,386 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:06:14,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:06:14,393 INFO L82 PathProgramCache]: Analyzing trace with hash 509733655, now seen corresponding path program 1 times [2019-12-18 23:06:14,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:06:14,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161893223] [2019-12-18 23:06:14,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:06:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:06:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:06:14,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161893223] [2019-12-18 23:06:14,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:06:14,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:06:14,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087545043] [2019-12-18 23:06:14,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:06:14,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:06:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:06:14,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:06:14,498 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 3 states. [2019-12-18 23:06:14,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:06:14,552 INFO L93 Difference]: Finished difference Result 1185 states and 2948 transitions. [2019-12-18 23:06:14,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:06:14,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 23:06:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:06:14,562 INFO L225 Difference]: With dead ends: 1185 [2019-12-18 23:06:14,562 INFO L226 Difference]: Without dead ends: 1185 [2019-12-18 23:06:14,564 INFO L631 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 [2019-12-18 23:06:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-18 23:06:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-12-18 23:06:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-18 23:06:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2948 transitions. [2019-12-18 23:06:14,601 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2948 transitions. Word has length 11 [2019-12-18 23:06:14,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:06:14,601 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 2948 transitions. [2019-12-18 23:06:14,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:06:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2948 transitions. [2019-12-18 23:06:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 23:06:14,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:06:14,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:06:14,610 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:06:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:06:14,610 INFO L82 PathProgramCache]: Analyzing trace with hash 310188947, now seen corresponding path program 1 times [2019-12-18 23:06:14,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:06:14,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038645842] [2019-12-18 23:06:14,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:06:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:06:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:06:14,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038645842] [2019-12-18 23:06:14,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:06:14,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:06:14,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134945616] [2019-12-18 23:06:14,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:06:14,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:06:14,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:06:14,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:06:14,723 INFO L87 Difference]: Start difference. First operand 1185 states and 2948 transitions. Second operand 3 states. [2019-12-18 23:06:14,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:06:14,811 INFO L93 Difference]: Finished difference Result 1756 states and 4318 transitions. [2019-12-18 23:06:14,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:06:14,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 23:06:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:06:14,822 INFO L225 Difference]: With dead ends: 1756 [2019-12-18 23:06:14,822 INFO L226 Difference]: Without dead ends: 1756 [2019-12-18 23:06:14,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:06:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-18 23:06:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1300. [2019-12-18 23:06:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-18 23:06:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3182 transitions. [2019-12-18 23:06:14,871 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3182 transitions. Word has length 14 [2019-12-18 23:06:14,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:06:14,871 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3182 transitions. [2019-12-18 23:06:14,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:06:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3182 transitions. [2019-12-18 23:06:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 23:06:14,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:06:14,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:06:14,873 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:06:14,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:06:14,874 INFO L82 PathProgramCache]: Analyzing trace with hash 306457384, now seen corresponding path program 1 times [2019-12-18 23:06:14,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:06:14,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649319459] [2019-12-18 23:06:14,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:06:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:06:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:06:14,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649319459] [2019-12-18 23:06:14,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:06:14,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:06:14,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739462954] [2019-12-18 23:06:14,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:06:14,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:06:14,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:06:14,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:06:14,966 INFO L87 Difference]: Start difference. First operand 1300 states and 3182 transitions. Second operand 4 states. [2019-12-18 23:06:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:06:15,114 INFO L93 Difference]: Finished difference Result 1703 states and 4071 transitions. [2019-12-18 23:06:15,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:06:15,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 23:06:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:06:15,124 INFO L225 Difference]: With dead ends: 1703 [2019-12-18 23:06:15,125 INFO L226 Difference]: Without dead ends: 1703 [2019-12-18 23:06:15,125 INFO L631 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 [2019-12-18 23:06:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-18 23:06:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1513. [2019-12-18 23:06:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-12-18 23:06:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 3661 transitions. [2019-12-18 23:06:15,164 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 3661 transitions. Word has length 14 [2019-12-18 23:06:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:06:15,164 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 3661 transitions. [2019-12-18 23:06:15,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:06:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 3661 transitions. [2019-12-18 23:06:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 23:06:15,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:06:15,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:06:15,166 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:06:15,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:06:15,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1161574652, now seen corresponding path program 1 times [2019-12-18 23:06:15,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:06:15,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687552548] [2019-12-18 23:06:15,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:06:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:06:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:06:15,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687552548] [2019-12-18 23:06:15,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:06:15,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:06:15,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449761614] [2019-12-18 23:06:15,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:06:15,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:06:15,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:06:15,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:06:15,232 INFO L87 Difference]: Start difference. First operand 1513 states and 3661 transitions. Second operand 4 states. [2019-12-18 23:06:15,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:06:15,413 INFO L93 Difference]: Finished difference Result 1972 states and 4699 transitions. [2019-12-18 23:06:15,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:06:15,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 23:06:15,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:06:15,425 INFO L225 Difference]: With dead ends: 1972 [2019-12-18 23:06:15,425 INFO L226 Difference]: Without dead ends: 1972 [2019-12-18 23:06:15,426 INFO L631 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 [2019-12-18 23:06:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2019-12-18 23:06:15,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1607. [2019-12-18 23:06:15,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-18 23:06:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-12-18 23:06:15,466 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 14 [2019-12-18 23:06:15,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:06:15,466 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-12-18 23:06:15,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:06:15,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-12-18 23:06:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 23:06:15,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:06:15,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:06:15,470 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:06:15,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:06:15,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1039744201, now seen corresponding path program 1 times [2019-12-18 23:06:15,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:06:15,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662084511] [2019-12-18 23:06:15,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:06:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:06:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:06:15,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662084511] [2019-12-18 23:06:15,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:06:15,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:06:15,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111830882] [2019-12-18 23:06:15,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:06:15,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:06:15,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:06:15,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:06:15,519 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 4 states. [2019-12-18 23:06:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:06:15,537 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-18 23:06:15,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:06:15,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-18 23:06:15,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:06:15,543 INFO L225 Difference]: With dead ends: 772 [2019-12-18 23:06:15,543 INFO L226 Difference]: Without dead ends: 772 [2019-12-18 23:06:15,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:06:15,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-18 23:06:15,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 722. [2019-12-18 23:06:15,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-18 23:06:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1628 transitions. [2019-12-18 23:06:15,558 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1628 transitions. Word has length 26 [2019-12-18 23:06:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:06:15,559 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1628 transitions. [2019-12-18 23:06:15,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:06:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1628 transitions. [2019-12-18 23:06:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 23:06:15,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:06:15,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:06:15,562 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:06:15,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:06:15,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1200421068, now seen corresponding path program 1 times [2019-12-18 23:06:15,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:06:15,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501986398] [2019-12-18 23:06:15,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:06:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:06:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:06:15,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501986398] [2019-12-18 23:06:15,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:06:15,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:06:15,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631658983] [2019-12-18 23:06:15,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:06:15,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:06:15,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:06:15,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:06:15,622 INFO L87 Difference]: Start difference. First operand 722 states and 1628 transitions. Second operand 3 states. [2019-12-18 23:06:15,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:06:15,633 INFO L93 Difference]: Finished difference Result 1140 states and 2599 transitions. [2019-12-18 23:06:15,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:06:15,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 23:06:15,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:06:15,636 INFO L225 Difference]: With dead ends: 1140 [2019-12-18 23:06:15,637 INFO L226 Difference]: Without dead ends: 438 [2019-12-18 23:06:15,637 INFO L631 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 [2019-12-18 23:06:15,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-18 23:06:15,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-12-18 23:06:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-18 23:06:15,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1004 transitions. [2019-12-18 23:06:15,646 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1004 transitions. Word has length 41 [2019-12-18 23:06:15,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:06:15,647 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 1004 transitions. [2019-12-18 23:06:15,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:06:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1004 transitions. [2019-12-18 23:06:15,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 23:06:15,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:06:15,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:06:15,649 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:06:15,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:06:15,649 INFO L82 PathProgramCache]: Analyzing trace with hash -647816914, now seen corresponding path program 2 times [2019-12-18 23:06:15,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:06:15,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193608595] [2019-12-18 23:06:15,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:06:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:06:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:06:15,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193608595] [2019-12-18 23:06:15,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:06:15,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:06:15,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42132222] [2019-12-18 23:06:15,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:06:15,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:06:15,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:06:15,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:06:15,721 INFO L87 Difference]: Start difference. First operand 438 states and 1004 transitions. Second operand 6 states. [2019-12-18 23:06:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:06:15,851 INFO L93 Difference]: Finished difference Result 797 states and 1782 transitions. [2019-12-18 23:06:15,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:06:15,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 23:06:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:06:15,855 INFO L225 Difference]: With dead ends: 797 [2019-12-18 23:06:15,855 INFO L226 Difference]: Without dead ends: 535 [2019-12-18 23:06:15,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:06:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-12-18 23:06:15,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 461. [2019-12-18 23:06:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-12-18 23:06:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1034 transitions. [2019-12-18 23:06:15,866 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1034 transitions. Word has length 41 [2019-12-18 23:06:15,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:06:15,867 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 1034 transitions. [2019-12-18 23:06:15,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:06:15,867 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1034 transitions. [2019-12-18 23:06:15,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 23:06:15,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:06:15,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:06:15,869 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:06:15,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:06:15,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1820287444, now seen corresponding path program 3 times [2019-12-18 23:06:15,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:06:15,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087089135] [2019-12-18 23:06:15,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:06:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:06:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:06:15,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087089135] [2019-12-18 23:06:15,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:06:15,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:06:15,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949435150] [2019-12-18 23:06:15,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:06:15,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:06:15,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:06:15,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:06:15,950 INFO L87 Difference]: Start difference. First operand 461 states and 1034 transitions. Second operand 3 states. [2019-12-18 23:06:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:06:15,962 INFO L93 Difference]: Finished difference Result 461 states and 1032 transitions. [2019-12-18 23:06:15,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:06:15,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 23:06:15,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:06:15,966 INFO L225 Difference]: With dead ends: 461 [2019-12-18 23:06:15,966 INFO L226 Difference]: Without dead ends: 461 [2019-12-18 23:06:15,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:06:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-12-18 23:06:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2019-12-18 23:06:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-12-18 23:06:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1032 transitions. [2019-12-18 23:06:15,978 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1032 transitions. Word has length 41 [2019-12-18 23:06:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:06:15,978 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 1032 transitions. [2019-12-18 23:06:15,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:06:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1032 transitions. [2019-12-18 23:06:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 23:06:15,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:06:15,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:06:15,980 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:06:15,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:06:15,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1362148945, now seen corresponding path program 1 times [2019-12-18 23:06:15,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:06:15,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58099057] [2019-12-18 23:06:15,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:06:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:06:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:06:16,084 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:06:16,085 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:06:16,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~x$w_buff0_used~0_94) (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= 0 v_~x$r_buff0_thd2~0_24) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_6| 0) (= v_~x$r_buff1_thd0~0_22 0) (= 0 v_~x$w_buff0~0_24) (= (select .cse0 |v_ULTIMATE.start_main_~#t2569~0.base_20|) 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2569~0.base_20| 4)) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~y~0_16 0) (= v_~x$r_buff1_thd1~0_39 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2569~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2569~0.base_20|) |v_ULTIMATE.start_main_~#t2569~0.offset_16| 0)) |v_#memory_int_11|) (= v_~x$w_buff1_used~0_56 0) (= 0 v_~x$r_buff0_thd0~0_18) (= v_~x$mem_tmp~0_8 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_7) (= v_~x$flush_delayed~0_12 0) (= v_~x~0_20 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2569~0.base_20|) (= 0 v_~x$r_buff0_thd1~0_66) (= v_~main$tmp_guard1~0_14 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2569~0.base_20| 1)) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|) (= 0 |v_ULTIMATE.start_main_~#t2569~0.offset_16|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_24, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_66, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_8, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, #length=|v_#length_15|, ~y~0=v_~y~0_16, ULTIMATE.start_main_~#t2569~0.offset=|v_ULTIMATE.start_main_~#t2569~0.offset_16|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_18, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~x$w_buff1~0=v_~x$w_buff1~0_24, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_9|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_22, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ULTIMATE.start_main_~#t2570~0.offset=|v_ULTIMATE.start_main_~#t2570~0.offset_16|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2569~0.base=|v_ULTIMATE.start_main_~#t2569~0.base_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_20, ULTIMATE.start_main_~#t2570~0.base=|v_ULTIMATE.start_main_~#t2570~0.base_21|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t2569~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2570~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2569~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t2570~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 23:06:16,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L790-1-->L792: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2570~0.base_11| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t2570~0.base_11| 0)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2570~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2570~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t2570~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2570~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2570~0.base_11|) |v_ULTIMATE.start_main_~#t2570~0.offset_9| 1))) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2570~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2570~0.offset=|v_ULTIMATE.start_main_~#t2570~0.offset_9|, ULTIMATE.start_main_~#t2570~0.base=|v_ULTIMATE.start_main_~#t2570~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2570~0.offset, ULTIMATE.start_main_~#t2570~0.base] because there is no mapped edge [2019-12-18 23:06:16,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_35)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 23:06:16,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1196238732 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite9_Out1196238732| ~x$w_buff0~0_In1196238732) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite8_In1196238732| |P0Thread1of1ForFork1_#t~ite8_Out1196238732|)) (and .cse0 (= |P0Thread1of1ForFork1_#t~ite8_Out1196238732| |P0Thread1of1ForFork1_#t~ite9_Out1196238732|) (= |P0Thread1of1ForFork1_#t~ite8_Out1196238732| ~x$w_buff0~0_In1196238732) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1196238732 256)))) (or (= (mod ~x$w_buff0_used~0_In1196238732 256) 0) (and (= (mod ~x$w_buff1_used~0_In1196238732 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1196238732 256)))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1196238732, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1196238732, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In1196238732|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1196238732, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1196238732, ~weak$$choice2~0=~weak$$choice2~0_In1196238732, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1196238732} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1196238732, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1196238732, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1196238732|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out1196238732|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1196238732, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1196238732, ~weak$$choice2~0=~weak$$choice2~0_In1196238732, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1196238732} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 23:06:16,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_50)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_10|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 23:06:16,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_14) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 23:06:16,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In603060939 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In603060939 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out603060939|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In603060939 |P1Thread1of1ForFork0_#t~ite28_Out603060939|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In603060939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In603060939} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In603060939, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out603060939|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In603060939} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 23:06:16,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-909830107 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-909830107 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-909830107 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-909830107 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-909830107|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-909830107| ~x$w_buff1_used~0_In-909830107)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-909830107, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-909830107, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-909830107, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-909830107} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-909830107, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-909830107, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-909830107, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-909830107|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-909830107} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 23:06:16,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1814870383 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1814870383 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-1814870383 0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out-1814870383 ~x$r_buff0_thd2~0_In-1814870383) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1814870383, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1814870383} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1814870383|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1814870383, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1814870383} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 23:06:16,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In418474028 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In418474028 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In418474028 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In418474028 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out418474028| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out418474028| ~x$r_buff1_thd2~0_In418474028) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In418474028, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In418474028, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In418474028, ~x$w_buff0_used~0=~x$w_buff0_used~0_In418474028} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out418474028|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In418474028, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In418474028, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In418474028, ~x$w_buff0_used~0=~x$w_buff0_used~0_In418474028} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 23:06:16,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L771-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 23:06:16,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 23:06:16,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite34_Out1704239562| |ULTIMATE.start_main_#t~ite35_Out1704239562|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1704239562 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1704239562 256)))) (or (and .cse0 (= ~x$w_buff1~0_In1704239562 |ULTIMATE.start_main_#t~ite34_Out1704239562|) (not .cse1) (not .cse2)) (and .cse0 (= ~x~0_In1704239562 |ULTIMATE.start_main_#t~ite34_Out1704239562|) (or .cse2 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1704239562, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1704239562, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1704239562, ~x~0=~x~0_In1704239562} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1704239562, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1704239562|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1704239562, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1704239562, ~x~0=~x~0_In1704239562, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1704239562|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 23:06:16,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1018218146 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1018218146 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out1018218146| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out1018218146| ~x$w_buff0_used~0_In1018218146) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1018218146, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1018218146} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1018218146, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1018218146|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1018218146} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 23:06:16,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2131506903 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-2131506903 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-2131506903 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-2131506903 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-2131506903| ~x$w_buff1_used~0_In-2131506903) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite37_Out-2131506903| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2131506903, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2131506903, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2131506903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2131506903} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2131506903, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2131506903, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2131506903|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2131506903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2131506903} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 23:06:16,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1658693519 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1658693519 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1658693519| 0)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In1658693519 |ULTIMATE.start_main_#t~ite38_Out1658693519|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1658693519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1658693519} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1658693519, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1658693519|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1658693519} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 23:06:16,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1480846354 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1480846354 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1480846354 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1480846354 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1480846354| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out1480846354| ~x$r_buff1_thd0~0_In1480846354) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1480846354, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1480846354, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1480846354, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1480846354} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1480846354, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1480846354|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1480846354, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1480846354, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1480846354} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 23:06:16,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= v_~x$r_buff1_thd0~0_16 |v_ULTIMATE.start_main_#t~ite39_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 23:06:16,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:06:16 BasicIcfg [2019-12-18 23:06:16,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:06:16,188 INFO L168 Benchmark]: Toolchain (without parser) took 8294.24 ms. Allocated memory was 137.4 MB in the beginning and 342.9 MB in the end (delta: 205.5 MB). Free memory was 99.9 MB in the beginning and 127.0 MB in the end (delta: -27.2 MB). Peak memory consumption was 178.4 MB. Max. memory is 7.1 GB. [2019-12-18 23:06:16,189 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 23:06:16,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.82 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 157.0 MB in the end (delta: -57.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-18 23:06:16,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.25 ms. Allocated memory is still 201.3 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 23:06:16,191 INFO L168 Benchmark]: Boogie Preprocessor took 42.31 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:06:16,193 INFO L168 Benchmark]: RCFGBuilder took 760.48 ms. Allocated memory is still 201.3 MB. Free memory was 152.3 MB in the beginning and 111.1 MB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 7.1 GB. [2019-12-18 23:06:16,197 INFO L168 Benchmark]: TraceAbstraction took 6686.06 ms. Allocated memory was 201.3 MB in the beginning and 342.9 MB in the end (delta: 141.6 MB). Free memory was 111.1 MB in the beginning and 127.0 MB in the end (delta: -15.9 MB). Peak memory consumption was 125.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:06:16,206 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.82 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 157.0 MB in the end (delta: -57.6 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.25 ms. Allocated memory is still 201.3 MB. Free memory was 157.0 MB in the beginning and 154.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.31 ms. Allocated memory is still 201.3 MB. Free memory was 154.3 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 760.48 ms. Allocated memory is still 201.3 MB. Free memory was 152.3 MB in the beginning and 111.1 MB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6686.06 ms. Allocated memory was 201.3 MB in the beginning and 342.9 MB in the end (delta: 141.6 MB). Free memory was 111.1 MB in the beginning and 127.0 MB in the end (delta: -15.9 MB). Peak memory consumption was 125.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 134 ProgramPointsBefore, 67 ProgramPointsAfterwards, 162 TransitionsBefore, 79 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 19 ChoiceCompositions, 4002 VarBasedMoverChecksPositive, 149 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 42110 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2569, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] FCALL, FORK 0 pthread_create(&t2570, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 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) VAL [!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)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 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) [L767] 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) VAL [!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)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=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))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 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)) [L734] 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=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))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 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)) [L735] 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=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))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 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)) [L736] 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=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))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 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)) [L738] 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=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))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 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)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 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) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 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 [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 6.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 873 SDtfs, 554 SDslu, 1035 SDs, 0 SdLazy, 387 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6782occurred 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.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 1135 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 14928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...