/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/safe024_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:53:50,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:53:50,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:53:50,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:53:50,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:53:50,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:53:50,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:53:50,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:53:50,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:53:50,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:53:50,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:53:50,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:53:50,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:53:50,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:53:50,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:53:50,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:53:50,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:53:50,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:53:50,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:53:50,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:53:50,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:53:50,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:53:50,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:53:50,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:53:50,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:53:50,739 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:53:50,739 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:53:50,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:53:50,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:53:50,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:53:50,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:53:50,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:53:50,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:53:50,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:53:50,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:53:50,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:53:50,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:53:50,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:53:50,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:53:50,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:53:50,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:53:50,749 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 22:53:50,765 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:53:50,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:53:50,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:53:50,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:53:50,767 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:53:50,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:53:50,767 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:53:50,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:53:50,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:53:50,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:53:50,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:53:50,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:53:50,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:53:50,769 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:53:50,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:53:50,769 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:53:50,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:53:50,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:53:50,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:53:50,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:53:50,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:53:50,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:53:50,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:53:50,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:53:50,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:53:50,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:53:50,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:53:50,771 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:53:50,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:53:50,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:53:51,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:53:51,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:53:51,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:53:51,069 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:53:51,069 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:53:51,071 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_rmo.oepc.i [2019-12-18 22:53:51,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6903ad3de/4fe126f25fee4ed98276591c5cf9532b/FLAG083b14c4d [2019-12-18 22:53:51,701 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:53:51,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_rmo.oepc.i [2019-12-18 22:53:51,721 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6903ad3de/4fe126f25fee4ed98276591c5cf9532b/FLAG083b14c4d [2019-12-18 22:53:51,987 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6903ad3de/4fe126f25fee4ed98276591c5cf9532b [2019-12-18 22:53:51,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:53:51,998 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:53:51,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:53:51,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:53:52,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:53:52,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:53:51" (1/1) ... [2019-12-18 22:53:52,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c8690e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:52, skipping insertion in model container [2019-12-18 22:53:52,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:53:51" (1/1) ... [2019-12-18 22:53:52,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:53:52,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:53:52,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:53:52,641 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:53:52,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:53:52,781 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:53:52,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:52 WrapperNode [2019-12-18 22:53:52,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:53:52,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:53:52,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:53:52,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:53:52,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:52" (1/1) ... [2019-12-18 22:53:52,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:52" (1/1) ... [2019-12-18 22:53:52,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:53:52,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:53:52,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:53:52,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:53:52,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:52" (1/1) ... [2019-12-18 22:53:52,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:52" (1/1) ... [2019-12-18 22:53:52,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:52" (1/1) ... [2019-12-18 22:53:52,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:52" (1/1) ... [2019-12-18 22:53:52,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:52" (1/1) ... [2019-12-18 22:53:52,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:52" (1/1) ... [2019-12-18 22:53:52,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:52" (1/1) ... [2019-12-18 22:53:52,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:53:52,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:53:52,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:53:52,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:53:52,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:52" (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 22:53:52,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:53:52,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:53:52,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:53:52,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:53:52,953 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:53:52,953 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:53:52,954 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:53:52,954 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:53:52,954 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:53:52,954 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:53:52,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:53:52,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:53:52,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:53:52,957 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 22:53:53,674 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:53:53,675 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:53:53,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:53:53 BoogieIcfgContainer [2019-12-18 22:53:53,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:53:53,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:53:53,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:53:53,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:53:53,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:53:51" (1/3) ... [2019-12-18 22:53:53,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a2ab72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:53:53, skipping insertion in model container [2019-12-18 22:53:53,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:53:52" (2/3) ... [2019-12-18 22:53:53,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a2ab72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:53:53, skipping insertion in model container [2019-12-18 22:53:53,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:53:53" (3/3) ... [2019-12-18 22:53:53,689 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_rmo.oepc.i [2019-12-18 22:53:53,701 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:53:53,701 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:53:53,715 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:53:53,716 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:53:53,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,768 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,769 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,793 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,793 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,794 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,794 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,794 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,802 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,802 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,831 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,831 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,831 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,837 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,838 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:53:53,861 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:53:53,883 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:53:53,883 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:53:53,884 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:53:53,884 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:53:53,884 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:53:53,884 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:53:53,884 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:53:53,884 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:53:53,901 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 22:53:53,903 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 22:53:53,988 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 22:53:53,988 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:53:54,006 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:53:54,031 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 22:53:54,075 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 22:53:54,075 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:53:54,086 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 22:53:54,110 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 22:53:54,111 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:53:57,826 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 22:53:57,946 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 22:53:57,970 INFO L206 etLargeBlockEncoding]: Checked pairs total: 75034 [2019-12-18 22:53:57,970 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 22:53:57,974 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 87 transitions [2019-12-18 22:54:08,843 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85916 states. [2019-12-18 22:54:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 85916 states. [2019-12-18 22:54:08,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:54:08,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:08,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:54:08,853 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:08,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:08,858 INFO L82 PathProgramCache]: Analyzing trace with hash 797474655, now seen corresponding path program 1 times [2019-12-18 22:54:08,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:08,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340220553] [2019-12-18 22:54:08,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:09,095 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 22:54:09,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340220553] [2019-12-18 22:54:09,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:09,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:54:09,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668148409] [2019-12-18 22:54:09,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:54:09,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:09,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:54:09,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:54:09,122 INFO L87 Difference]: Start difference. First operand 85916 states. Second operand 3 states. [2019-12-18 22:54:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:11,357 INFO L93 Difference]: Finished difference Result 84652 states and 359098 transitions. [2019-12-18 22:54:11,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:54:11,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:54:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:11,892 INFO L225 Difference]: With dead ends: 84652 [2019-12-18 22:54:11,893 INFO L226 Difference]: Without dead ends: 79738 [2019-12-18 22:54:11,894 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 22:54:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79738 states. [2019-12-18 22:54:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79738 to 79738. [2019-12-18 22:54:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79738 states. [2019-12-18 22:54:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79738 states to 79738 states and 337790 transitions. [2019-12-18 22:54:21,259 INFO L78 Accepts]: Start accepts. Automaton has 79738 states and 337790 transitions. Word has length 5 [2019-12-18 22:54:21,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:21,260 INFO L462 AbstractCegarLoop]: Abstraction has 79738 states and 337790 transitions. [2019-12-18 22:54:21,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:54:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 79738 states and 337790 transitions. [2019-12-18 22:54:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:54:21,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:21,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:21,269 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:21,270 INFO L82 PathProgramCache]: Analyzing trace with hash 334215787, now seen corresponding path program 1 times [2019-12-18 22:54:21,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:21,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071690105] [2019-12-18 22:54:21,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:21,392 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 22:54:21,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071690105] [2019-12-18 22:54:21,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:21,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:54:21,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860775078] [2019-12-18 22:54:21,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:54:21,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:21,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:54:21,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:54:21,396 INFO L87 Difference]: Start difference. First operand 79738 states and 337790 transitions. Second operand 4 states. [2019-12-18 22:54:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:25,807 INFO L93 Difference]: Finished difference Result 122590 states and 499694 transitions. [2019-12-18 22:54:25,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:54:25,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:54:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:26,325 INFO L225 Difference]: With dead ends: 122590 [2019-12-18 22:54:26,325 INFO L226 Difference]: Without dead ends: 122513 [2019-12-18 22:54:26,326 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 22:54:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122513 states. [2019-12-18 22:54:32,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122513 to 111273. [2019-12-18 22:54:32,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111273 states. [2019-12-18 22:54:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111273 states to 111273 states and 458752 transitions. [2019-12-18 22:54:33,314 INFO L78 Accepts]: Start accepts. Automaton has 111273 states and 458752 transitions. Word has length 13 [2019-12-18 22:54:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:33,316 INFO L462 AbstractCegarLoop]: Abstraction has 111273 states and 458752 transitions. [2019-12-18 22:54:33,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:54:33,316 INFO L276 IsEmpty]: Start isEmpty. Operand 111273 states and 458752 transitions. [2019-12-18 22:54:33,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:54:33,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:33,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:33,320 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:33,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:33,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985611, now seen corresponding path program 1 times [2019-12-18 22:54:33,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:33,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487717012] [2019-12-18 22:54:33,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:33,369 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 22:54:33,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487717012] [2019-12-18 22:54:33,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:33,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:54:33,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761048501] [2019-12-18 22:54:33,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:54:33,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:54:33,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:54:33,373 INFO L87 Difference]: Start difference. First operand 111273 states and 458752 transitions. Second operand 3 states. [2019-12-18 22:54:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:33,494 INFO L93 Difference]: Finished difference Result 27590 states and 92015 transitions. [2019-12-18 22:54:33,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:54:33,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:54:33,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:33,552 INFO L225 Difference]: With dead ends: 27590 [2019-12-18 22:54:33,552 INFO L226 Difference]: Without dead ends: 27590 [2019-12-18 22:54:33,553 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 22:54:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27590 states. [2019-12-18 22:54:34,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27590 to 27590. [2019-12-18 22:54:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-18 22:54:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 92015 transitions. [2019-12-18 22:54:34,129 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 92015 transitions. Word has length 13 [2019-12-18 22:54:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:34,129 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 92015 transitions. [2019-12-18 22:54:34,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:54:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 92015 transitions. [2019-12-18 22:54:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:54:34,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:34,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:34,132 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:34,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:34,132 INFO L82 PathProgramCache]: Analyzing trace with hash -569288949, now seen corresponding path program 1 times [2019-12-18 22:54:34,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:34,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105062206] [2019-12-18 22:54:34,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:34,217 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 22:54:34,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105062206] [2019-12-18 22:54:34,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:34,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:54:34,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340484653] [2019-12-18 22:54:34,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:54:34,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:34,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:54:34,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:54:34,225 INFO L87 Difference]: Start difference. First operand 27590 states and 92015 transitions. Second operand 5 states. [2019-12-18 22:54:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:35,835 INFO L93 Difference]: Finished difference Result 40899 states and 133989 transitions. [2019-12-18 22:54:35,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:54:35,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 22:54:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:35,906 INFO L225 Difference]: With dead ends: 40899 [2019-12-18 22:54:35,907 INFO L226 Difference]: Without dead ends: 40883 [2019-12-18 22:54:35,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:54:36,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40883 states. [2019-12-18 22:54:36,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40883 to 30763. [2019-12-18 22:54:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30763 states. [2019-12-18 22:54:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30763 states to 30763 states and 102099 transitions. [2019-12-18 22:54:36,511 INFO L78 Accepts]: Start accepts. Automaton has 30763 states and 102099 transitions. Word has length 14 [2019-12-18 22:54:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:36,512 INFO L462 AbstractCegarLoop]: Abstraction has 30763 states and 102099 transitions. [2019-12-18 22:54:36,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:54:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 30763 states and 102099 transitions. [2019-12-18 22:54:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:54:36,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:36,522 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] [2019-12-18 22:54:36,522 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:36,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:36,523 INFO L82 PathProgramCache]: Analyzing trace with hash -777509353, now seen corresponding path program 1 times [2019-12-18 22:54:36,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:36,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346865652] [2019-12-18 22:54:36,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:36,624 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 22:54:36,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346865652] [2019-12-18 22:54:36,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:36,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:54:36,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816009883] [2019-12-18 22:54:36,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:54:36,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:36,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:54:36,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:54:36,626 INFO L87 Difference]: Start difference. First operand 30763 states and 102099 transitions. Second operand 6 states. [2019-12-18 22:54:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:37,812 INFO L93 Difference]: Finished difference Result 48043 states and 156144 transitions. [2019-12-18 22:54:37,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:54:37,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 22:54:37,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:37,899 INFO L225 Difference]: With dead ends: 48043 [2019-12-18 22:54:37,899 INFO L226 Difference]: Without dead ends: 48015 [2019-12-18 22:54:37,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:54:38,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48015 states. [2019-12-18 22:54:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48015 to 32442. [2019-12-18 22:54:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32442 states. [2019-12-18 22:54:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32442 states to 32442 states and 106747 transitions. [2019-12-18 22:54:38,569 INFO L78 Accepts]: Start accepts. Automaton has 32442 states and 106747 transitions. Word has length 22 [2019-12-18 22:54:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:38,570 INFO L462 AbstractCegarLoop]: Abstraction has 32442 states and 106747 transitions. [2019-12-18 22:54:38,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:54:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 32442 states and 106747 transitions. [2019-12-18 22:54:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:54:38,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:38,587 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] [2019-12-18 22:54:38,587 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:38,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:38,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050688, now seen corresponding path program 1 times [2019-12-18 22:54:38,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:38,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867841663] [2019-12-18 22:54:38,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:38,653 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 22:54:38,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867841663] [2019-12-18 22:54:38,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:38,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:54:38,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745867746] [2019-12-18 22:54:38,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:54:38,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:38,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:54:38,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:54:38,655 INFO L87 Difference]: Start difference. First operand 32442 states and 106747 transitions. Second operand 4 states. [2019-12-18 22:54:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:38,729 INFO L93 Difference]: Finished difference Result 12531 states and 37988 transitions. [2019-12-18 22:54:38,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:54:38,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:54:38,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:38,753 INFO L225 Difference]: With dead ends: 12531 [2019-12-18 22:54:38,753 INFO L226 Difference]: Without dead ends: 12531 [2019-12-18 22:54:38,754 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 22:54:38,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12531 states. [2019-12-18 22:54:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12531 to 12391. [2019-12-18 22:54:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12391 states. [2019-12-18 22:54:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12391 states to 12391 states and 37578 transitions. [2019-12-18 22:54:39,199 INFO L78 Accepts]: Start accepts. Automaton has 12391 states and 37578 transitions. Word has length 25 [2019-12-18 22:54:39,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:39,199 INFO L462 AbstractCegarLoop]: Abstraction has 12391 states and 37578 transitions. [2019-12-18 22:54:39,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:54:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 12391 states and 37578 transitions. [2019-12-18 22:54:39,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 22:54:39,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:39,216 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] [2019-12-18 22:54:39,217 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:39,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:39,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1562204347, now seen corresponding path program 1 times [2019-12-18 22:54:39,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:39,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016923936] [2019-12-18 22:54:39,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:39,346 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 22:54:39,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016923936] [2019-12-18 22:54:39,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:39,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:54:39,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174732895] [2019-12-18 22:54:39,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:54:39,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:39,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:54:39,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:54:39,349 INFO L87 Difference]: Start difference. First operand 12391 states and 37578 transitions. Second operand 5 states. [2019-12-18 22:54:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:39,421 INFO L93 Difference]: Finished difference Result 11113 states and 34299 transitions. [2019-12-18 22:54:39,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:54:39,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 22:54:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:39,441 INFO L225 Difference]: With dead ends: 11113 [2019-12-18 22:54:39,442 INFO L226 Difference]: Without dead ends: 11113 [2019-12-18 22:54:39,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:54:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11113 states. [2019-12-18 22:54:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11113 to 10665. [2019-12-18 22:54:39,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10665 states. [2019-12-18 22:54:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10665 states to 10665 states and 33035 transitions. [2019-12-18 22:54:39,605 INFO L78 Accepts]: Start accepts. Automaton has 10665 states and 33035 transitions. Word has length 39 [2019-12-18 22:54:39,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:39,606 INFO L462 AbstractCegarLoop]: Abstraction has 10665 states and 33035 transitions. [2019-12-18 22:54:39,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:54:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 10665 states and 33035 transitions. [2019-12-18 22:54:39,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:54:39,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:39,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:39,623 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:39,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:39,624 INFO L82 PathProgramCache]: Analyzing trace with hash 878583209, now seen corresponding path program 1 times [2019-12-18 22:54:39,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:39,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080865531] [2019-12-18 22:54:39,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:39,706 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 22:54:39,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080865531] [2019-12-18 22:54:39,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:39,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:54:39,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106049353] [2019-12-18 22:54:39,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:54:39,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:39,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:54:39,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:54:39,709 INFO L87 Difference]: Start difference. First operand 10665 states and 33035 transitions. Second operand 4 states. [2019-12-18 22:54:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:39,779 INFO L93 Difference]: Finished difference Result 19424 states and 60142 transitions. [2019-12-18 22:54:39,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:54:39,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 22:54:39,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:39,793 INFO L225 Difference]: With dead ends: 19424 [2019-12-18 22:54:39,794 INFO L226 Difference]: Without dead ends: 9092 [2019-12-18 22:54:39,794 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 22:54:39,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9092 states. [2019-12-18 22:54:39,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9092 to 9092. [2019-12-18 22:54:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9092 states. [2019-12-18 22:54:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9092 states to 9092 states and 28032 transitions. [2019-12-18 22:54:39,927 INFO L78 Accepts]: Start accepts. Automaton has 9092 states and 28032 transitions. Word has length 54 [2019-12-18 22:54:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:39,928 INFO L462 AbstractCegarLoop]: Abstraction has 9092 states and 28032 transitions. [2019-12-18 22:54:39,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:54:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 9092 states and 28032 transitions. [2019-12-18 22:54:39,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:54:39,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:39,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:39,941 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:39,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:39,942 INFO L82 PathProgramCache]: Analyzing trace with hash 546394411, now seen corresponding path program 2 times [2019-12-18 22:54:39,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:39,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793448117] [2019-12-18 22:54:39,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:40,054 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 22:54:40,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793448117] [2019-12-18 22:54:40,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:40,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:54:40,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038235781] [2019-12-18 22:54:40,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:54:40,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:40,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:54:40,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:54:40,056 INFO L87 Difference]: Start difference. First operand 9092 states and 28032 transitions. Second operand 7 states. [2019-12-18 22:54:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:40,476 INFO L93 Difference]: Finished difference Result 22341 states and 68728 transitions. [2019-12-18 22:54:40,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:54:40,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:54:40,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:40,506 INFO L225 Difference]: With dead ends: 22341 [2019-12-18 22:54:40,507 INFO L226 Difference]: Without dead ends: 17627 [2019-12-18 22:54:40,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:54:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17627 states. [2019-12-18 22:54:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17627 to 10818. [2019-12-18 22:54:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10818 states. [2019-12-18 22:54:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10818 states to 10818 states and 33605 transitions. [2019-12-18 22:54:40,717 INFO L78 Accepts]: Start accepts. Automaton has 10818 states and 33605 transitions. Word has length 54 [2019-12-18 22:54:40,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:40,717 INFO L462 AbstractCegarLoop]: Abstraction has 10818 states and 33605 transitions. [2019-12-18 22:54:40,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:54:40,717 INFO L276 IsEmpty]: Start isEmpty. Operand 10818 states and 33605 transitions. [2019-12-18 22:54:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:54:40,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:40,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:40,734 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:40,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:40,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2052295147, now seen corresponding path program 3 times [2019-12-18 22:54:40,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:40,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637171950] [2019-12-18 22:54:40,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:40,827 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 22:54:40,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637171950] [2019-12-18 22:54:40,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:40,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:54:40,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400257796] [2019-12-18 22:54:40,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:54:40,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:40,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:54:40,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:54:40,829 INFO L87 Difference]: Start difference. First operand 10818 states and 33605 transitions. Second operand 7 states. [2019-12-18 22:54:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:41,381 INFO L93 Difference]: Finished difference Result 26816 states and 81414 transitions. [2019-12-18 22:54:41,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:54:41,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:54:41,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:41,418 INFO L225 Difference]: With dead ends: 26816 [2019-12-18 22:54:41,418 INFO L226 Difference]: Without dead ends: 19206 [2019-12-18 22:54:41,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:54:41,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19206 states. [2019-12-18 22:54:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19206 to 12570. [2019-12-18 22:54:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12570 states. [2019-12-18 22:54:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12570 states to 12570 states and 38891 transitions. [2019-12-18 22:54:41,779 INFO L78 Accepts]: Start accepts. Automaton has 12570 states and 38891 transitions. Word has length 54 [2019-12-18 22:54:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:41,779 INFO L462 AbstractCegarLoop]: Abstraction has 12570 states and 38891 transitions. [2019-12-18 22:54:41,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:54:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 12570 states and 38891 transitions. [2019-12-18 22:54:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:54:41,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:41,803 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:41,804 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:41,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:41,804 INFO L82 PathProgramCache]: Analyzing trace with hash -243349385, now seen corresponding path program 4 times [2019-12-18 22:54:41,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:41,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529763072] [2019-12-18 22:54:41,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:41,894 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 22:54:41,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529763072] [2019-12-18 22:54:41,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:41,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:54:41,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974295433] [2019-12-18 22:54:41,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:54:41,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:41,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:54:41,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:54:41,896 INFO L87 Difference]: Start difference. First operand 12570 states and 38891 transitions. Second operand 7 states. [2019-12-18 22:54:42,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:42,296 INFO L93 Difference]: Finished difference Result 24752 states and 76254 transitions. [2019-12-18 22:54:42,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:54:42,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 22:54:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:42,345 INFO L225 Difference]: With dead ends: 24752 [2019-12-18 22:54:42,345 INFO L226 Difference]: Without dead ends: 22870 [2019-12-18 22:54:42,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:54:42,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22870 states. [2019-12-18 22:54:42,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22870 to 12633. [2019-12-18 22:54:42,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12633 states. [2019-12-18 22:54:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12633 states to 12633 states and 39160 transitions. [2019-12-18 22:54:42,767 INFO L78 Accepts]: Start accepts. Automaton has 12633 states and 39160 transitions. Word has length 54 [2019-12-18 22:54:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:42,768 INFO L462 AbstractCegarLoop]: Abstraction has 12633 states and 39160 transitions. [2019-12-18 22:54:42,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:54:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 12633 states and 39160 transitions. [2019-12-18 22:54:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:54:42,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:42,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:42,791 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:42,791 INFO L82 PathProgramCache]: Analyzing trace with hash 647129887, now seen corresponding path program 1 times [2019-12-18 22:54:42,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:42,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903831329] [2019-12-18 22:54:42,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:42,867 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 22:54:42,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903831329] [2019-12-18 22:54:42,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:42,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:54:42,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722484409] [2019-12-18 22:54:42,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:54:42,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:42,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:54:42,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:54:42,869 INFO L87 Difference]: Start difference. First operand 12633 states and 39160 transitions. Second operand 3 states. [2019-12-18 22:54:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:42,970 INFO L93 Difference]: Finished difference Result 18808 states and 58234 transitions. [2019-12-18 22:54:42,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:54:42,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 22:54:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:43,008 INFO L225 Difference]: With dead ends: 18808 [2019-12-18 22:54:43,008 INFO L226 Difference]: Without dead ends: 18808 [2019-12-18 22:54:43,009 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 22:54:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18808 states. [2019-12-18 22:54:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18808 to 16456. [2019-12-18 22:54:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16456 states. [2019-12-18 22:54:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16456 states to 16456 states and 51479 transitions. [2019-12-18 22:54:43,633 INFO L78 Accepts]: Start accepts. Automaton has 16456 states and 51479 transitions. Word has length 54 [2019-12-18 22:54:43,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:43,633 INFO L462 AbstractCegarLoop]: Abstraction has 16456 states and 51479 transitions. [2019-12-18 22:54:43,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:54:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 16456 states and 51479 transitions. [2019-12-18 22:54:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 22:54:43,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:43,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:43,653 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:43,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:43,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1558398603, now seen corresponding path program 5 times [2019-12-18 22:54:43,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:43,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609987484] [2019-12-18 22:54:43,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:43,746 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 22:54:43,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609987484] [2019-12-18 22:54:43,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:43,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:54:43,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475675103] [2019-12-18 22:54:43,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:54:43,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:54:43,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:54:43,748 INFO L87 Difference]: Start difference. First operand 16456 states and 51479 transitions. Second operand 3 states. [2019-12-18 22:54:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:43,811 INFO L93 Difference]: Finished difference Result 13349 states and 40700 transitions. [2019-12-18 22:54:43,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:54:43,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 22:54:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:43,837 INFO L225 Difference]: With dead ends: 13349 [2019-12-18 22:54:43,837 INFO L226 Difference]: Without dead ends: 13349 [2019-12-18 22:54:43,837 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 22:54:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13349 states. [2019-12-18 22:54:44,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13349 to 12872. [2019-12-18 22:54:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12872 states. [2019-12-18 22:54:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12872 states to 12872 states and 39150 transitions. [2019-12-18 22:54:44,045 INFO L78 Accepts]: Start accepts. Automaton has 12872 states and 39150 transitions. Word has length 54 [2019-12-18 22:54:44,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:44,045 INFO L462 AbstractCegarLoop]: Abstraction has 12872 states and 39150 transitions. [2019-12-18 22:54:44,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:54:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 12872 states and 39150 transitions. [2019-12-18 22:54:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:54:44,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:44,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:44,063 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:44,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2068351876, now seen corresponding path program 1 times [2019-12-18 22:54:44,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:44,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564430696] [2019-12-18 22:54:44,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:44,210 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 22:54:44,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564430696] [2019-12-18 22:54:44,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:44,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:54:44,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705824177] [2019-12-18 22:54:44,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:54:44,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:44,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:54:44,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:54:44,212 INFO L87 Difference]: Start difference. First operand 12872 states and 39150 transitions. Second operand 7 states. [2019-12-18 22:54:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:45,239 INFO L93 Difference]: Finished difference Result 20445 states and 60877 transitions. [2019-12-18 22:54:45,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:54:45,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-18 22:54:45,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:45,271 INFO L225 Difference]: With dead ends: 20445 [2019-12-18 22:54:45,271 INFO L226 Difference]: Without dead ends: 20297 [2019-12-18 22:54:45,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:54:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20297 states. [2019-12-18 22:54:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20297 to 16742. [2019-12-18 22:54:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16742 states. [2019-12-18 22:54:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16742 states to 16742 states and 50459 transitions. [2019-12-18 22:54:45,525 INFO L78 Accepts]: Start accepts. Automaton has 16742 states and 50459 transitions. Word has length 55 [2019-12-18 22:54:45,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:45,526 INFO L462 AbstractCegarLoop]: Abstraction has 16742 states and 50459 transitions. [2019-12-18 22:54:45,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:54:45,526 INFO L276 IsEmpty]: Start isEmpty. Operand 16742 states and 50459 transitions. [2019-12-18 22:54:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:54:45,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:45,549 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:45,549 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:45,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:45,550 INFO L82 PathProgramCache]: Analyzing trace with hash 41129598, now seen corresponding path program 2 times [2019-12-18 22:54:45,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:45,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751095062] [2019-12-18 22:54:45,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:45,665 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 22:54:45,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751095062] [2019-12-18 22:54:45,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:45,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:54:45,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994146802] [2019-12-18 22:54:45,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:54:45,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:45,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:54:45,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:54:45,668 INFO L87 Difference]: Start difference. First operand 16742 states and 50459 transitions. Second operand 7 states. [2019-12-18 22:54:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:46,532 INFO L93 Difference]: Finished difference Result 25121 states and 74006 transitions. [2019-12-18 22:54:46,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 22:54:46,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-18 22:54:46,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:46,569 INFO L225 Difference]: With dead ends: 25121 [2019-12-18 22:54:46,569 INFO L226 Difference]: Without dead ends: 25121 [2019-12-18 22:54:46,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 22:54:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25121 states. [2019-12-18 22:54:47,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25121 to 17944. [2019-12-18 22:54:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17944 states. [2019-12-18 22:54:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17944 states to 17944 states and 53943 transitions. [2019-12-18 22:54:47,062 INFO L78 Accepts]: Start accepts. Automaton has 17944 states and 53943 transitions. Word has length 55 [2019-12-18 22:54:47,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:47,062 INFO L462 AbstractCegarLoop]: Abstraction has 17944 states and 53943 transitions. [2019-12-18 22:54:47,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:54:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 17944 states and 53943 transitions. [2019-12-18 22:54:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:54:47,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:47,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:47,079 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:47,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1084774030, now seen corresponding path program 3 times [2019-12-18 22:54:47,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:47,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065385964] [2019-12-18 22:54:47,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:47,214 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 22:54:47,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065385964] [2019-12-18 22:54:47,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:47,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:54:47,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431473632] [2019-12-18 22:54:47,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:54:47,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:47,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:54:47,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:54:47,216 INFO L87 Difference]: Start difference. First operand 17944 states and 53943 transitions. Second operand 9 states. [2019-12-18 22:54:49,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:49,437 INFO L93 Difference]: Finished difference Result 23879 states and 70313 transitions. [2019-12-18 22:54:49,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 22:54:49,437 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 22:54:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:49,470 INFO L225 Difference]: With dead ends: 23879 [2019-12-18 22:54:49,470 INFO L226 Difference]: Without dead ends: 23879 [2019-12-18 22:54:49,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=988, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 22:54:49,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23879 states. [2019-12-18 22:54:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23879 to 15647. [2019-12-18 22:54:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15647 states. [2019-12-18 22:54:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15647 states to 15647 states and 47311 transitions. [2019-12-18 22:54:49,753 INFO L78 Accepts]: Start accepts. Automaton has 15647 states and 47311 transitions. Word has length 55 [2019-12-18 22:54:49,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:49,753 INFO L462 AbstractCegarLoop]: Abstraction has 15647 states and 47311 transitions. [2019-12-18 22:54:49,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:54:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 15647 states and 47311 transitions. [2019-12-18 22:54:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:54:49,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:49,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:49,770 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:49,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:49,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1247506214, now seen corresponding path program 4 times [2019-12-18 22:54:49,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:49,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185623048] [2019-12-18 22:54:49,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:49,876 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 22:54:49,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185623048] [2019-12-18 22:54:49,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:49,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 22:54:49,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902924] [2019-12-18 22:54:49,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 22:54:49,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:49,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 22:54:49,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:54:49,879 INFO L87 Difference]: Start difference. First operand 15647 states and 47311 transitions. Second operand 9 states. [2019-12-18 22:54:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:51,319 INFO L93 Difference]: Finished difference Result 29337 states and 88259 transitions. [2019-12-18 22:54:51,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 22:54:51,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-18 22:54:51,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:51,352 INFO L225 Difference]: With dead ends: 29337 [2019-12-18 22:54:51,353 INFO L226 Difference]: Without dead ends: 22798 [2019-12-18 22:54:51,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:54:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22798 states. [2019-12-18 22:54:51,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22798 to 16089. [2019-12-18 22:54:51,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16089 states. [2019-12-18 22:54:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16089 states to 16089 states and 48192 transitions. [2019-12-18 22:54:51,627 INFO L78 Accepts]: Start accepts. Automaton has 16089 states and 48192 transitions. Word has length 55 [2019-12-18 22:54:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:51,627 INFO L462 AbstractCegarLoop]: Abstraction has 16089 states and 48192 transitions. [2019-12-18 22:54:51,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 22:54:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 16089 states and 48192 transitions. [2019-12-18 22:54:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:54:51,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:51,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:51,644 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:51,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:51,645 INFO L82 PathProgramCache]: Analyzing trace with hash -653717204, now seen corresponding path program 5 times [2019-12-18 22:54:51,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:51,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213284463] [2019-12-18 22:54:51,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:51,872 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 22:54:51,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213284463] [2019-12-18 22:54:51,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:51,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:54:51,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26170284] [2019-12-18 22:54:51,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:54:51,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:51,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:54:51,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:54:51,882 INFO L87 Difference]: Start difference. First operand 16089 states and 48192 transitions. Second operand 12 states. [2019-12-18 22:54:53,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:53,320 INFO L93 Difference]: Finished difference Result 21046 states and 62732 transitions. [2019-12-18 22:54:53,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 22:54:53,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-18 22:54:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:53,347 INFO L225 Difference]: With dead ends: 21046 [2019-12-18 22:54:53,347 INFO L226 Difference]: Without dead ends: 19557 [2019-12-18 22:54:53,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:54:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19557 states. [2019-12-18 22:54:53,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19557 to 16309. [2019-12-18 22:54:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16309 states. [2019-12-18 22:54:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16309 states to 16309 states and 48738 transitions. [2019-12-18 22:54:53,597 INFO L78 Accepts]: Start accepts. Automaton has 16309 states and 48738 transitions. Word has length 55 [2019-12-18 22:54:53,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:53,598 INFO L462 AbstractCegarLoop]: Abstraction has 16309 states and 48738 transitions. [2019-12-18 22:54:53,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:54:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 16309 states and 48738 transitions. [2019-12-18 22:54:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:54:53,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:53,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:53,615 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:53,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:53,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1491379880, now seen corresponding path program 6 times [2019-12-18 22:54:53,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:53,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629248541] [2019-12-18 22:54:53,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:53,787 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 22:54:53,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629248541] [2019-12-18 22:54:53,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:53,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:54:53,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390394148] [2019-12-18 22:54:53,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:54:53,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:53,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:54:53,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:54:53,789 INFO L87 Difference]: Start difference. First operand 16309 states and 48738 transitions. Second operand 11 states. [2019-12-18 22:54:55,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:55,505 INFO L93 Difference]: Finished difference Result 23658 states and 69769 transitions. [2019-12-18 22:54:55,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 22:54:55,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:54:55,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:55,534 INFO L225 Difference]: With dead ends: 23658 [2019-12-18 22:54:55,534 INFO L226 Difference]: Without dead ends: 20952 [2019-12-18 22:54:55,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 22:54:55,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20952 states. [2019-12-18 22:54:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20952 to 16701. [2019-12-18 22:54:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16701 states. [2019-12-18 22:54:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16701 states to 16701 states and 49587 transitions. [2019-12-18 22:54:55,799 INFO L78 Accepts]: Start accepts. Automaton has 16701 states and 49587 transitions. Word has length 55 [2019-12-18 22:54:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:55,799 INFO L462 AbstractCegarLoop]: Abstraction has 16701 states and 49587 transitions. [2019-12-18 22:54:55,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:54:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 16701 states and 49587 transitions. [2019-12-18 22:54:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:54:55,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:55,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:55,817 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:55,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1863073752, now seen corresponding path program 7 times [2019-12-18 22:54:55,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:55,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999699682] [2019-12-18 22:54:55,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:55,948 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 22:54:55,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999699682] [2019-12-18 22:54:55,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:55,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:54:55,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467847867] [2019-12-18 22:54:55,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:54:55,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:55,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:54:55,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:54:55,950 INFO L87 Difference]: Start difference. First operand 16701 states and 49587 transitions. Second operand 11 states. [2019-12-18 22:54:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:57,414 INFO L93 Difference]: Finished difference Result 22336 states and 65825 transitions. [2019-12-18 22:54:57,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 22:54:57,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-18 22:54:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:57,447 INFO L225 Difference]: With dead ends: 22336 [2019-12-18 22:54:57,447 INFO L226 Difference]: Without dead ends: 21286 [2019-12-18 22:54:57,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2019-12-18 22:54:57,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21286 states. [2019-12-18 22:54:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21286 to 16465. [2019-12-18 22:54:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16465 states. [2019-12-18 22:54:57,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16465 states to 16465 states and 49012 transitions. [2019-12-18 22:54:57,704 INFO L78 Accepts]: Start accepts. Automaton has 16465 states and 49012 transitions. Word has length 55 [2019-12-18 22:54:57,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:57,704 INFO L462 AbstractCegarLoop]: Abstraction has 16465 states and 49012 transitions. [2019-12-18 22:54:57,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:54:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 16465 states and 49012 transitions. [2019-12-18 22:54:57,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:54:57,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:57,720 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:57,720 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:57,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:57,721 INFO L82 PathProgramCache]: Analyzing trace with hash 141450084, now seen corresponding path program 8 times [2019-12-18 22:54:57,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:57,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18722635] [2019-12-18 22:54:57,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:54:57,974 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 22:54:57,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18722635] [2019-12-18 22:54:57,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:54:57,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:54:57,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991953069] [2019-12-18 22:54:57,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:54:57,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:54:57,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:54:57,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:54:57,976 INFO L87 Difference]: Start difference. First operand 16465 states and 49012 transitions. Second operand 12 states. [2019-12-18 22:54:59,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:54:59,306 INFO L93 Difference]: Finished difference Result 21057 states and 62290 transitions. [2019-12-18 22:54:59,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 22:54:59,307 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-18 22:54:59,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:54:59,335 INFO L225 Difference]: With dead ends: 21057 [2019-12-18 22:54:59,335 INFO L226 Difference]: Without dead ends: 20300 [2019-12-18 22:54:59,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:54:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20300 states. [2019-12-18 22:54:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20300 to 16410. [2019-12-18 22:54:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16410 states. [2019-12-18 22:54:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16410 states to 16410 states and 48881 transitions. [2019-12-18 22:54:59,763 INFO L78 Accepts]: Start accepts. Automaton has 16410 states and 48881 transitions. Word has length 55 [2019-12-18 22:54:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:54:59,763 INFO L462 AbstractCegarLoop]: Abstraction has 16410 states and 48881 transitions. [2019-12-18 22:54:59,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:54:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 16410 states and 48881 transitions. [2019-12-18 22:54:59,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:54:59,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:54:59,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:54:59,779 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:54:59,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:54:59,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1871827704, now seen corresponding path program 9 times [2019-12-18 22:54:59,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:54:59,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519733644] [2019-12-18 22:54:59,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:54:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:55:00,012 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 22:55:00,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519733644] [2019-12-18 22:55:00,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:55:00,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:55:00,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120771381] [2019-12-18 22:55:00,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:55:00,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:55:00,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:55:00,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:55:00,017 INFO L87 Difference]: Start difference. First operand 16410 states and 48881 transitions. Second operand 13 states. [2019-12-18 22:55:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:55:01,916 INFO L93 Difference]: Finished difference Result 20507 states and 60592 transitions. [2019-12-18 22:55:01,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 22:55:01,917 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-18 22:55:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:55:01,945 INFO L225 Difference]: With dead ends: 20507 [2019-12-18 22:55:01,945 INFO L226 Difference]: Without dead ends: 20193 [2019-12-18 22:55:01,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2019-12-18 22:55:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20193 states. [2019-12-18 22:55:02,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20193 to 16722. [2019-12-18 22:55:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16722 states. [2019-12-18 22:55:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16722 states to 16722 states and 49634 transitions. [2019-12-18 22:55:02,216 INFO L78 Accepts]: Start accepts. Automaton has 16722 states and 49634 transitions. Word has length 55 [2019-12-18 22:55:02,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:55:02,217 INFO L462 AbstractCegarLoop]: Abstraction has 16722 states and 49634 transitions. [2019-12-18 22:55:02,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:55:02,217 INFO L276 IsEmpty]: Start isEmpty. Operand 16722 states and 49634 transitions. [2019-12-18 22:55:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:55:02,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:55:02,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:55:02,234 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:55:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:55:02,234 INFO L82 PathProgramCache]: Analyzing trace with hash 470464740, now seen corresponding path program 10 times [2019-12-18 22:55:02,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:55:02,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235758568] [2019-12-18 22:55:02,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:55:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:55:02,467 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 22:55:02,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235758568] [2019-12-18 22:55:02,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:55:02,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:55:02,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209100087] [2019-12-18 22:55:02,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:55:02,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:55:02,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:55:02,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:55:02,469 INFO L87 Difference]: Start difference. First operand 16722 states and 49634 transitions. Second operand 13 states. [2019-12-18 22:55:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:55:04,619 INFO L93 Difference]: Finished difference Result 21291 states and 62800 transitions. [2019-12-18 22:55:04,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 22:55:04,620 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-18 22:55:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:55:04,646 INFO L225 Difference]: With dead ends: 21291 [2019-12-18 22:55:04,646 INFO L226 Difference]: Without dead ends: 20433 [2019-12-18 22:55:04,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2019-12-18 22:55:04,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20433 states. [2019-12-18 22:55:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20433 to 16250. [2019-12-18 22:55:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16250 states. [2019-12-18 22:55:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16250 states to 16250 states and 48505 transitions. [2019-12-18 22:55:04,900 INFO L78 Accepts]: Start accepts. Automaton has 16250 states and 48505 transitions. Word has length 55 [2019-12-18 22:55:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:55:04,901 INFO L462 AbstractCegarLoop]: Abstraction has 16250 states and 48505 transitions. [2019-12-18 22:55:04,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:55:04,901 INFO L276 IsEmpty]: Start isEmpty. Operand 16250 states and 48505 transitions. [2019-12-18 22:55:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 22:55:04,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:55:04,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:55:04,917 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:55:04,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:55:04,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1458558076, now seen corresponding path program 11 times [2019-12-18 22:55:04,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:55:04,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108970361] [2019-12-18 22:55:04,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:55:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:55:04,988 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 22:55:04,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108970361] [2019-12-18 22:55:04,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:55:04,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:55:04,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144505462] [2019-12-18 22:55:04,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:55:04,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:55:04,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:55:04,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:55:04,989 INFO L87 Difference]: Start difference. First operand 16250 states and 48505 transitions. Second operand 3 states. [2019-12-18 22:55:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:55:05,055 INFO L93 Difference]: Finished difference Result 16248 states and 48500 transitions. [2019-12-18 22:55:05,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:55:05,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 22:55:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:55:05,078 INFO L225 Difference]: With dead ends: 16248 [2019-12-18 22:55:05,078 INFO L226 Difference]: Without dead ends: 16248 [2019-12-18 22:55:05,078 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 22:55:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16248 states. [2019-12-18 22:55:05,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16248 to 14746. [2019-12-18 22:55:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14746 states. [2019-12-18 22:55:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14746 states to 14746 states and 44350 transitions. [2019-12-18 22:55:05,307 INFO L78 Accepts]: Start accepts. Automaton has 14746 states and 44350 transitions. Word has length 55 [2019-12-18 22:55:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:55:05,308 INFO L462 AbstractCegarLoop]: Abstraction has 14746 states and 44350 transitions. [2019-12-18 22:55:05,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:55:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 14746 states and 44350 transitions. [2019-12-18 22:55:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:55:05,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:55:05,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:55:05,323 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:55:05,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:55:05,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1364903057, now seen corresponding path program 1 times [2019-12-18 22:55:05,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:55:05,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273624115] [2019-12-18 22:55:05,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:55:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:55:05,794 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 22:55:05,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273624115] [2019-12-18 22:55:05,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:55:05,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 22:55:05,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059256384] [2019-12-18 22:55:05,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 22:55:05,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:55:05,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 22:55:05,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 22:55:05,796 INFO L87 Difference]: Start difference. First operand 14746 states and 44350 transitions. Second operand 16 states. [2019-12-18 22:55:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:55:08,631 INFO L93 Difference]: Finished difference Result 22433 states and 65946 transitions. [2019-12-18 22:55:08,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 22:55:08,631 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-18 22:55:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:55:08,662 INFO L225 Difference]: With dead ends: 22433 [2019-12-18 22:55:08,662 INFO L226 Difference]: Without dead ends: 21797 [2019-12-18 22:55:08,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=313, Invalid=1327, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 22:55:08,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21797 states. [2019-12-18 22:55:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21797 to 14690. [2019-12-18 22:55:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14690 states. [2019-12-18 22:55:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14690 states to 14690 states and 44208 transitions. [2019-12-18 22:55:09,091 INFO L78 Accepts]: Start accepts. Automaton has 14690 states and 44208 transitions. Word has length 56 [2019-12-18 22:55:09,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:55:09,091 INFO L462 AbstractCegarLoop]: Abstraction has 14690 states and 44208 transitions. [2019-12-18 22:55:09,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 22:55:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 14690 states and 44208 transitions. [2019-12-18 22:55:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 22:55:09,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:55:09,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:55:09,107 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:55:09,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:55:09,107 INFO L82 PathProgramCache]: Analyzing trace with hash 379887659, now seen corresponding path program 2 times [2019-12-18 22:55:09,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:55:09,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867473950] [2019-12-18 22:55:09,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:55:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:55:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:55:09,208 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:55:09,208 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:55:09,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_53| 0 0))) (and (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2357~0.base_19| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2357~0.base_19|) |v_ULTIMATE.start_main_~#t2357~0.offset_15| 0)) |v_#memory_int_21|) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~x$r_buff0_thd2~0_24) (= 0 v_~x$r_buff0_thd0~0_20) (= v_~__unbuffered_p2_EBX~0_14 0) (= |v_ULTIMATE.start_main_~#t2357~0.offset_15| 0) (= 0 v_~weak$$choice0~0_5) (= v_~z~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_14) (= 0 v_~x$read_delayed_var~0.base_8) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t2357~0.base_19| 4) |v_#length_21|) (= v_~x$w_buff1_used~0_67 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~x$flush_delayed~0_14 0) (= 0 v_~x$r_buff0_thd1~0_71) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2357~0.base_19|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2357~0.base_19| 1) |v_#valid_51|) (= v_~x$r_buff1_thd2~0_16 0) (= 0 v_~x$w_buff0_used~0_110) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2357~0.base_19|)) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x$mem_tmp~0_11 0) (= v_~x~0_25 0) (= 0 v_~x$r_buff0_thd3~0_19) (= v_~y~0_10 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~x$r_buff1_thd0~0_19 0) (= 0 v_~x$w_buff0~0_29) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_29, ~x$flush_delayed~0=v_~x$flush_delayed~0_14, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ULTIMATE.start_main_~#t2357~0.base=|v_ULTIMATE.start_main_~#t2357~0.base_19|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start_main_~#t2358~0.offset=|v_ULTIMATE.start_main_~#t2358~0.offset_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x~0=v_~x~0_25, ULTIMATE.start_main_~#t2359~0.base=|v_ULTIMATE.start_main_~#t2359~0.base_21|, ULTIMATE.start_main_~#t2359~0.offset=|v_ULTIMATE.start_main_~#t2359~0.offset_16|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_71, ULTIMATE.start_main_~#t2358~0.base=|v_ULTIMATE.start_main_~#t2358~0.base_21|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_9|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~z~0=v_~z~0_10, ULTIMATE.start_main_~#t2357~0.offset=|v_ULTIMATE.start_main_~#t2357~0.offset_15|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2357~0.base, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2358~0.offset, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2359~0.base, ULTIMATE.start_main_~#t2359~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2358~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t2357~0.offset, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 22:55:09,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2358~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2358~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t2358~0.offset_11| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2358~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2358~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2358~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2358~0.base_13|) |v_ULTIMATE.start_main_~#t2358~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2358~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2358~0.offset=|v_ULTIMATE.start_main_~#t2358~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2358~0.base=|v_ULTIMATE.start_main_~#t2358~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2358~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2358~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 22:55:09,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= |v_ULTIMATE.start_main_~#t2359~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t2359~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2359~0.base_13|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2359~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2359~0.base_13|) |v_ULTIMATE.start_main_~#t2359~0.offset_11| 2))) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2359~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2359~0.base_13| 4)) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2359~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2359~0.offset=|v_ULTIMATE.start_main_~#t2359~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2359~0.base=|v_ULTIMATE.start_main_~#t2359~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2359~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2359~0.base] because there is no mapped edge [2019-12-18 22:55:09,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff0_used~0_In968178259 ~x$w_buff1_used~0_Out968178259) (= 1 ~x$w_buff0_used~0_Out968178259) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out968178259| 1) (= (mod ~x$w_buff1_used~0_Out968178259 256) 0) (= |P1Thread1of1ForFork0_#in~arg.offset_In968178259| P1Thread1of1ForFork0_~arg.offset_Out968178259) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out968178259| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out968178259) (= P1Thread1of1ForFork0_~arg.base_Out968178259 |P1Thread1of1ForFork0_#in~arg.base_In968178259|) (= ~x$w_buff0~0_In968178259 ~x$w_buff1~0_Out968178259) (= 1 ~x$w_buff0~0_Out968178259)) InVars {~x$w_buff0~0=~x$w_buff0~0_In968178259, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In968178259|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In968178259|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In968178259} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out968178259, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out968178259, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out968178259, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out968178259, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out968178259|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In968178259|, ~x$w_buff1~0=~x$w_buff1~0_Out968178259, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In968178259|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out968178259, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out968178259} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 22:55:09,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In915343522 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In915343522 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In915343522 |P2Thread1of1ForFork1_#t~ite32_Out915343522|)) (and (not .cse1) (= ~x$w_buff1~0_In915343522 |P2Thread1of1ForFork1_#t~ite32_Out915343522|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In915343522, ~x$w_buff1_used~0=~x$w_buff1_used~0_In915343522, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In915343522, ~x~0=~x~0_In915343522} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out915343522|, ~x$w_buff1~0=~x$w_buff1~0_In915343522, ~x$w_buff1_used~0=~x$w_buff1_used~0_In915343522, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In915343522, ~x~0=~x~0_In915343522} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 22:55:09,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_19 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 22:55:09,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-467328759 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-467328759 256)))) (or (and (= ~x$w_buff0_used~0_In-467328759 |P2Thread1of1ForFork1_#t~ite34_Out-467328759|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-467328759|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-467328759, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-467328759} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-467328759|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-467328759, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-467328759} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 22:55:09,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In248783559 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In248783559 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out248783559| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out248783559| ~x$w_buff0_used~0_In248783559)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In248783559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In248783559} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In248783559, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out248783559|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In248783559} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:55:09,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1779843653 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1779843653 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1779843653 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1779843653 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out1779843653| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out1779843653| ~x$w_buff1_used~0_In1779843653) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1779843653, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1779843653, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1779843653, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1779843653} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1779843653, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1779843653, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1779843653, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1779843653|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1779843653} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:55:09,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1322473546 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1322473546 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out1322473546 ~x$r_buff0_thd2~0_In1322473546)) (and (not .cse1) (= ~x$r_buff0_thd2~0_Out1322473546 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1322473546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1322473546} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1322473546|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1322473546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1322473546} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:55:09,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-204781668 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-204781668 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-204781668 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-204781668 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-204781668| ~x$r_buff1_thd2~0_In-204781668)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-204781668|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-204781668, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-204781668, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-204781668, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-204781668} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-204781668|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-204781668, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-204781668, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-204781668, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-204781668} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:55:09,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L781-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_11 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, 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 22:55:09,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1680615925 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_In-1680615925| |P0Thread1of1ForFork2_#t~ite11_Out-1680615925|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite12_Out-1680615925| ~x$w_buff1~0_In-1680615925)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1680615925 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1680615925 256))) (= (mod ~x$w_buff0_used~0_In-1680615925 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1680615925 256) 0)))) .cse0 (= |P0Thread1of1ForFork2_#t~ite11_Out-1680615925| ~x$w_buff1~0_In-1680615925) (= |P0Thread1of1ForFork2_#t~ite12_Out-1680615925| |P0Thread1of1ForFork2_#t~ite11_Out-1680615925|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1680615925, ~x$w_buff1~0=~x$w_buff1~0_In-1680615925, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1680615925, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1680615925, ~weak$$choice2~0=~weak$$choice2~0_In-1680615925, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-1680615925|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1680615925} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1680615925, ~x$w_buff1~0=~x$w_buff1~0_In-1680615925, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1680615925, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1680615925, ~weak$$choice2~0=~weak$$choice2~0_In-1680615925, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-1680615925|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-1680615925|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1680615925} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 22:55:09,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In732166358 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite15_Out732166358| ~x$w_buff0_used~0_In732166358) (= |P0Thread1of1ForFork2_#t~ite14_In732166358| |P0Thread1of1ForFork2_#t~ite14_Out732166358|)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out732166358| |P0Thread1of1ForFork2_#t~ite14_Out732166358|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In732166358 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In732166358 256)) .cse1) (= (mod ~x$w_buff0_used~0_In732166358 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In732166358 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite14_Out732166358| ~x$w_buff0_used~0_In732166358) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In732166358, ~x$w_buff1_used~0=~x$w_buff1_used~0_In732166358, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In732166358, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In732166358|, ~weak$$choice2~0=~weak$$choice2~0_In732166358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In732166358} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In732166358, ~x$w_buff1_used~0=~x$w_buff1_used~0_In732166358, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out732166358|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In732166358, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out732166358|, ~weak$$choice2~0=~weak$$choice2~0_In732166358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In732166358} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 22:55:09,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd1~0_In415269180 256) 0)) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In415269180 256))) (.cse4 (= (mod ~x$w_buff1_used~0_In415269180 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In415269180 256))) (.cse5 (= |P0Thread1of1ForFork2_#t~ite18_Out415269180| |P0Thread1of1ForFork2_#t~ite17_Out415269180|)) (.cse3 (= (mod ~weak$$choice2~0_In415269180 256) 0))) (or (let ((.cse0 (not .cse6))) (and (or .cse0 (not .cse1)) (not .cse2) (= 0 |P0Thread1of1ForFork2_#t~ite16_Out415269180|) .cse3 (or (not .cse4) .cse0) (= |P0Thread1of1ForFork2_#t~ite17_Out415269180| |P0Thread1of1ForFork2_#t~ite16_Out415269180|) .cse5)) (and (= |P0Thread1of1ForFork2_#t~ite16_In415269180| |P0Thread1of1ForFork2_#t~ite16_Out415269180|) (or (and (or (and .cse6 .cse1) (and .cse6 .cse4) .cse2) (= |P0Thread1of1ForFork2_#t~ite17_Out415269180| ~x$w_buff1_used~0_In415269180) .cse3 .cse5) (and (not .cse3) (= |P0Thread1of1ForFork2_#t~ite17_Out415269180| |P0Thread1of1ForFork2_#t~ite17_In415269180|) (= |P0Thread1of1ForFork2_#t~ite18_Out415269180| ~x$w_buff1_used~0_In415269180)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In415269180, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In415269180|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In415269180, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_In415269180|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In415269180, ~weak$$choice2~0=~weak$$choice2~0_In415269180, ~x$w_buff0_used~0=~x$w_buff0_used~0_In415269180} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In415269180, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out415269180|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out415269180|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In415269180, P0Thread1of1ForFork2_#t~ite16=|P0Thread1of1ForFork2_#t~ite16_Out415269180|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In415269180, ~weak$$choice2~0=~weak$$choice2~0_In415269180, ~x$w_buff0_used~0=~x$w_buff0_used~0_In415269180} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17, P0Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 22:55:09,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L746-->L747: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_44 v_~x$r_buff0_thd1~0_43)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_44, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_7|, ~weak$$choice2~0=v_~weak$$choice2~0_19, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 22:55:09,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L747-->L747-8: Formula: (let ((.cse4 (= (mod ~weak$$choice2~0_In908595460 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In908595460 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In908595460 256) 0)) (.cse5 (= |P0Thread1of1ForFork2_#t~ite24_Out908595460| |P0Thread1of1ForFork2_#t~ite23_Out908595460|)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In908595460 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In908595460 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite22_In908595460| |P0Thread1of1ForFork2_#t~ite22_Out908595460|) (or (and (or (and .cse0 .cse1) .cse2 (and .cse3 .cse0)) .cse4 (= ~x$r_buff1_thd1~0_In908595460 |P0Thread1of1ForFork2_#t~ite23_Out908595460|) .cse5) (and (= |P0Thread1of1ForFork2_#t~ite23_In908595460| |P0Thread1of1ForFork2_#t~ite23_Out908595460|) (= ~x$r_buff1_thd1~0_In908595460 |P0Thread1of1ForFork2_#t~ite24_Out908595460|) (not .cse4)))) (let ((.cse6 (not .cse0))) (and .cse4 (or .cse6 (not .cse1)) (not .cse2) .cse5 (= |P0Thread1of1ForFork2_#t~ite23_Out908595460| |P0Thread1of1ForFork2_#t~ite22_Out908595460|) (= |P0Thread1of1ForFork2_#t~ite22_Out908595460| 0) (or (not .cse3) .cse6))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In908595460, ~x$w_buff1_used~0=~x$w_buff1_used~0_In908595460, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In908595460, ~weak$$choice2~0=~weak$$choice2~0_In908595460, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In908595460|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In908595460|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In908595460} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In908595460, ~x$w_buff1_used~0=~x$w_buff1_used~0_In908595460, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In908595460, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out908595460|, ~weak$$choice2~0=~weak$$choice2~0_In908595460, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out908595460|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out908595460|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In908595460} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-18 22:55:09,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_18) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 22:55:09,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-2098364077 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2098364077 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-2098364077 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-2098364077 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite35_Out-2098364077| ~x$w_buff1_used~0_In-2098364077)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork1_#t~ite35_Out-2098364077| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2098364077, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2098364077, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2098364077, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2098364077} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-2098364077|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2098364077, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2098364077, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2098364077, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2098364077} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 22:55:09,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In612769013 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In612769013 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out612769013|)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In612769013 |P2Thread1of1ForFork1_#t~ite36_Out612769013|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In612769013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In612769013} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out612769013|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In612769013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In612769013} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 22:55:09,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In426298268 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In426298268 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In426298268 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In426298268 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In426298268 |P2Thread1of1ForFork1_#t~ite37_Out426298268|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out426298268|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In426298268, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In426298268, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In426298268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In426298268} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out426298268|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In426298268, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In426298268, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In426298268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In426298268} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:55:09,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 22:55:09,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:55:09,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In92891076 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In92891076 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out92891076| ~x~0_In92891076)) (and (not .cse0) (= ~x$w_buff1~0_In92891076 |ULTIMATE.start_main_#t~ite41_Out92891076|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In92891076, ~x$w_buff1_used~0=~x$w_buff1_used~0_In92891076, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In92891076, ~x~0=~x~0_In92891076} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out92891076|, ~x$w_buff1~0=~x$w_buff1~0_In92891076, ~x$w_buff1_used~0=~x$w_buff1_used~0_In92891076, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In92891076, ~x~0=~x~0_In92891076} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 22:55:09,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_14 |v_ULTIMATE.start_main_#t~ite41_8|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-18 22:55:09,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In882182165 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In882182165 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out882182165| ~x$w_buff0_used~0_In882182165)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out882182165|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In882182165, ~x$w_buff0_used~0=~x$w_buff0_used~0_In882182165} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In882182165, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out882182165|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In882182165} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 22:55:09,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In-1726869056 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1726869056 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1726869056 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1726869056 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1726869056| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite44_Out-1726869056| ~x$w_buff1_used~0_In-1726869056) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1726869056, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1726869056, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1726869056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1726869056} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1726869056, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1726869056, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1726869056, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1726869056|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1726869056} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 22:55:09,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2130102901 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-2130102901 256)))) (or (and (= ~x$r_buff0_thd0~0_In-2130102901 |ULTIMATE.start_main_#t~ite45_Out-2130102901|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-2130102901| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2130102901, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2130102901} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2130102901, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2130102901|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2130102901} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 22:55:09,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In298041550 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In298041550 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In298041550 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In298041550 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In298041550 |ULTIMATE.start_main_#t~ite46_Out298041550|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite46_Out298041550| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In298041550, ~x$w_buff1_used~0=~x$w_buff1_used~0_In298041550, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In298041550, ~x$w_buff0_used~0=~x$w_buff0_used~0_In298041550} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In298041550, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out298041550|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In298041550, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In298041550, ~x$w_buff0_used~0=~x$w_buff0_used~0_In298041550} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 22:55:09,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~x$r_buff1_thd0~0_13 |v_ULTIMATE.start_main_#t~ite46_11|) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_9 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:55:09,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:55:09 BasicIcfg [2019-12-18 22:55:09,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:55:09,305 INFO L168 Benchmark]: Toolchain (without parser) took 77307.96 ms. Allocated memory was 136.8 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 100.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 547.2 MB. Max. memory is 7.1 GB. [2019-12-18 22:55:09,305 INFO L168 Benchmark]: CDTParser took 0.78 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 22:55:09,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.14 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 154.7 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:55:09,306 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.92 ms. Allocated memory is still 200.8 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:55:09,307 INFO L168 Benchmark]: Boogie Preprocessor took 53.61 ms. Allocated memory is still 200.8 MB. Free memory was 152.0 MB in the beginning and 149.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:55:09,307 INFO L168 Benchmark]: RCFGBuilder took 777.86 ms. Allocated memory is still 200.8 MB. Free memory was 149.2 MB in the beginning and 102.9 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:55:09,308 INFO L168 Benchmark]: TraceAbstraction took 75624.74 ms. Allocated memory was 200.8 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 102.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 485.2 MB. Max. memory is 7.1 GB. [2019-12-18 22:55:09,315 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.78 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.14 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 154.7 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.92 ms. Allocated memory is still 200.8 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.61 ms. Allocated memory is still 200.8 MB. Free memory was 152.0 MB in the beginning and 149.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 777.86 ms. Allocated memory is still 200.8 MB. Free memory was 149.2 MB in the beginning and 102.9 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75624.74 ms. Allocated memory was 200.8 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 102.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 485.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 87 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 25 ConcurrentYvCompositions, 30 ChoiceCompositions, 6629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 75034 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 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, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 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) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L741] 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) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 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)) [L743] 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)) [L744] 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)) [L745] 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)) [L747] 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)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 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 [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 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 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 75.3s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 31.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4946 SDtfs, 5631 SDslu, 19119 SDs, 0 SdLazy, 17285 SolverSat, 273 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 59 SyntacticMatches, 18 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111273occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 122178 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1172 NumberOfCodeBlocks, 1172 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1091 ConstructedInterpolants, 0 QuantifiedInterpolants, 232440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...