/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:06:18,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:06:18,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:06:18,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:06:18,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:06:18,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:06:18,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:06:18,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:06:18,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:06:18,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:06:18,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:06:18,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:06:18,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:06:18,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:06:18,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:06:18,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:06:18,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:06:18,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:06:18,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:06:18,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:06:18,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:06:18,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:06:18,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:06:18,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:06:18,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:06:18,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:06:18,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:06:18,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:06:18,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:06:18,855 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:06:18,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:06:18,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:06:18,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:06:18,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:06:18,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:06:18,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:06:18,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:06:18,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:06:18,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:06:18,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:06:18,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:06:18,868 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-SemanticLbe.epf [2019-12-27 03:06:18,884 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:06:18,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:06:18,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:06:18,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:06:18,886 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:06:18,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:06:18,886 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:06:18,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:06:18,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:06:18,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:06:18,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:06:18,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:06:18,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:06:18,888 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:06:18,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:06:18,888 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:06:18,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:06:18,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:06:18,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:06:18,889 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:06:18,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:06:18,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:06:18,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:06:18,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:06:18,890 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:06:18,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:06:18,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:06:18,890 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:06:18,890 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:06:19,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:06:19,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:06:19,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:06:19,165 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:06:19,166 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:06:19,166 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc.i [2019-12-27 03:06:19,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fc3af7f/78d1befb40c54913863cbfac4dd036b0/FLAG8087b722c [2019-12-27 03:06:19,823 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:06:19,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc.i [2019-12-27 03:06:19,848 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fc3af7f/78d1befb40c54913863cbfac4dd036b0/FLAG8087b722c [2019-12-27 03:06:20,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32fc3af7f/78d1befb40c54913863cbfac4dd036b0 [2019-12-27 03:06:20,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:06:20,070 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:06:20,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:06:20,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:06:20,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:06:20,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:06:20" (1/1) ... [2019-12-27 03:06:20,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79dc7cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:20, skipping insertion in model container [2019-12-27 03:06:20,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:06:20" (1/1) ... [2019-12-27 03:06:20,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:06:20,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:06:20,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:06:20,683 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:06:20,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:06:20,868 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:06:20,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:20 WrapperNode [2019-12-27 03:06:20,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:06:20,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:06:20,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:06:20,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:06:20,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:20" (1/1) ... [2019-12-27 03:06:20,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:20" (1/1) ... [2019-12-27 03:06:20,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:06:20,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:06:20,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:06:20,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:06:20,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:20" (1/1) ... [2019-12-27 03:06:20,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:20" (1/1) ... [2019-12-27 03:06:20,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:20" (1/1) ... [2019-12-27 03:06:20,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:20" (1/1) ... [2019-12-27 03:06:20,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:20" (1/1) ... [2019-12-27 03:06:20,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:20" (1/1) ... [2019-12-27 03:06:21,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:20" (1/1) ... [2019-12-27 03:06:21,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:06:21,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:06:21,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:06:21,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:06:21,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:20" (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-27 03:06:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:06:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:06:21,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:06:21,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:06:21,102 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:06:21,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:06:21,102 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:06:21,103 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:06:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:06:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:06:21,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:06:21,107 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:06:22,281 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:06:22,281 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:06:22,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:06:22 BoogieIcfgContainer [2019-12-27 03:06:22,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:06:22,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:06:22,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:06:22,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:06:22,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:06:20" (1/3) ... [2019-12-27 03:06:22,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72af4274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:06:22, skipping insertion in model container [2019-12-27 03:06:22,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:06:20" (2/3) ... [2019-12-27 03:06:22,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72af4274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:06:22, skipping insertion in model container [2019-12-27 03:06:22,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:06:22" (3/3) ... [2019-12-27 03:06:22,293 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_tso.oepc.i [2019-12-27 03:06:22,304 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:06:22,304 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:06:22,323 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:06:22,324 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:06:22,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,398 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,412 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,412 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,450 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,451 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,492 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,492 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,503 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,504 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,506 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:06:22,526 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:06:22,549 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:06:22,549 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:06:22,549 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:06:22,549 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:06:22,550 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:06:22,550 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:06:22,550 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:06:22,550 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:06:22,569 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-27 03:06:22,571 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-27 03:06:22,743 INFO L132 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-27 03:06:22,744 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:06:22,779 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 708 event pairs. 0/220 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-27 03:06:22,856 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-27 03:06:22,986 INFO L132 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-27 03:06:22,986 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:06:23,007 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 708 event pairs. 0/220 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-27 03:06:23,057 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 40114 [2019-12-27 03:06:23,058 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:06:29,468 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 03:06:29,637 INFO L206 etLargeBlockEncoding]: Checked pairs total: 232725 [2019-12-27 03:06:29,637 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-27 03:06:29,641 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 184 transitions [2019-12-27 03:06:33,575 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 50078 states. [2019-12-27 03:06:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand 50078 states. [2019-12-27 03:06:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:06:33,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:33,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:06:33,584 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:33,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:33,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1268502306, now seen corresponding path program 1 times [2019-12-27 03:06:33,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:33,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480791391] [2019-12-27 03:06:33,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:33,818 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-27 03:06:33,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480791391] [2019-12-27 03:06:33,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:33,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:06:33,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633127278] [2019-12-27 03:06:33,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:06:33,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:33,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:06:33,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:06:33,843 INFO L87 Difference]: Start difference. First operand 50078 states. Second operand 3 states. [2019-12-27 03:06:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:34,676 INFO L93 Difference]: Finished difference Result 50030 states and 178645 transitions. [2019-12-27 03:06:34,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:06:34,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:06:34,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:35,111 INFO L225 Difference]: With dead ends: 50030 [2019-12-27 03:06:35,111 INFO L226 Difference]: Without dead ends: 49055 [2019-12-27 03:06:35,113 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-27 03:06:37,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49055 states. [2019-12-27 03:06:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49055 to 49055. [2019-12-27 03:06:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49055 states. [2019-12-27 03:06:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49055 states to 49055 states and 175395 transitions. [2019-12-27 03:06:39,183 INFO L78 Accepts]: Start accepts. Automaton has 49055 states and 175395 transitions. Word has length 5 [2019-12-27 03:06:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:39,183 INFO L462 AbstractCegarLoop]: Abstraction has 49055 states and 175395 transitions. [2019-12-27 03:06:39,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:06:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 49055 states and 175395 transitions. [2019-12-27 03:06:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:06:39,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:39,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:39,187 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:39,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:39,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1198055303, now seen corresponding path program 1 times [2019-12-27 03:06:39,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:39,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106052587] [2019-12-27 03:06:39,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:39,322 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-27 03:06:39,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106052587] [2019-12-27 03:06:39,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:39,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:06:39,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121455574] [2019-12-27 03:06:39,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:06:39,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:39,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:06:39,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:06:39,326 INFO L87 Difference]: Start difference. First operand 49055 states and 175395 transitions. Second operand 4 states. [2019-12-27 03:06:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:40,203 INFO L93 Difference]: Finished difference Result 68649 states and 238459 transitions. [2019-12-27 03:06:40,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:06:40,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:06:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:40,546 INFO L225 Difference]: With dead ends: 68649 [2019-12-27 03:06:40,546 INFO L226 Difference]: Without dead ends: 68649 [2019-12-27 03:06:40,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:06:43,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68649 states. [2019-12-27 03:06:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68649 to 68283. [2019-12-27 03:06:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68283 states. [2019-12-27 03:06:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68283 states to 68283 states and 237431 transitions. [2019-12-27 03:06:45,661 INFO L78 Accepts]: Start accepts. Automaton has 68283 states and 237431 transitions. Word has length 11 [2019-12-27 03:06:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:45,662 INFO L462 AbstractCegarLoop]: Abstraction has 68283 states and 237431 transitions. [2019-12-27 03:06:45,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:06:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 68283 states and 237431 transitions. [2019-12-27 03:06:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:06:45,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:45,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:45,672 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:45,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:45,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2038106739, now seen corresponding path program 1 times [2019-12-27 03:06:45,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:45,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068359520] [2019-12-27 03:06:45,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:45,789 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-27 03:06:45,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068359520] [2019-12-27 03:06:45,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:45,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:06:45,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122881230] [2019-12-27 03:06:45,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:06:45,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:45,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:06:45,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:06:45,792 INFO L87 Difference]: Start difference. First operand 68283 states and 237431 transitions. Second operand 4 states. [2019-12-27 03:06:46,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:46,640 INFO L93 Difference]: Finished difference Result 99934 states and 337703 transitions. [2019-12-27 03:06:46,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:06:46,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:06:46,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:49,580 INFO L225 Difference]: With dead ends: 99934 [2019-12-27 03:06:49,580 INFO L226 Difference]: Without dead ends: 99927 [2019-12-27 03:06:49,581 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-27 03:06:50,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99927 states. [2019-12-27 03:06:52,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99927 to 88377. [2019-12-27 03:06:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88377 states. [2019-12-27 03:06:52,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88377 states to 88377 states and 301889 transitions. [2019-12-27 03:06:52,428 INFO L78 Accepts]: Start accepts. Automaton has 88377 states and 301889 transitions. Word has length 11 [2019-12-27 03:06:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:52,428 INFO L462 AbstractCegarLoop]: Abstraction has 88377 states and 301889 transitions. [2019-12-27 03:06:52,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:06:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 88377 states and 301889 transitions. [2019-12-27 03:06:52,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:06:52,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:52,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:06:52,433 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:52,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:52,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1380914162, now seen corresponding path program 1 times [2019-12-27 03:06:52,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:52,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960079796] [2019-12-27 03:06:52,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:52,558 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-27 03:06:52,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960079796] [2019-12-27 03:06:52,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:52,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:06:52,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804702445] [2019-12-27 03:06:52,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:06:52,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:52,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:06:52,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:06:52,562 INFO L87 Difference]: Start difference. First operand 88377 states and 301889 transitions. Second operand 5 states. [2019-12-27 03:06:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:54,350 INFO L93 Difference]: Finished difference Result 116955 states and 392443 transitions. [2019-12-27 03:06:54,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:06:54,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 03:06:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:54,656 INFO L225 Difference]: With dead ends: 116955 [2019-12-27 03:06:54,656 INFO L226 Difference]: Without dead ends: 116948 [2019-12-27 03:06:54,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:06:56,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116948 states. [2019-12-27 03:06:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116948 to 88545. [2019-12-27 03:06:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88545 states. [2019-12-27 03:06:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88545 states to 88545 states and 302245 transitions. [2019-12-27 03:06:59,417 INFO L78 Accepts]: Start accepts. Automaton has 88545 states and 302245 transitions. Word has length 17 [2019-12-27 03:06:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:59,418 INFO L462 AbstractCegarLoop]: Abstraction has 88545 states and 302245 transitions. [2019-12-27 03:06:59,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:06:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 88545 states and 302245 transitions. [2019-12-27 03:06:59,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 03:06:59,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:59,442 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-27 03:06:59,442 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:59,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:59,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1904906828, now seen corresponding path program 1 times [2019-12-27 03:06:59,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:59,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806812295] [2019-12-27 03:06:59,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:59,523 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-27 03:06:59,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806812295] [2019-12-27 03:06:59,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:59,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:06:59,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211038830] [2019-12-27 03:06:59,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:06:59,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:59,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:06:59,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:06:59,526 INFO L87 Difference]: Start difference. First operand 88545 states and 302245 transitions. Second operand 4 states. [2019-12-27 03:06:59,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:59,583 INFO L93 Difference]: Finished difference Result 9568 states and 24288 transitions. [2019-12-27 03:06:59,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:06:59,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 03:06:59,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:59,592 INFO L225 Difference]: With dead ends: 9568 [2019-12-27 03:06:59,592 INFO L226 Difference]: Without dead ends: 7980 [2019-12-27 03:06:59,593 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-27 03:06:59,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-12-27 03:06:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-12-27 03:06:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-12-27 03:06:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 19357 transitions. [2019-12-27 03:06:59,700 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 19357 transitions. Word has length 25 [2019-12-27 03:06:59,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:59,700 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 19357 transitions. [2019-12-27 03:06:59,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:06:59,701 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 19357 transitions. [2019-12-27 03:06:59,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 03:06:59,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:59,706 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] [2019-12-27 03:06:59,706 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:59,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:59,707 INFO L82 PathProgramCache]: Analyzing trace with hash 551296721, now seen corresponding path program 1 times [2019-12-27 03:06:59,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:59,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212822472] [2019-12-27 03:06:59,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:06:59,830 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-27 03:06:59,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212822472] [2019-12-27 03:06:59,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:06:59,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:06:59,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497426171] [2019-12-27 03:06:59,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:06:59,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:06:59,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:06:59,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:06:59,832 INFO L87 Difference]: Start difference. First operand 7980 states and 19357 transitions. Second operand 5 states. [2019-12-27 03:06:59,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:06:59,890 INFO L93 Difference]: Finished difference Result 1856 states and 4027 transitions. [2019-12-27 03:06:59,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:06:59,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 03:06:59,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:06:59,894 INFO L225 Difference]: With dead ends: 1856 [2019-12-27 03:06:59,894 INFO L226 Difference]: Without dead ends: 1686 [2019-12-27 03:06:59,894 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-27 03:06:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2019-12-27 03:06:59,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1616. [2019-12-27 03:06:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2019-12-27 03:06:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 3523 transitions. [2019-12-27 03:06:59,919 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 3523 transitions. Word has length 37 [2019-12-27 03:06:59,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:06:59,919 INFO L462 AbstractCegarLoop]: Abstraction has 1616 states and 3523 transitions. [2019-12-27 03:06:59,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:06:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 3523 transitions. [2019-12-27 03:06:59,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 03:06:59,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:06:59,925 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, 1, 1, 1, 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-27 03:06:59,925 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:06:59,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:06:59,925 INFO L82 PathProgramCache]: Analyzing trace with hash -175598507, now seen corresponding path program 1 times [2019-12-27 03:06:59,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:06:59,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563560988] [2019-12-27 03:06:59,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:06:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:00,072 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-27 03:07:00,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563560988] [2019-12-27 03:07:00,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:00,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:07:00,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126151534] [2019-12-27 03:07:00,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:07:00,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:00,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:07:00,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:07:00,074 INFO L87 Difference]: Start difference. First operand 1616 states and 3523 transitions. Second operand 7 states. [2019-12-27 03:07:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:01,762 INFO L93 Difference]: Finished difference Result 2441 states and 5258 transitions. [2019-12-27 03:07:01,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:07:01,763 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-27 03:07:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:01,766 INFO L225 Difference]: With dead ends: 2441 [2019-12-27 03:07:01,766 INFO L226 Difference]: Without dead ends: 2441 [2019-12-27 03:07:01,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:07:01,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2019-12-27 03:07:01,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 1898. [2019-12-27 03:07:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-12-27 03:07:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 4144 transitions. [2019-12-27 03:07:01,797 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 4144 transitions. Word has length 83 [2019-12-27 03:07:01,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:01,798 INFO L462 AbstractCegarLoop]: Abstraction has 1898 states and 4144 transitions. [2019-12-27 03:07:01,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:07:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 4144 transitions. [2019-12-27 03:07:01,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 03:07:01,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:01,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, 1, 1, 1, 1, 1, 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-27 03:07:01,803 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:01,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:01,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1827081641, now seen corresponding path program 2 times [2019-12-27 03:07:01,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:01,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955726209] [2019-12-27 03:07:01,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:01,971 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-27 03:07:01,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955726209] [2019-12-27 03:07:01,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:01,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:07:01,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881017608] [2019-12-27 03:07:01,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:07:01,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:01,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:07:01,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:07:01,975 INFO L87 Difference]: Start difference. First operand 1898 states and 4144 transitions. Second operand 6 states. [2019-12-27 03:07:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:02,908 INFO L93 Difference]: Finished difference Result 2323 states and 5011 transitions. [2019-12-27 03:07:02,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:07:02,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-27 03:07:02,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:02,914 INFO L225 Difference]: With dead ends: 2323 [2019-12-27 03:07:02,914 INFO L226 Difference]: Without dead ends: 2323 [2019-12-27 03:07:02,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:07:02,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2019-12-27 03:07:02,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2003. [2019-12-27 03:07:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2003 states. [2019-12-27 03:07:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2003 states to 2003 states and 4360 transitions. [2019-12-27 03:07:02,935 INFO L78 Accepts]: Start accepts. Automaton has 2003 states and 4360 transitions. Word has length 83 [2019-12-27 03:07:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:02,935 INFO L462 AbstractCegarLoop]: Abstraction has 2003 states and 4360 transitions. [2019-12-27 03:07:02,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:07:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2003 states and 4360 transitions. [2019-12-27 03:07:02,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 03:07:02,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:02,939 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, 1, 1, 1, 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-27 03:07:02,940 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:02,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:02,940 INFO L82 PathProgramCache]: Analyzing trace with hash 219474423, now seen corresponding path program 3 times [2019-12-27 03:07:02,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:02,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379670805] [2019-12-27 03:07:02,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:03,084 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-27 03:07:03,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379670805] [2019-12-27 03:07:03,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:03,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:07:03,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873000711] [2019-12-27 03:07:03,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:07:03,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:03,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:07:03,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:07:03,086 INFO L87 Difference]: Start difference. First operand 2003 states and 4360 transitions. Second operand 5 states. [2019-12-27 03:07:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:03,397 INFO L93 Difference]: Finished difference Result 2156 states and 4640 transitions. [2019-12-27 03:07:03,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:07:03,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-27 03:07:03,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:03,402 INFO L225 Difference]: With dead ends: 2156 [2019-12-27 03:07:03,402 INFO L226 Difference]: Without dead ends: 2156 [2019-12-27 03:07:03,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:07:03,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2019-12-27 03:07:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2045. [2019-12-27 03:07:03,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-27 03:07:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4445 transitions. [2019-12-27 03:07:03,422 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4445 transitions. Word has length 83 [2019-12-27 03:07:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:03,422 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4445 transitions. [2019-12-27 03:07:03,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:07:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4445 transitions. [2019-12-27 03:07:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 03:07:03,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:03,427 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, 1, 1, 1, 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-27 03:07:03,427 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:03,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:03,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1940404291, now seen corresponding path program 4 times [2019-12-27 03:07:03,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:03,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946952499] [2019-12-27 03:07:03,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:03,656 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-27 03:07:03,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946952499] [2019-12-27 03:07:03,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:03,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:07:03,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130169752] [2019-12-27 03:07:03,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:07:03,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:03,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:07:03,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:07:03,658 INFO L87 Difference]: Start difference. First operand 2045 states and 4445 transitions. Second operand 10 states. [2019-12-27 03:07:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:04,989 INFO L93 Difference]: Finished difference Result 3563 states and 7629 transitions. [2019-12-27 03:07:04,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:07:04,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2019-12-27 03:07:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:04,994 INFO L225 Difference]: With dead ends: 3563 [2019-12-27 03:07:04,995 INFO L226 Difference]: Without dead ends: 3563 [2019-12-27 03:07:04,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:07:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2019-12-27 03:07:05,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 2337. [2019-12-27 03:07:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-12-27 03:07:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 5075 transitions. [2019-12-27 03:07:05,024 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 5075 transitions. Word has length 83 [2019-12-27 03:07:05,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:05,025 INFO L462 AbstractCegarLoop]: Abstraction has 2337 states and 5075 transitions. [2019-12-27 03:07:05,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:07:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 5075 transitions. [2019-12-27 03:07:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 03:07:05,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:05,028 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, 1, 1, 1, 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-27 03:07:05,029 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:05,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:05,029 INFO L82 PathProgramCache]: Analyzing trace with hash 22757597, now seen corresponding path program 5 times [2019-12-27 03:07:05,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:05,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434449597] [2019-12-27 03:07:05,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:05,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-27 03:07:05,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434449597] [2019-12-27 03:07:05,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:05,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:07:05,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910041784] [2019-12-27 03:07:05,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:07:05,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:05,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:07:05,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:07:05,220 INFO L87 Difference]: Start difference. First operand 2337 states and 5075 transitions. Second operand 7 states. [2019-12-27 03:07:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:06,380 INFO L93 Difference]: Finished difference Result 4515 states and 9687 transitions. [2019-12-27 03:07:06,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:07:06,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-27 03:07:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:06,387 INFO L225 Difference]: With dead ends: 4515 [2019-12-27 03:07:06,387 INFO L226 Difference]: Without dead ends: 4515 [2019-12-27 03:07:06,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:07:06,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2019-12-27 03:07:06,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 2472. [2019-12-27 03:07:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-12-27 03:07:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 5399 transitions. [2019-12-27 03:07:06,419 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 5399 transitions. Word has length 83 [2019-12-27 03:07:06,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:06,420 INFO L462 AbstractCegarLoop]: Abstraction has 2472 states and 5399 transitions. [2019-12-27 03:07:06,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:07:06,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 5399 transitions. [2019-12-27 03:07:06,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 03:07:06,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:06,423 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, 1, 1, 1, 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-27 03:07:06,423 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:06,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:06,424 INFO L82 PathProgramCache]: Analyzing trace with hash 617305587, now seen corresponding path program 6 times [2019-12-27 03:07:06,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:06,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921147589] [2019-12-27 03:07:06,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:06,552 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-27 03:07:06,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921147589] [2019-12-27 03:07:06,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:06,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:07:06,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065934853] [2019-12-27 03:07:06,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:07:06,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:06,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:07:06,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:07:06,554 INFO L87 Difference]: Start difference. First operand 2472 states and 5399 transitions. Second operand 7 states. [2019-12-27 03:07:07,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:07,582 INFO L93 Difference]: Finished difference Result 4559 states and 9873 transitions. [2019-12-27 03:07:07,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:07:07,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-27 03:07:07,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:07,589 INFO L225 Difference]: With dead ends: 4559 [2019-12-27 03:07:07,589 INFO L226 Difference]: Without dead ends: 4559 [2019-12-27 03:07:07,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 03:07:07,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4559 states. [2019-12-27 03:07:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4559 to 2443. [2019-12-27 03:07:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2443 states. [2019-12-27 03:07:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 5341 transitions. [2019-12-27 03:07:07,629 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 5341 transitions. Word has length 83 [2019-12-27 03:07:07,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:07,630 INFO L462 AbstractCegarLoop]: Abstraction has 2443 states and 5341 transitions. [2019-12-27 03:07:07,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:07:07,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 5341 transitions. [2019-12-27 03:07:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 03:07:07,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:07,634 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, 1, 1, 1, 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-27 03:07:07,634 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:07,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:07,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1177358919, now seen corresponding path program 7 times [2019-12-27 03:07:07,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:07,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772295587] [2019-12-27 03:07:07,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:07,698 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-27 03:07:07,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772295587] [2019-12-27 03:07:07,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:07,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:07:07,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282271155] [2019-12-27 03:07:07,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:07:07,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:07,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:07:07,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:07:07,701 INFO L87 Difference]: Start difference. First operand 2443 states and 5341 transitions. Second operand 4 states. [2019-12-27 03:07:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:08,048 INFO L93 Difference]: Finished difference Result 3291 states and 7209 transitions. [2019-12-27 03:07:08,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:07:08,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-27 03:07:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:08,053 INFO L225 Difference]: With dead ends: 3291 [2019-12-27 03:07:08,053 INFO L226 Difference]: Without dead ends: 3291 [2019-12-27 03:07:08,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:07:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3291 states. [2019-12-27 03:07:08,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3291 to 2538. [2019-12-27 03:07:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2538 states. [2019-12-27 03:07:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 5496 transitions. [2019-12-27 03:07:08,089 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 5496 transitions. Word has length 83 [2019-12-27 03:07:08,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:08,089 INFO L462 AbstractCegarLoop]: Abstraction has 2538 states and 5496 transitions. [2019-12-27 03:07:08,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:07:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 5496 transitions. [2019-12-27 03:07:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 03:07:08,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:08,095 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, 1, 1, 1, 1, 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-27 03:07:08,095 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:08,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:08,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1104508352, now seen corresponding path program 1 times [2019-12-27 03:07:08,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:08,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337219087] [2019-12-27 03:07:08,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:08,324 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-27 03:07:08,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337219087] [2019-12-27 03:07:08,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:08,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:07:08,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161288582] [2019-12-27 03:07:08,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:07:08,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:08,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:07:08,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:07:08,327 INFO L87 Difference]: Start difference. First operand 2538 states and 5496 transitions. Second operand 10 states. [2019-12-27 03:07:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:10,295 INFO L93 Difference]: Finished difference Result 3916 states and 8288 transitions. [2019-12-27 03:07:10,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:07:10,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-12-27 03:07:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:10,302 INFO L225 Difference]: With dead ends: 3916 [2019-12-27 03:07:10,303 INFO L226 Difference]: Without dead ends: 3916 [2019-12-27 03:07:10,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:07:10,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2019-12-27 03:07:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 2928. [2019-12-27 03:07:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2019-12-27 03:07:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 6315 transitions. [2019-12-27 03:07:10,369 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 6315 transitions. Word has length 84 [2019-12-27 03:07:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:10,369 INFO L462 AbstractCegarLoop]: Abstraction has 2928 states and 6315 transitions. [2019-12-27 03:07:10,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:07:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 6315 transitions. [2019-12-27 03:07:10,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 03:07:10,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:10,378 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, 1, 1, 1, 1, 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-27 03:07:10,378 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:10,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:10,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1945768030, now seen corresponding path program 1 times [2019-12-27 03:07:10,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:10,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020167337] [2019-12-27 03:07:10,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:10,561 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-27 03:07:10,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020167337] [2019-12-27 03:07:10,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:10,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:07:10,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305491240] [2019-12-27 03:07:10,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:07:10,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:10,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:07:10,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:07:10,564 INFO L87 Difference]: Start difference. First operand 2928 states and 6315 transitions. Second operand 6 states. [2019-12-27 03:07:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:11,269 INFO L93 Difference]: Finished difference Result 3753 states and 7941 transitions. [2019-12-27 03:07:11,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:07:11,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-12-27 03:07:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:11,275 INFO L225 Difference]: With dead ends: 3753 [2019-12-27 03:07:11,276 INFO L226 Difference]: Without dead ends: 3753 [2019-12-27 03:07:11,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:07:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2019-12-27 03:07:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 2934. [2019-12-27 03:07:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2934 states. [2019-12-27 03:07:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 6326 transitions. [2019-12-27 03:07:11,330 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 6326 transitions. Word has length 84 [2019-12-27 03:07:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:11,331 INFO L462 AbstractCegarLoop]: Abstraction has 2934 states and 6326 transitions. [2019-12-27 03:07:11,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:07:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 6326 transitions. [2019-12-27 03:07:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 03:07:11,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:11,337 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, 1, 1, 1, 1, 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-27 03:07:11,337 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:11,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:11,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2000095982, now seen corresponding path program 2 times [2019-12-27 03:07:11,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:11,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585761165] [2019-12-27 03:07:11,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:11,574 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-27 03:07:11,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585761165] [2019-12-27 03:07:11,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:11,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 03:07:11,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074590669] [2019-12-27 03:07:11,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 03:07:11,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:11,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 03:07:11,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:07:11,578 INFO L87 Difference]: Start difference. First operand 2934 states and 6326 transitions. Second operand 10 states. [2019-12-27 03:07:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:13,158 INFO L93 Difference]: Finished difference Result 3849 states and 8194 transitions. [2019-12-27 03:07:13,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:07:13,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-12-27 03:07:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:13,164 INFO L225 Difference]: With dead ends: 3849 [2019-12-27 03:07:13,164 INFO L226 Difference]: Without dead ends: 3849 [2019-12-27 03:07:13,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:07:13,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2019-12-27 03:07:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 2968. [2019-12-27 03:07:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2968 states. [2019-12-27 03:07:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 6400 transitions. [2019-12-27 03:07:13,195 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 6400 transitions. Word has length 84 [2019-12-27 03:07:13,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:13,196 INFO L462 AbstractCegarLoop]: Abstraction has 2968 states and 6400 transitions. [2019-12-27 03:07:13,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 03:07:13,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 6400 transitions. [2019-12-27 03:07:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 03:07:13,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:13,215 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, 1, 1, 1, 1, 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-27 03:07:13,215 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:13,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:13,216 INFO L82 PathProgramCache]: Analyzing trace with hash 955066454, now seen corresponding path program 2 times [2019-12-27 03:07:13,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:13,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561958915] [2019-12-27 03:07:13,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:13,421 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-27 03:07:13,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561958915] [2019-12-27 03:07:13,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:13,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 03:07:13,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835886249] [2019-12-27 03:07:13,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:07:13,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:13,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:07:13,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:07:13,424 INFO L87 Difference]: Start difference. First operand 2968 states and 6400 transitions. Second operand 11 states. [2019-12-27 03:07:15,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:15,148 INFO L93 Difference]: Finished difference Result 5221 states and 11276 transitions. [2019-12-27 03:07:15,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 03:07:15,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2019-12-27 03:07:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:15,155 INFO L225 Difference]: With dead ends: 5221 [2019-12-27 03:07:15,155 INFO L226 Difference]: Without dead ends: 5221 [2019-12-27 03:07:15,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-27 03:07:15,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5221 states. [2019-12-27 03:07:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5221 to 2966. [2019-12-27 03:07:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2966 states. [2019-12-27 03:07:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 6396 transitions. [2019-12-27 03:07:15,212 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 6396 transitions. Word has length 84 [2019-12-27 03:07:15,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:15,213 INFO L462 AbstractCegarLoop]: Abstraction has 2966 states and 6396 transitions. [2019-12-27 03:07:15,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:07:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 6396 transitions. [2019-12-27 03:07:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 03:07:15,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:15,219 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, 1, 1, 1, 1, 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-27 03:07:15,219 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:15,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:15,219 INFO L82 PathProgramCache]: Analyzing trace with hash -601195506, now seen corresponding path program 3 times [2019-12-27 03:07:15,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:15,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353641490] [2019-12-27 03:07:15,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:15,273 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-27 03:07:15,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353641490] [2019-12-27 03:07:15,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:15,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:07:15,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324367736] [2019-12-27 03:07:15,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:07:15,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:15,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:07:15,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:07:15,277 INFO L87 Difference]: Start difference. First operand 2966 states and 6396 transitions. Second operand 3 states. [2019-12-27 03:07:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:15,293 INFO L93 Difference]: Finished difference Result 2116 states and 4424 transitions. [2019-12-27 03:07:15,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:07:15,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-12-27 03:07:15,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:15,296 INFO L225 Difference]: With dead ends: 2116 [2019-12-27 03:07:15,296 INFO L226 Difference]: Without dead ends: 2116 [2019-12-27 03:07:15,297 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-27 03:07:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2019-12-27 03:07:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 2116. [2019-12-27 03:07:15,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2116 states. [2019-12-27 03:07:15,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 4424 transitions. [2019-12-27 03:07:15,321 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 4424 transitions. Word has length 84 [2019-12-27 03:07:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:15,321 INFO L462 AbstractCegarLoop]: Abstraction has 2116 states and 4424 transitions. [2019-12-27 03:07:15,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:07:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 4424 transitions. [2019-12-27 03:07:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 03:07:15,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:15,324 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, 1, 1, 1, 1, 1, 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-27 03:07:15,324 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:15,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:15,324 INFO L82 PathProgramCache]: Analyzing trace with hash -255334761, now seen corresponding path program 1 times [2019-12-27 03:07:15,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:15,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834351167] [2019-12-27 03:07:15,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:15,483 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-27 03:07:15,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834351167] [2019-12-27 03:07:15,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:15,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:07:15,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324581925] [2019-12-27 03:07:15,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:07:15,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:15,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:07:15,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:07:15,485 INFO L87 Difference]: Start difference. First operand 2116 states and 4424 transitions. Second operand 8 states. [2019-12-27 03:07:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:16,666 INFO L93 Difference]: Finished difference Result 4337 states and 9086 transitions. [2019-12-27 03:07:16,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 03:07:16,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-12-27 03:07:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:16,672 INFO L225 Difference]: With dead ends: 4337 [2019-12-27 03:07:16,672 INFO L226 Difference]: Without dead ends: 4337 [2019-12-27 03:07:16,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:07:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4337 states. [2019-12-27 03:07:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4337 to 2849. [2019-12-27 03:07:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2849 states. [2019-12-27 03:07:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 6048 transitions. [2019-12-27 03:07:16,706 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 6048 transitions. Word has length 85 [2019-12-27 03:07:16,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:16,706 INFO L462 AbstractCegarLoop]: Abstraction has 2849 states and 6048 transitions. [2019-12-27 03:07:16,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:07:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 6048 transitions. [2019-12-27 03:07:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 03:07:16,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:16,710 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, 1, 1, 1, 1, 1, 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-27 03:07:16,710 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:16,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:16,711 INFO L82 PathProgramCache]: Analyzing trace with hash 710647719, now seen corresponding path program 2 times [2019-12-27 03:07:16,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:16,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84109978] [2019-12-27 03:07:16,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:16,847 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-27 03:07:16,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84109978] [2019-12-27 03:07:16,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:16,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:07:16,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505821959] [2019-12-27 03:07:16,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:07:16,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:16,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:07:16,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:07:16,850 INFO L87 Difference]: Start difference. First operand 2849 states and 6048 transitions. Second operand 9 states. [2019-12-27 03:07:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:17,206 INFO L93 Difference]: Finished difference Result 4093 states and 8641 transitions. [2019-12-27 03:07:17,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:07:17,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-12-27 03:07:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:17,213 INFO L225 Difference]: With dead ends: 4093 [2019-12-27 03:07:17,213 INFO L226 Difference]: Without dead ends: 4061 [2019-12-27 03:07:17,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:07:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4061 states. [2019-12-27 03:07:17,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4061 to 3691. [2019-12-27 03:07:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3691 states. [2019-12-27 03:07:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 7909 transitions. [2019-12-27 03:07:17,297 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 7909 transitions. Word has length 85 [2019-12-27 03:07:17,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:17,298 INFO L462 AbstractCegarLoop]: Abstraction has 3691 states and 7909 transitions. [2019-12-27 03:07:17,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:07:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 7909 transitions. [2019-12-27 03:07:17,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 03:07:17,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:17,308 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, 1, 1, 1, 1, 1, 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-27 03:07:17,308 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:17,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:17,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1761939513, now seen corresponding path program 1 times [2019-12-27 03:07:17,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:17,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829272079] [2019-12-27 03:07:17,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:17,556 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-27 03:07:17,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829272079] [2019-12-27 03:07:17,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:17,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 03:07:17,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299703117] [2019-12-27 03:07:17,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 03:07:17,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:17,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 03:07:17,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:07:17,558 INFO L87 Difference]: Start difference. First operand 3691 states and 7909 transitions. Second operand 11 states. [2019-12-27 03:07:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:18,345 INFO L93 Difference]: Finished difference Result 7775 states and 16753 transitions. [2019-12-27 03:07:18,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 03:07:18,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2019-12-27 03:07:18,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:18,353 INFO L225 Difference]: With dead ends: 7775 [2019-12-27 03:07:18,353 INFO L226 Difference]: Without dead ends: 4984 [2019-12-27 03:07:18,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2019-12-27 03:07:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4984 states. [2019-12-27 03:07:18,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4984 to 3739. [2019-12-27 03:07:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2019-12-27 03:07:18,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 7987 transitions. [2019-12-27 03:07:18,470 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 7987 transitions. Word has length 85 [2019-12-27 03:07:18,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:18,470 INFO L462 AbstractCegarLoop]: Abstraction has 3739 states and 7987 transitions. [2019-12-27 03:07:18,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 03:07:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 7987 transitions. [2019-12-27 03:07:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 03:07:18,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:18,478 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, 1, 1, 1, 1, 1, 1, 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-27 03:07:18,478 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:18,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:18,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1370724916, now seen corresponding path program 1 times [2019-12-27 03:07:18,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:18,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249308924] [2019-12-27 03:07:18,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:18,772 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-27 03:07:18,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249308924] [2019-12-27 03:07:18,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:18,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 03:07:18,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113853797] [2019-12-27 03:07:18,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 03:07:18,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:18,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 03:07:18,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:07:18,776 INFO L87 Difference]: Start difference. First operand 3739 states and 7987 transitions. Second operand 14 states. [2019-12-27 03:07:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:19,737 INFO L93 Difference]: Finished difference Result 4682 states and 9790 transitions. [2019-12-27 03:07:19,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 03:07:19,738 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2019-12-27 03:07:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:19,744 INFO L225 Difference]: With dead ends: 4682 [2019-12-27 03:07:19,744 INFO L226 Difference]: Without dead ends: 4578 [2019-12-27 03:07:19,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2019-12-27 03:07:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2019-12-27 03:07:19,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 3079. [2019-12-27 03:07:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3079 states. [2019-12-27 03:07:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 3079 states and 6628 transitions. [2019-12-27 03:07:19,781 INFO L78 Accepts]: Start accepts. Automaton has 3079 states and 6628 transitions. Word has length 86 [2019-12-27 03:07:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:19,782 INFO L462 AbstractCegarLoop]: Abstraction has 3079 states and 6628 transitions. [2019-12-27 03:07:19,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 03:07:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 6628 transitions. [2019-12-27 03:07:19,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 03:07:19,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:19,786 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, 1, 1, 1, 1, 1, 1, 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-27 03:07:19,786 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:19,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1543760090, now seen corresponding path program 2 times [2019-12-27 03:07:19,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:19,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034835074] [2019-12-27 03:07:19,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:20,260 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-27 03:07:20,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034835074] [2019-12-27 03:07:20,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:20,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 03:07:20,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263995356] [2019-12-27 03:07:20,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 03:07:20,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:20,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 03:07:20,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 03:07:20,270 INFO L87 Difference]: Start difference. First operand 3079 states and 6628 transitions. Second operand 16 states. [2019-12-27 03:07:22,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:22,470 INFO L93 Difference]: Finished difference Result 5225 states and 11399 transitions. [2019-12-27 03:07:22,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 03:07:22,471 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2019-12-27 03:07:22,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:22,478 INFO L225 Difference]: With dead ends: 5225 [2019-12-27 03:07:22,478 INFO L226 Difference]: Without dead ends: 5191 [2019-12-27 03:07:22,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=1116, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 03:07:22,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5191 states. [2019-12-27 03:07:22,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5191 to 3161. [2019-12-27 03:07:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3161 states. [2019-12-27 03:07:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 6812 transitions. [2019-12-27 03:07:22,513 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 6812 transitions. Word has length 86 [2019-12-27 03:07:22,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:22,513 INFO L462 AbstractCegarLoop]: Abstraction has 3161 states and 6812 transitions. [2019-12-27 03:07:22,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 03:07:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 6812 transitions. [2019-12-27 03:07:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 03:07:22,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:22,518 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, 1, 1, 1, 1, 1, 1, 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-27 03:07:22,518 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:22,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:22,518 INFO L82 PathProgramCache]: Analyzing trace with hash 713036948, now seen corresponding path program 3 times [2019-12-27 03:07:22,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:22,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594111745] [2019-12-27 03:07:22,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:22,597 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-27 03:07:22,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594111745] [2019-12-27 03:07:22,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:22,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:07:22,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392672961] [2019-12-27 03:07:22,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:07:22,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:22,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:07:22,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:07:22,599 INFO L87 Difference]: Start difference. First operand 3161 states and 6812 transitions. Second operand 5 states. [2019-12-27 03:07:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:22,927 INFO L93 Difference]: Finished difference Result 4538 states and 9799 transitions. [2019-12-27 03:07:22,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:07:22,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-12-27 03:07:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:22,933 INFO L225 Difference]: With dead ends: 4538 [2019-12-27 03:07:22,933 INFO L226 Difference]: Without dead ends: 4538 [2019-12-27 03:07:22,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:07:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4538 states. [2019-12-27 03:07:22,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4538 to 3662. [2019-12-27 03:07:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3662 states. [2019-12-27 03:07:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 7898 transitions. [2019-12-27 03:07:22,973 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 7898 transitions. Word has length 86 [2019-12-27 03:07:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:22,973 INFO L462 AbstractCegarLoop]: Abstraction has 3662 states and 7898 transitions. [2019-12-27 03:07:22,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:07:22,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 7898 transitions. [2019-12-27 03:07:22,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 03:07:22,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:22,979 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, 1, 1, 1, 1, 1, 1, 1, 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-27 03:07:22,979 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:22,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:22,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1563899026, now seen corresponding path program 1 times [2019-12-27 03:07:22,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:22,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979393973] [2019-12-27 03:07:22,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:23,074 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-27 03:07:23,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979393973] [2019-12-27 03:07:23,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:23,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:07:23,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110924154] [2019-12-27 03:07:23,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:07:23,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:23,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:07:23,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:07:23,076 INFO L87 Difference]: Start difference. First operand 3662 states and 7898 transitions. Second operand 6 states. [2019-12-27 03:07:23,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:23,410 INFO L93 Difference]: Finished difference Result 3926 states and 8350 transitions. [2019-12-27 03:07:23,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:07:23,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2019-12-27 03:07:23,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:23,416 INFO L225 Difference]: With dead ends: 3926 [2019-12-27 03:07:23,416 INFO L226 Difference]: Without dead ends: 3815 [2019-12-27 03:07:23,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:07:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2019-12-27 03:07:23,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 3633. [2019-12-27 03:07:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3633 states. [2019-12-27 03:07:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 7826 transitions. [2019-12-27 03:07:23,452 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 7826 transitions. Word has length 87 [2019-12-27 03:07:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:23,452 INFO L462 AbstractCegarLoop]: Abstraction has 3633 states and 7826 transitions. [2019-12-27 03:07:23,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:07:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 7826 transitions. [2019-12-27 03:07:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 03:07:23,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:23,456 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, 1, 1, 1, 1, 1, 1, 1, 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-27 03:07:23,456 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:23,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:23,456 INFO L82 PathProgramCache]: Analyzing trace with hash -126478383, now seen corresponding path program 1 times [2019-12-27 03:07:23,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:23,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033363342] [2019-12-27 03:07:23,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:07:23,663 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-27 03:07:23,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033363342] [2019-12-27 03:07:23,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:07:23,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:07:23,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95826741] [2019-12-27 03:07:23,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:07:23,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:07:23,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:07:23,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:07:23,665 INFO L87 Difference]: Start difference. First operand 3633 states and 7826 transitions. Second operand 9 states. [2019-12-27 03:07:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:07:24,602 INFO L93 Difference]: Finished difference Result 5764 states and 12352 transitions. [2019-12-27 03:07:24,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 03:07:24,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-12-27 03:07:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:07:24,609 INFO L225 Difference]: With dead ends: 5764 [2019-12-27 03:07:24,610 INFO L226 Difference]: Without dead ends: 5701 [2019-12-27 03:07:24,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:07:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2019-12-27 03:07:24,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 3857. [2019-12-27 03:07:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3857 states. [2019-12-27 03:07:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3857 states to 3857 states and 8311 transitions. [2019-12-27 03:07:24,652 INFO L78 Accepts]: Start accepts. Automaton has 3857 states and 8311 transitions. Word has length 87 [2019-12-27 03:07:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:07:24,653 INFO L462 AbstractCegarLoop]: Abstraction has 3857 states and 8311 transitions. [2019-12-27 03:07:24,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:07:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3857 states and 8311 transitions. [2019-12-27 03:07:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 03:07:24,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:07:24,656 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, 1, 1, 1, 1, 1, 1, 1, 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-27 03:07:24,656 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:07:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:07:24,657 INFO L82 PathProgramCache]: Analyzing trace with hash -766393236, now seen corresponding path program 1 times [2019-12-27 03:07:24,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:07:24,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636022853] [2019-12-27 03:07:24,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:07:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:07:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:07:24,836 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:07:24,837 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:07:24,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1305] [1305] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1597~0.base_28|) (= 0 v_~__unbuffered_p1_EAX~0_80) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1597~0.base_28| 4) |v_#length_17|) (= v_~y$r_buff1_thd1~0_174 0) (= 0 |v_ULTIMATE.start_main_~#t1597~0.offset_20|) (= v_~y$r_buff0_thd0~0_406 0) (= 0 v_~y$w_buff0~0_222) (= v_~y~0_511 0) (= 0 v_~y$r_buff0_thd2~0_640) (= v_~main$tmp_guard0~0_27 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_28|)) (= 0 v_~weak$$choice0~0_258) (= v_~y$mem_tmp~0_281 0) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_621 0) (= v_~x~0_48 0) (= 0 v_~y$r_buff1_thd2~0_481) (= v_~__unbuffered_p1_EBX~0_44 0) (= v_~y$flush_delayed~0_437 0) (= v_~weak$$choice2~0_358 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_28| 1)) (= v_~y$r_buff0_thd1~0_95 0) (= |v_#NULL.offset_5| 0) (= 0 v_~__unbuffered_cnt~0_58) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1597~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1597~0.base_28|) |v_ULTIMATE.start_main_~#t1597~0.offset_20| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_395 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff0_used~0_1083 0) (= v_~y$w_buff1~0_235 0) (= 0 |v_#NULL.base_5|) (= 0 v_~main$tmp_guard1~0_116) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1597~0.offset=|v_ULTIMATE.start_main_~#t1597~0.offset_20|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_200|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_296|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_37|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_172|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_26|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_63|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_46|, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_80, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_49|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_95, ~y$flush_delayed~0=v_~y$flush_delayed~0_437, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_17|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_121|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_86|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_100|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_27|, ~weak$$choice0~0=v_~weak$$choice0~0_258, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_45|, ~y$w_buff1~0=v_~y$w_buff1~0_235, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_130|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_640, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_395, ~x~0=v_~x~0_48, ULTIMATE.start_main_~#t1597~0.base=|v_ULTIMATE.start_main_~#t1597~0.base_28|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1083, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_116, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_34|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_46|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_42|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_36|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_174, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_48|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_259|, ~y$w_buff0~0=v_~y$w_buff0~0_222, ~y~0=v_~y~0_511, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_172|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_118|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_81|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_481, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_72|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_190|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_406, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_358, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_15|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_621} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1597~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1597~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ULTIMATE.start_main_~#t1598~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1598~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:07:24,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1266] [1266] L813-1-->L815: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1598~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1598~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13|) |v_ULTIMATE.start_main_~#t1598~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13| 1) |v_#valid_27|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1598~0.base, #length, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t1598~0.offset] because there is no mapped edge [2019-12-27 03:07:24,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L4-->L762: Formula: (and (= v_~y$r_buff0_thd2~0_126 v_~y$r_buff1_thd2~0_73) (= 1 v_~y$r_buff0_thd2~0_125) (= v_~y~0_65 v_~y$mem_tmp~0_35) (= v_~weak$$choice2~0_74 v_~y$flush_delayed~0_44) (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_11) (= v_~weak$$choice2~0_74 |v_P1Thread1of1ForFork1_#t~nondet10_8|) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_~weak$$choice0~0_30 |v_P1Thread1of1ForFork1_#t~nondet9_8|) (= v_~y$r_buff0_thd0~0_77 v_~y$r_buff1_thd0~0_69)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_8|, ~y~0=v_~y~0_65, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_8|} OutVars{P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_73, P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~weak$$choice0~0=v_~weak$$choice0~0_30, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_35, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~y~0=v_~y~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_69, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet9, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~nondet10] because there is no mapped edge [2019-12-27 03:07:24,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L762-2-->L762-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-823047085 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-823047085 256) 0))) (or (and (= ~y$w_buff0~0_In-823047085 |P1Thread1of1ForFork1_#t~ite11_Out-823047085|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff1~0_In-823047085 |P1Thread1of1ForFork1_#t~ite11_Out-823047085|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-823047085, ~y$w_buff1~0=~y$w_buff1~0_In-823047085, ~y$w_buff0~0=~y$w_buff0~0_In-823047085, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-823047085} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-823047085, ~y$w_buff1~0=~y$w_buff1~0_In-823047085, ~y$w_buff0~0=~y$w_buff0~0_In-823047085, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-823047085, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-823047085|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 03:07:24,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L762-4-->L763: Formula: (= v_~y~0_45 |v_P1Thread1of1ForFork1_#t~ite11_10|) InVars {P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_10|} OutVars{P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_9|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_13|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12, ~y~0] because there is no mapped edge [2019-12-27 03:07:24,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1206] [1206] L767-->L768: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_173 256))) (= v_~y$r_buff0_thd2~0_264 v_~y$r_buff0_thd2~0_263)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_264, ~weak$$choice2~0=v_~weak$$choice2~0_173} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_263, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_173, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 03:07:24,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1880228293 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out1880228293| ~y$mem_tmp~0_In1880228293) (not .cse0)) (and .cse0 (= ~y~0_In1880228293 |P1Thread1of1ForFork1_#t~ite31_Out1880228293|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1880228293, ~y$flush_delayed~0=~y$flush_delayed~0_In1880228293, ~y~0=~y~0_In1880228293} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1880228293, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1880228293|, ~y$flush_delayed~0=~y$flush_delayed~0_In1880228293, ~y~0=~y~0_In1880228293} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 03:07:24,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L730-2-->L730-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd1~0_In-961988852 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-961988852 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-961988852| |P0Thread1of1ForFork0_#t~ite3_Out-961988852|))) (or (and (not .cse0) (= ~y$w_buff1~0_In-961988852 |P0Thread1of1ForFork0_#t~ite3_Out-961988852|) (not .cse1) .cse2) (and (= ~y~0_In-961988852 |P0Thread1of1ForFork0_#t~ite3_Out-961988852|) (or .cse1 .cse0) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-961988852, ~y$w_buff1~0=~y$w_buff1~0_In-961988852, ~y~0=~y~0_In-961988852, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-961988852} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-961988852, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-961988852|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-961988852|, ~y$w_buff1~0=~y$w_buff1~0_In-961988852, ~y~0=~y~0_In-961988852, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-961988852} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 03:07:24,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1248] [1248] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2119859872 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2119859872 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-2119859872| ~y$w_buff1~0_In-2119859872)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-2119859872| ~y$w_buff0~0_In-2119859872) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2119859872, ~y$w_buff1~0=~y$w_buff1~0_In-2119859872, ~y$w_buff0~0=~y$w_buff0~0_In-2119859872, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2119859872} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2119859872, ~y$w_buff1~0=~y$w_buff1~0_In-2119859872, ~y$w_buff0~0=~y$w_buff0~0_In-2119859872, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2119859872, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2119859872|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 03:07:24,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L778-4-->L779: Formula: (= v_~y~0_81 |v_P1Thread1of1ForFork1_#t~ite34_8|) InVars {P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_8|} OutVars{P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_7|, P1Thread1of1ForFork1_#t~ite35=|v_P1Thread1of1ForFork1_#t~ite35_7|, ~y~0=v_~y~0_81} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34, P1Thread1of1ForFork1_#t~ite35, ~y~0] because there is no mapped edge [2019-12-27 03:07:24,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1197] [1197] L783-->L784: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_143 256))) (= v_~y$r_buff0_thd2~0_220 v_~y$r_buff0_thd2~0_219)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_220, ~weak$$choice2~0=v_~weak$$choice2~0_143} OutVars{P1Thread1of1ForFork1_#t~ite50=|v_P1Thread1of1ForFork1_#t~ite50_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_219, ~weak$$choice2~0=v_~weak$$choice2~0_143, P1Thread1of1ForFork1_#t~ite49=|v_P1Thread1of1ForFork1_#t~ite49_11|, P1Thread1of1ForFork1_#t~ite48=|v_P1Thread1of1ForFork1_#t~ite48_8|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite50, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite49, P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 03:07:24,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1232] [1232] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1004276097 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out-1004276097| ~y~0_In-1004276097)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite54_Out-1004276097| ~y$mem_tmp~0_In-1004276097)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1004276097, ~y$flush_delayed~0=~y$flush_delayed~0_In-1004276097, ~y~0=~y~0_In-1004276097} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1004276097, ~y$flush_delayed~0=~y$flush_delayed~0_In-1004276097, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1004276097|, ~y~0=~y~0_In-1004276097} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 03:07:24,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1455360366 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1455360366 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1455360366| ~y$w_buff0_used~0_In1455360366) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1455360366|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1455360366, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1455360366} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1455360366|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1455360366, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1455360366} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:07:24,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L732-->L732-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1308747981 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1308747981 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In1308747981 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1308747981 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1308747981 |P0Thread1of1ForFork0_#t~ite6_Out1308747981|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out1308747981| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1308747981, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1308747981, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1308747981, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1308747981} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1308747981|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1308747981, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1308747981, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1308747981, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1308747981} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:07:24,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1290098148 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1290098148 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1290098148|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1290098148 |P0Thread1of1ForFork0_#t~ite7_Out1290098148|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1290098148, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1290098148} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1290098148, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1290098148|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1290098148} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 03:07:24,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1250] [1250] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1235136793 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1235136793 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1235136793 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1235136793 256)))) (or (and (= ~y$r_buff1_thd1~0_In1235136793 |P0Thread1of1ForFork0_#t~ite8_Out1235136793|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1235136793|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1235136793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1235136793, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1235136793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1235136793} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1235136793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1235136793, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1235136793|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1235136793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1235136793} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:07:24,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1267] [1267] L734-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_32|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 03:07:24,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1247] [1247] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In17295442 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In17295442 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite57_Out17295442|)) (and (= ~y$w_buff0_used~0_In17295442 |P1Thread1of1ForFork1_#t~ite57_Out17295442|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In17295442, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In17295442} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In17295442, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In17295442, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out17295442|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-27 03:07:24,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1251] [1251] L792-->L792-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In545126717 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In545126717 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In545126717 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In545126717 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In545126717 |P1Thread1of1ForFork1_#t~ite58_Out545126717|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite58_Out545126717|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In545126717, ~y$w_buff0_used~0=~y$w_buff0_used~0_In545126717, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In545126717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In545126717} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In545126717, ~y$w_buff0_used~0=~y$w_buff0_used~0_In545126717, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In545126717, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out545126717|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In545126717} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-27 03:07:24,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L793-->L794: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1033259600 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1033259600 256)))) (or (and (= ~y$r_buff0_thd2~0_Out-1033259600 ~y$r_buff0_thd2~0_In-1033259600) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd2~0_Out-1033259600 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1033259600, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1033259600} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1033259600, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1033259600, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out-1033259600|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-27 03:07:24,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1242] [1242] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1544774 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1544774 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1544774 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1544774 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out-1544774| ~y$r_buff1_thd2~0_In-1544774) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite60_Out-1544774| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1544774, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1544774, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1544774, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1544774} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1544774, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1544774, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out-1544774|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1544774, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1544774} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-27 03:07:24,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1280] [1280] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= v_~y$r_buff1_thd2~0_339 |v_P1Thread1of1ForFork1_#t~ite60_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_339, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 03:07:24,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L819-->L821-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~y$w_buff0_used~0_258 256) 0) (= (mod v_~y$r_buff0_thd0~0_91 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_91, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 03:07:24,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1241] [1241] L821-2-->L821-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1390089705 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1390089705 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-1390089705 |ULTIMATE.start_main_#t~ite63_Out-1390089705|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out-1390089705| ~y$w_buff1~0_In-1390089705) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1390089705, ~y~0=~y~0_In-1390089705, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1390089705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1390089705} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1390089705|, ~y$w_buff1~0=~y$w_buff1~0_In-1390089705, ~y~0=~y~0_In-1390089705, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1390089705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1390089705} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 03:07:24,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1184] [1184] L821-4-->L822: Formula: (= v_~y~0_114 |v_ULTIMATE.start_main_#t~ite63_12|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 03:07:24,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In808542617 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In808542617 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite65_Out808542617| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite65_Out808542617| ~y$w_buff0_used~0_In808542617) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In808542617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In808542617} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In808542617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In808542617, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out808542617|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-27 03:07:24,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1215] [1215] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1467760305 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1467760305 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1467760305 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1467760305 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out-1467760305| ~y$w_buff1_used~0_In-1467760305)) (and (= |ULTIMATE.start_main_#t~ite66_Out-1467760305| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1467760305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1467760305, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1467760305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1467760305} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1467760305, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1467760305, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-1467760305|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1467760305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1467760305} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-27 03:07:24,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-2114015511 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2114015511 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite67_Out-2114015511|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-2114015511 |ULTIMATE.start_main_#t~ite67_Out-2114015511|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2114015511, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2114015511} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2114015511, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2114015511, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-2114015511|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-27 03:07:24,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1221] [1221] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1675910844 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1675910844 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1675910844 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1675910844 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out1675910844| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite68_Out1675910844| ~y$r_buff1_thd0~0_In1675910844)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1675910844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1675910844, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1675910844, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1675910844} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1675910844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1675910844, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1675910844|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1675910844, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1675910844} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 03:07:24,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1222] [1222] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1090540920 256)))) (or (and (= |ULTIMATE.start_main_#t~ite91_Out-1090540920| ~y$mem_tmp~0_In-1090540920) (not .cse0)) (and .cse0 (= |ULTIMATE.start_main_#t~ite91_Out-1090540920| ~y~0_In-1090540920)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1090540920, ~y$flush_delayed~0=~y$flush_delayed~0_In-1090540920, ~y~0=~y~0_In-1090540920} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1090540920, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out-1090540920|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1090540920, ~y~0=~y~0_In-1090540920} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-27 03:07:24,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1290] [1290] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$flush_delayed~0_287 0) (= v_~y~0_301 |v_ULTIMATE.start_main_#t~ite91_55|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= (mod v_~main$tmp_guard1~0_31 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_26 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_55|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_26, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_54|, ~y$flush_delayed~0=v_~y$flush_delayed~0_287, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y~0=v_~y~0_301, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:07:25,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:07:25 BasicIcfg [2019-12-27 03:07:25,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:07:25,038 INFO L168 Benchmark]: Toolchain (without parser) took 64968.78 ms. Allocated memory was 137.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 101.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 570.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:07:25,039 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 03:07:25,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.55 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.0 MB in the beginning and 154.0 MB in the end (delta: -53.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:07:25,040 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.82 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 149.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:07:25,040 INFO L168 Benchmark]: Boogie Preprocessor took 66.58 ms. Allocated memory is still 201.9 MB. Free memory was 149.9 MB in the beginning and 147.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 03:07:25,041 INFO L168 Benchmark]: RCFGBuilder took 1255.43 ms. Allocated memory was 201.9 MB in the beginning and 234.4 MB in the end (delta: 32.5 MB). Free memory was 146.4 MB in the beginning and 195.0 MB in the end (delta: -48.6 MB). Peak memory consumption was 66.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:07:25,042 INFO L168 Benchmark]: TraceAbstraction took 62751.71 ms. Allocated memory was 234.4 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 195.0 MB in the beginning and 1.2 GB in the end (delta: -983.3 MB). Peak memory consumption was 567.5 MB. Max. memory is 7.1 GB. [2019-12-27 03:07:25,045 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.23 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 798.55 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.0 MB in the beginning and 154.0 MB in the end (delta: -53.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 90.82 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 149.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.58 ms. Allocated memory is still 201.9 MB. Free memory was 149.9 MB in the beginning and 147.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1255.43 ms. Allocated memory was 201.9 MB in the beginning and 234.4 MB in the end (delta: 32.5 MB). Free memory was 146.4 MB in the beginning and 195.0 MB in the end (delta: -48.6 MB). Peak memory consumption was 66.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62751.71 ms. Allocated memory was 234.4 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 195.0 MB in the beginning and 1.2 GB in the end (delta: -983.3 MB). Peak memory consumption was 567.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.0s, 231 ProgramPointsBefore, 147 ProgramPointsAfterwards, 307 TransitionsBefore, 184 TransitionsAfterwards, 40114 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 42 ChoiceCompositions, 15276 VarBasedMoverChecksPositive, 410 VarBasedMoverChecksNegative, 97 SemBasedMoverChecksPositive, 446 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 0 MoverChecksTotal, 232725 CheckedPairsTotal, 139 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 2 x = 2 [L747] 2 y$w_buff1 = y$w_buff0 [L748] 2 y$w_buff0 = 1 [L749] 2 y$w_buff1_used = y$w_buff0_used [L750] 2 y$w_buff0_used = (_Bool)1 [L762] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L730] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 62.2s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 28.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8388 SDtfs, 10901 SDslu, 28851 SDs, 0 SdLazy, 17091 SolverSat, 651 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 74 SyntacticMatches, 51 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88545occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 61978 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1881 NumberOfCodeBlocks, 1881 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 585247 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...