/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe026_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:03:42,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:03:42,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:03:42,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:03:42,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:03:42,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:03:42,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:03:42,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:03:42,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:03:42,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:03:42,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:03:42,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:03:42,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:03:42,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:03:42,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:03:42,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:03:42,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:03:42,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:03:42,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:03:42,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:03:42,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:03:42,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:03:42,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:03:42,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:03:42,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:03:42,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:03:42,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:03:42,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:03:42,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:03:42,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:03:42,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:03:42,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:03:42,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:03:42,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:03:42,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:03:42,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:03:42,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:03:42,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:03:42,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:03:42,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:03:42,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:03:42,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:03:42,760 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:03:42,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:03:42,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:03:42,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:03:42,763 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:03:42,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:03:42,764 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:03:42,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:03:42,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:03:42,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:03:42,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:03:42,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:03:42,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:03:42,765 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:03:42,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:03:42,765 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:03:42,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:03:42,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:03:42,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:03:42,766 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:03:42,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:03:42,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:03:42,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:03:42,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:03:42,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:03:42,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:03:42,768 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:03:42,768 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:03:42,768 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:03:42,768 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:03:43,044 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:03:43,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:03:43,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:03:43,070 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:03:43,071 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:03:43,072 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_rmo.opt.i [2019-12-18 15:03:43,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8036f616f/0ba566cc9d134881a43dfd1db9123971/FLAG6b191540e [2019-12-18 15:03:43,740 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:03:43,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_rmo.opt.i [2019-12-18 15:03:43,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8036f616f/0ba566cc9d134881a43dfd1db9123971/FLAG6b191540e [2019-12-18 15:03:44,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8036f616f/0ba566cc9d134881a43dfd1db9123971 [2019-12-18 15:03:44,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:03:44,067 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:03:44,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:03:44,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:03:44,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:03:44,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:03:44" (1/1) ... [2019-12-18 15:03:44,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f98591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:03:44, skipping insertion in model container [2019-12-18 15:03:44,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:03:44" (1/1) ... [2019-12-18 15:03:44,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:03:44,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:03:44,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:03:44,703 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:03:44,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:03:44,888 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:03:44,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:03:44 WrapperNode [2019-12-18 15:03:44,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:03:44,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:03:44,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:03:44,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:03:44,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:03:44" (1/1) ... [2019-12-18 15:03:44,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:03:44" (1/1) ... [2019-12-18 15:03:44,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:03:44,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:03:44,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:03:44,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:03:44,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:03:44" (1/1) ... [2019-12-18 15:03:44,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:03:44" (1/1) ... [2019-12-18 15:03:44,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:03:44" (1/1) ... [2019-12-18 15:03:44,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:03:44" (1/1) ... [2019-12-18 15:03:44,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:03:44" (1/1) ... [2019-12-18 15:03:44,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:03:44" (1/1) ... [2019-12-18 15:03:44,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:03:44" (1/1) ... [2019-12-18 15:03:44,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:03:44,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:03:44,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:03:44,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:03:44,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:03:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:03:45,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:03:45,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:03:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:03:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:03:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:03:45,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:03:45,060 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:03:45,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:03:45,061 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 15:03:45,061 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 15:03:45,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:03:45,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:03:45,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:03:45,064 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:03:45,830 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:03:45,831 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:03:45,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:03:45 BoogieIcfgContainer [2019-12-18 15:03:45,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:03:45,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:03:45,835 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:03:45,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:03:45,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:03:44" (1/3) ... [2019-12-18 15:03:45,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e32153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:03:45, skipping insertion in model container [2019-12-18 15:03:45,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:03:44" (2/3) ... [2019-12-18 15:03:45,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e32153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:03:45, skipping insertion in model container [2019-12-18 15:03:45,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:03:45" (3/3) ... [2019-12-18 15:03:45,847 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_rmo.opt.i [2019-12-18 15:03:45,855 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:03:45,855 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:03:45,862 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:03:45,863 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:03:45,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,913 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,913 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,927 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,927 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,946 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,947 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,965 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,967 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,968 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:45,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,016 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,020 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,024 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,026 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,030 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:03:46,045 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 15:03:46,065 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:03:46,065 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:03:46,065 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:03:46,065 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:03:46,065 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:03:46,066 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:03:46,066 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:03:46,066 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:03:46,081 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 15:03:46,082 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 15:03:46,172 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 15:03:46,172 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:03:46,197 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 15:03:46,224 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 15:03:46,289 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 15:03:46,289 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:03:46,297 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 15:03:46,318 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 15:03:46,319 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:03:46,970 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-12-18 15:03:51,371 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 15:03:51,483 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 15:03:51,851 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 15:03:51,975 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78269 [2019-12-18 15:03:51,976 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 15:03:51,979 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-18 15:04:08,983 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-18 15:04:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-18 15:04:08,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 15:04:08,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:04:08,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 15:04:08,991 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:04:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:04:08,996 INFO L82 PathProgramCache]: Analyzing trace with hash 909914, now seen corresponding path program 1 times [2019-12-18 15:04:09,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:04:09,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403985379] [2019-12-18 15:04:09,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:04:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:04:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:04:09,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403985379] [2019-12-18 15:04:09,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:04:09,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:04:09,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860961725] [2019-12-18 15:04:09,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:04:09,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:04:09,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:04:09,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:04:09,292 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-18 15:04:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:04:10,785 INFO L93 Difference]: Finished difference Result 108680 states and 463562 transitions. [2019-12-18 15:04:10,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:04:10,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 15:04:10,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:04:11,417 INFO L225 Difference]: With dead ends: 108680 [2019-12-18 15:04:11,417 INFO L226 Difference]: Without dead ends: 102440 [2019-12-18 15:04:11,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:04:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102440 states. [2019-12-18 15:04:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102440 to 102440. [2019-12-18 15:04:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102440 states. [2019-12-18 15:04:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102440 states to 102440 states and 436366 transitions. [2019-12-18 15:04:21,318 INFO L78 Accepts]: Start accepts. Automaton has 102440 states and 436366 transitions. Word has length 3 [2019-12-18 15:04:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:04:21,318 INFO L462 AbstractCegarLoop]: Abstraction has 102440 states and 436366 transitions. [2019-12-18 15:04:21,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:04:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 102440 states and 436366 transitions. [2019-12-18 15:04:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 15:04:21,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:04:21,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:04:21,324 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:04:21,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:04:21,324 INFO L82 PathProgramCache]: Analyzing trace with hash -975068220, now seen corresponding path program 1 times [2019-12-18 15:04:21,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:04:21,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183687996] [2019-12-18 15:04:21,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:04:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:04:21,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:04:21,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183687996] [2019-12-18 15:04:21,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:04:21,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:04:21,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239052001] [2019-12-18 15:04:21,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:04:21,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:04:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:04:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:04:21,460 INFO L87 Difference]: Start difference. First operand 102440 states and 436366 transitions. Second operand 4 states. [2019-12-18 15:04:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:04:26,568 INFO L93 Difference]: Finished difference Result 163248 states and 665679 transitions. [2019-12-18 15:04:26,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:04:26,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 15:04:26,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:04:27,203 INFO L225 Difference]: With dead ends: 163248 [2019-12-18 15:04:27,204 INFO L226 Difference]: Without dead ends: 163199 [2019-12-18 15:04:27,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:04:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163199 states. [2019-12-18 15:04:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163199 to 148639. [2019-12-18 15:04:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148639 states. [2019-12-18 15:04:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148639 states to 148639 states and 614105 transitions. [2019-12-18 15:04:39,085 INFO L78 Accepts]: Start accepts. Automaton has 148639 states and 614105 transitions. Word has length 11 [2019-12-18 15:04:39,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:04:39,086 INFO L462 AbstractCegarLoop]: Abstraction has 148639 states and 614105 transitions. [2019-12-18 15:04:39,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:04:39,086 INFO L276 IsEmpty]: Start isEmpty. Operand 148639 states and 614105 transitions. [2019-12-18 15:04:39,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:04:39,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:04:39,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:04:39,092 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:04:39,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:04:39,093 INFO L82 PathProgramCache]: Analyzing trace with hash -112330344, now seen corresponding path program 1 times [2019-12-18 15:04:39,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:04:39,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232225147] [2019-12-18 15:04:39,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:04:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:04:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:04:39,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232225147] [2019-12-18 15:04:39,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:04:39,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:04:39,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522150512] [2019-12-18 15:04:39,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:04:39,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:04:39,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:04:39,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:04:39,201 INFO L87 Difference]: Start difference. First operand 148639 states and 614105 transitions. Second operand 4 states. [2019-12-18 15:04:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:04:40,524 INFO L93 Difference]: Finished difference Result 208779 states and 842772 transitions. [2019-12-18 15:04:40,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:04:40,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 15:04:40,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:04:47,795 INFO L225 Difference]: With dead ends: 208779 [2019-12-18 15:04:47,795 INFO L226 Difference]: Without dead ends: 208723 [2019-12-18 15:04:47,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:04:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208723 states. [2019-12-18 15:04:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208723 to 175996. [2019-12-18 15:04:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175996 states. [2019-12-18 15:04:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175996 states to 175996 states and 723083 transitions. [2019-12-18 15:04:56,451 INFO L78 Accepts]: Start accepts. Automaton has 175996 states and 723083 transitions. Word has length 13 [2019-12-18 15:04:56,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:04:56,452 INFO L462 AbstractCegarLoop]: Abstraction has 175996 states and 723083 transitions. [2019-12-18 15:04:56,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:04:56,452 INFO L276 IsEmpty]: Start isEmpty. Operand 175996 states and 723083 transitions. [2019-12-18 15:04:56,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 15:04:56,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:04:56,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:04:56,462 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:04:56,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:04:56,462 INFO L82 PathProgramCache]: Analyzing trace with hash -790185689, now seen corresponding path program 1 times [2019-12-18 15:04:56,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:04:56,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97838552] [2019-12-18 15:04:56,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:04:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:04:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:04:56,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97838552] [2019-12-18 15:04:56,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:04:56,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:04:56,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491271161] [2019-12-18 15:04:56,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:04:56,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:04:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:04:56,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:04:56,586 INFO L87 Difference]: Start difference. First operand 175996 states and 723083 transitions. Second operand 5 states. [2019-12-18 15:05:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:05:04,660 INFO L93 Difference]: Finished difference Result 234922 states and 955485 transitions. [2019-12-18 15:05:04,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:05:04,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 15:05:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:05:05,382 INFO L225 Difference]: With dead ends: 234922 [2019-12-18 15:05:05,382 INFO L226 Difference]: Without dead ends: 234922 [2019-12-18 15:05:05,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:05:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234922 states. [2019-12-18 15:05:14,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234922 to 195490. [2019-12-18 15:05:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195490 states. [2019-12-18 15:05:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195490 states to 195490 states and 801473 transitions. [2019-12-18 15:05:16,808 INFO L78 Accepts]: Start accepts. Automaton has 195490 states and 801473 transitions. Word has length 16 [2019-12-18 15:05:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:05:16,809 INFO L462 AbstractCegarLoop]: Abstraction has 195490 states and 801473 transitions. [2019-12-18 15:05:16,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:05:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 195490 states and 801473 transitions. [2019-12-18 15:05:16,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:05:16,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:05:16,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:05:16,826 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:05:16,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:05:16,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1153162558, now seen corresponding path program 1 times [2019-12-18 15:05:16,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:05:16,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364511069] [2019-12-18 15:05:16,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:05:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:05:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:05:16,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364511069] [2019-12-18 15:05:16,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:05:16,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:05:16,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628493174] [2019-12-18 15:05:16,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:05:16,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:05:16,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:05:16,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:05:16,882 INFO L87 Difference]: Start difference. First operand 195490 states and 801473 transitions. Second operand 3 states. [2019-12-18 15:05:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:05:17,808 INFO L93 Difference]: Finished difference Result 195126 states and 800046 transitions. [2019-12-18 15:05:17,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:05:17,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 15:05:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:05:26,234 INFO L225 Difference]: With dead ends: 195126 [2019-12-18 15:05:26,234 INFO L226 Difference]: Without dead ends: 195126 [2019-12-18 15:05:26,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:05:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195126 states. [2019-12-18 15:05:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195126 to 195126. [2019-12-18 15:05:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195126 states. [2019-12-18 15:05:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195126 states to 195126 states and 800046 transitions. [2019-12-18 15:05:35,159 INFO L78 Accepts]: Start accepts. Automaton has 195126 states and 800046 transitions. Word has length 18 [2019-12-18 15:05:35,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:05:35,160 INFO L462 AbstractCegarLoop]: Abstraction has 195126 states and 800046 transitions. [2019-12-18 15:05:35,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:05:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand 195126 states and 800046 transitions. [2019-12-18 15:05:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:05:35,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:05:35,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:05:35,177 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:05:35,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:05:35,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1951188865, now seen corresponding path program 1 times [2019-12-18 15:05:35,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:05:35,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469576393] [2019-12-18 15:05:35,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:05:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:05:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:05:35,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469576393] [2019-12-18 15:05:35,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:05:35,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:05:35,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378898046] [2019-12-18 15:05:35,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:05:35,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:05:35,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:05:35,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:05:35,252 INFO L87 Difference]: Start difference. First operand 195126 states and 800046 transitions. Second operand 4 states. [2019-12-18 15:05:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:05:43,773 INFO L93 Difference]: Finished difference Result 367409 states and 1507754 transitions. [2019-12-18 15:05:43,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:05:43,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 15:05:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:05:44,428 INFO L225 Difference]: With dead ends: 367409 [2019-12-18 15:05:44,428 INFO L226 Difference]: Without dead ends: 208324 [2019-12-18 15:05:44,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:05:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208324 states. [2019-12-18 15:05:58,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208324 to 206903. [2019-12-18 15:05:58,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206903 states. [2019-12-18 15:05:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206903 states to 206903 states and 837795 transitions. [2019-12-18 15:05:58,735 INFO L78 Accepts]: Start accepts. Automaton has 206903 states and 837795 transitions. Word has length 19 [2019-12-18 15:05:58,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:05:58,735 INFO L462 AbstractCegarLoop]: Abstraction has 206903 states and 837795 transitions. [2019-12-18 15:05:58,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:05:58,735 INFO L276 IsEmpty]: Start isEmpty. Operand 206903 states and 837795 transitions. [2019-12-18 15:05:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:05:58,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:05:58,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:05:58,753 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:05:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:05:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2060703810, now seen corresponding path program 1 times [2019-12-18 15:05:58,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:05:58,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754824370] [2019-12-18 15:05:58,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:05:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:05:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:05:58,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754824370] [2019-12-18 15:05:58,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:05:58,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:05:58,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500181701] [2019-12-18 15:05:58,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:05:58,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:05:58,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:05:58,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:05:58,852 INFO L87 Difference]: Start difference. First operand 206903 states and 837795 transitions. Second operand 4 states. [2019-12-18 15:06:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:04,282 INFO L93 Difference]: Finished difference Result 53084 states and 178612 transitions. [2019-12-18 15:06:04,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:06:04,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 15:06:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:04,358 INFO L225 Difference]: With dead ends: 53084 [2019-12-18 15:06:04,359 INFO L226 Difference]: Without dead ends: 41205 [2019-12-18 15:06:04,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:06:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41205 states. [2019-12-18 15:06:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41205 to 40210. [2019-12-18 15:06:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40210 states. [2019-12-18 15:06:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40210 states to 40210 states and 128989 transitions. [2019-12-18 15:06:05,028 INFO L78 Accepts]: Start accepts. Automaton has 40210 states and 128989 transitions. Word has length 19 [2019-12-18 15:06:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:05,028 INFO L462 AbstractCegarLoop]: Abstraction has 40210 states and 128989 transitions. [2019-12-18 15:06:05,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:06:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 40210 states and 128989 transitions. [2019-12-18 15:06:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:06:05,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:05,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:06:05,035 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:05,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:05,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2079194331, now seen corresponding path program 1 times [2019-12-18 15:06:05,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:05,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333090767] [2019-12-18 15:06:05,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:05,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333090767] [2019-12-18 15:06:05,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:05,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:06:05,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815636960] [2019-12-18 15:06:05,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:06:05,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:05,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:06:05,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:06:05,116 INFO L87 Difference]: Start difference. First operand 40210 states and 128989 transitions. Second operand 6 states. [2019-12-18 15:06:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:06,075 INFO L93 Difference]: Finished difference Result 60602 states and 188612 transitions. [2019-12-18 15:06:06,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:06:06,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 15:06:06,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:06,176 INFO L225 Difference]: With dead ends: 60602 [2019-12-18 15:06:06,176 INFO L226 Difference]: Without dead ends: 60504 [2019-12-18 15:06:06,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:06:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60504 states. [2019-12-18 15:06:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60504 to 40348. [2019-12-18 15:06:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40348 states. [2019-12-18 15:06:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40348 states to 40348 states and 128423 transitions. [2019-12-18 15:06:07,336 INFO L78 Accepts]: Start accepts. Automaton has 40348 states and 128423 transitions. Word has length 22 [2019-12-18 15:06:07,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:07,336 INFO L462 AbstractCegarLoop]: Abstraction has 40348 states and 128423 transitions. [2019-12-18 15:06:07,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:06:07,336 INFO L276 IsEmpty]: Start isEmpty. Operand 40348 states and 128423 transitions. [2019-12-18 15:06:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:06:07,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:07,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:06:07,346 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:07,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:07,347 INFO L82 PathProgramCache]: Analyzing trace with hash -356343789, now seen corresponding path program 1 times [2019-12-18 15:06:07,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:07,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247823996] [2019-12-18 15:06:07,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:07,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247823996] [2019-12-18 15:06:07,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:07,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:06:07,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192119625] [2019-12-18 15:06:07,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:06:07,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:07,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:06:07,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:06:07,418 INFO L87 Difference]: Start difference. First operand 40348 states and 128423 transitions. Second operand 5 states. [2019-12-18 15:06:07,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:07,969 INFO L93 Difference]: Finished difference Result 56186 states and 174944 transitions. [2019-12-18 15:06:07,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:06:07,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 15:06:07,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:08,063 INFO L225 Difference]: With dead ends: 56186 [2019-12-18 15:06:08,063 INFO L226 Difference]: Without dead ends: 55974 [2019-12-18 15:06:08,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:06:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55974 states. [2019-12-18 15:06:09,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55974 to 47425. [2019-12-18 15:06:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47425 states. [2019-12-18 15:06:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47425 states to 47425 states and 150377 transitions. [2019-12-18 15:06:09,308 INFO L78 Accepts]: Start accepts. Automaton has 47425 states and 150377 transitions. Word has length 25 [2019-12-18 15:06:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:09,308 INFO L462 AbstractCegarLoop]: Abstraction has 47425 states and 150377 transitions. [2019-12-18 15:06:09,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:06:09,309 INFO L276 IsEmpty]: Start isEmpty. Operand 47425 states and 150377 transitions. [2019-12-18 15:06:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:06:09,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:09,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] [2019-12-18 15:06:09,324 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:09,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1041381309, now seen corresponding path program 1 times [2019-12-18 15:06:09,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:09,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649618827] [2019-12-18 15:06:09,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:09,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649618827] [2019-12-18 15:06:09,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:09,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:06:09,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139836430] [2019-12-18 15:06:09,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:06:09,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:09,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:06:09,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:06:09,408 INFO L87 Difference]: Start difference. First operand 47425 states and 150377 transitions. Second operand 6 states. [2019-12-18 15:06:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:10,156 INFO L93 Difference]: Finished difference Result 66982 states and 207084 transitions. [2019-12-18 15:06:10,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:06:10,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 15:06:10,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:10,267 INFO L225 Difference]: With dead ends: 66982 [2019-12-18 15:06:10,267 INFO L226 Difference]: Without dead ends: 66389 [2019-12-18 15:06:10,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:06:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66389 states. [2019-12-18 15:06:11,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66389 to 52066. [2019-12-18 15:06:11,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52066 states. [2019-12-18 15:06:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52066 states to 52066 states and 164051 transitions. [2019-12-18 15:06:11,532 INFO L78 Accepts]: Start accepts. Automaton has 52066 states and 164051 transitions. Word has length 27 [2019-12-18 15:06:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:11,533 INFO L462 AbstractCegarLoop]: Abstraction has 52066 states and 164051 transitions. [2019-12-18 15:06:11,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:06:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 52066 states and 164051 transitions. [2019-12-18 15:06:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 15:06:11,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:11,551 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] [2019-12-18 15:06:11,552 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:11,552 INFO L82 PathProgramCache]: Analyzing trace with hash -524022794, now seen corresponding path program 1 times [2019-12-18 15:06:11,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:11,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191252590] [2019-12-18 15:06:11,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:11,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191252590] [2019-12-18 15:06:11,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:11,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:06:11,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621780997] [2019-12-18 15:06:11,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:06:11,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:11,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:06:11,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:06:11,603 INFO L87 Difference]: Start difference. First operand 52066 states and 164051 transitions. Second operand 4 states. [2019-12-18 15:06:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:11,976 INFO L93 Difference]: Finished difference Result 118270 states and 380880 transitions. [2019-12-18 15:06:11,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:06:11,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-18 15:06:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:12,025 INFO L225 Difference]: With dead ends: 118270 [2019-12-18 15:06:12,025 INFO L226 Difference]: Without dead ends: 28049 [2019-12-18 15:06:12,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:06:12,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28049 states. [2019-12-18 15:06:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28049 to 27357. [2019-12-18 15:06:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27357 states. [2019-12-18 15:06:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27357 states to 27357 states and 84690 transitions. [2019-12-18 15:06:12,907 INFO L78 Accepts]: Start accepts. Automaton has 27357 states and 84690 transitions. Word has length 29 [2019-12-18 15:06:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:12,907 INFO L462 AbstractCegarLoop]: Abstraction has 27357 states and 84690 transitions. [2019-12-18 15:06:12,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:06:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 27357 states and 84690 transitions. [2019-12-18 15:06:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:06:12,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:12,921 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] [2019-12-18 15:06:12,921 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:12,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:12,921 INFO L82 PathProgramCache]: Analyzing trace with hash -116284186, now seen corresponding path program 1 times [2019-12-18 15:06:12,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:12,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233765028] [2019-12-18 15:06:12,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:13,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233765028] [2019-12-18 15:06:13,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:13,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:06:13,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181984202] [2019-12-18 15:06:13,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:06:13,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:13,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:06:13,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:06:13,010 INFO L87 Difference]: Start difference. First operand 27357 states and 84690 transitions. Second operand 5 states. [2019-12-18 15:06:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:13,717 INFO L93 Difference]: Finished difference Result 41160 states and 127027 transitions. [2019-12-18 15:06:13,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:06:13,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 15:06:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:13,786 INFO L225 Difference]: With dead ends: 41160 [2019-12-18 15:06:13,787 INFO L226 Difference]: Without dead ends: 41160 [2019-12-18 15:06:13,787 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-18 15:06:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41160 states. [2019-12-18 15:06:14,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41160 to 36991. [2019-12-18 15:06:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36991 states. [2019-12-18 15:06:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36991 states to 36991 states and 114873 transitions. [2019-12-18 15:06:14,411 INFO L78 Accepts]: Start accepts. Automaton has 36991 states and 114873 transitions. Word has length 30 [2019-12-18 15:06:14,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:14,411 INFO L462 AbstractCegarLoop]: Abstraction has 36991 states and 114873 transitions. [2019-12-18 15:06:14,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:06:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 36991 states and 114873 transitions. [2019-12-18 15:06:14,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:06:14,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:14,429 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] [2019-12-18 15:06:14,429 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:14,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:14,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1132903455, now seen corresponding path program 1 times [2019-12-18 15:06:14,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:14,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966295177] [2019-12-18 15:06:14,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:14,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966295177] [2019-12-18 15:06:14,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:14,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:06:14,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893521364] [2019-12-18 15:06:14,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:06:14,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:14,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:06:14,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:06:14,511 INFO L87 Difference]: Start difference. First operand 36991 states and 114873 transitions. Second operand 5 states. [2019-12-18 15:06:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:15,414 INFO L93 Difference]: Finished difference Result 53889 states and 165459 transitions. [2019-12-18 15:06:15,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:06:15,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 15:06:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:15,502 INFO L225 Difference]: With dead ends: 53889 [2019-12-18 15:06:15,502 INFO L226 Difference]: Without dead ends: 53840 [2019-12-18 15:06:15,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:06:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53840 states. [2019-12-18 15:06:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53840 to 44806. [2019-12-18 15:06:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44806 states. [2019-12-18 15:06:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44806 states to 44806 states and 139518 transitions. [2019-12-18 15:06:16,274 INFO L78 Accepts]: Start accepts. Automaton has 44806 states and 139518 transitions. Word has length 30 [2019-12-18 15:06:16,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:16,274 INFO L462 AbstractCegarLoop]: Abstraction has 44806 states and 139518 transitions. [2019-12-18 15:06:16,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:06:16,274 INFO L276 IsEmpty]: Start isEmpty. Operand 44806 states and 139518 transitions. [2019-12-18 15:06:16,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 15:06:16,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:16,297 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] [2019-12-18 15:06:16,297 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:16,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1026319235, now seen corresponding path program 1 times [2019-12-18 15:06:16,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:16,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478437660] [2019-12-18 15:06:16,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:16,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478437660] [2019-12-18 15:06:16,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:16,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:06:16,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590075943] [2019-12-18 15:06:16,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:06:16,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:16,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:06:16,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:06:16,381 INFO L87 Difference]: Start difference. First operand 44806 states and 139518 transitions. Second operand 5 states. [2019-12-18 15:06:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:16,530 INFO L93 Difference]: Finished difference Result 21943 states and 64706 transitions. [2019-12-18 15:06:16,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:06:16,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-18 15:06:16,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:16,569 INFO L225 Difference]: With dead ends: 21943 [2019-12-18 15:06:16,570 INFO L226 Difference]: Without dead ends: 19299 [2019-12-18 15:06:16,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:06:16,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19299 states. [2019-12-18 15:06:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19299 to 18143. [2019-12-18 15:06:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18143 states. [2019-12-18 15:06:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18143 states to 18143 states and 53716 transitions. [2019-12-18 15:06:17,125 INFO L78 Accepts]: Start accepts. Automaton has 18143 states and 53716 transitions. Word has length 31 [2019-12-18 15:06:17,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:17,125 INFO L462 AbstractCegarLoop]: Abstraction has 18143 states and 53716 transitions. [2019-12-18 15:06:17,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:06:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 18143 states and 53716 transitions. [2019-12-18 15:06:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 15:06:17,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:17,141 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] [2019-12-18 15:06:17,141 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:17,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1993081713, now seen corresponding path program 1 times [2019-12-18 15:06:17,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:17,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552980512] [2019-12-18 15:06:17,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:17,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552980512] [2019-12-18 15:06:17,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:17,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:06:17,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173522312] [2019-12-18 15:06:17,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:06:17,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:17,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:06:17,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:06:17,232 INFO L87 Difference]: Start difference. First operand 18143 states and 53716 transitions. Second operand 7 states. [2019-12-18 15:06:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:18,199 INFO L93 Difference]: Finished difference Result 19608 states and 56880 transitions. [2019-12-18 15:06:18,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:06:18,200 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 15:06:18,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:18,236 INFO L225 Difference]: With dead ends: 19608 [2019-12-18 15:06:18,236 INFO L226 Difference]: Without dead ends: 18921 [2019-12-18 15:06:18,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:06:18,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18921 states. [2019-12-18 15:06:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18921 to 17152. [2019-12-18 15:06:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17152 states. [2019-12-18 15:06:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17152 states to 17152 states and 50369 transitions. [2019-12-18 15:06:18,502 INFO L78 Accepts]: Start accepts. Automaton has 17152 states and 50369 transitions. Word has length 33 [2019-12-18 15:06:18,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:18,502 INFO L462 AbstractCegarLoop]: Abstraction has 17152 states and 50369 transitions. [2019-12-18 15:06:18,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:06:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 17152 states and 50369 transitions. [2019-12-18 15:06:18,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 15:06:18,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:18,525 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] [2019-12-18 15:06:18,525 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:18,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:18,525 INFO L82 PathProgramCache]: Analyzing trace with hash -739159160, now seen corresponding path program 1 times [2019-12-18 15:06:18,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:18,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792109306] [2019-12-18 15:06:18,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:18,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792109306] [2019-12-18 15:06:18,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:18,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:06:18,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794109805] [2019-12-18 15:06:18,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:06:18,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:18,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:06:18,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:06:18,634 INFO L87 Difference]: Start difference. First operand 17152 states and 50369 transitions. Second operand 6 states. [2019-12-18 15:06:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:19,622 INFO L93 Difference]: Finished difference Result 22796 states and 65727 transitions. [2019-12-18 15:06:19,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:06:19,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 15:06:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:19,664 INFO L225 Difference]: With dead ends: 22796 [2019-12-18 15:06:19,665 INFO L226 Difference]: Without dead ends: 22796 [2019-12-18 15:06:19,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:06:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22796 states. [2019-12-18 15:06:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22796 to 17194. [2019-12-18 15:06:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17194 states. [2019-12-18 15:06:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17194 states to 17194 states and 50488 transitions. [2019-12-18 15:06:19,951 INFO L78 Accepts]: Start accepts. Automaton has 17194 states and 50488 transitions. Word has length 40 [2019-12-18 15:06:19,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:19,951 INFO L462 AbstractCegarLoop]: Abstraction has 17194 states and 50488 transitions. [2019-12-18 15:06:19,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:06:19,951 INFO L276 IsEmpty]: Start isEmpty. Operand 17194 states and 50488 transitions. [2019-12-18 15:06:19,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 15:06:19,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:19,972 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] [2019-12-18 15:06:19,972 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:19,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:19,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1031083350, now seen corresponding path program 2 times [2019-12-18 15:06:19,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:19,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992722712] [2019-12-18 15:06:19,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:20,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992722712] [2019-12-18 15:06:20,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:20,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:06:20,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914825930] [2019-12-18 15:06:20,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:06:20,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:20,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:06:20,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:06:20,026 INFO L87 Difference]: Start difference. First operand 17194 states and 50488 transitions. Second operand 3 states. [2019-12-18 15:06:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:20,087 INFO L93 Difference]: Finished difference Result 13828 states and 39650 transitions. [2019-12-18 15:06:20,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:06:20,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 15:06:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:20,108 INFO L225 Difference]: With dead ends: 13828 [2019-12-18 15:06:20,109 INFO L226 Difference]: Without dead ends: 13828 [2019-12-18 15:06:20,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:06:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13828 states. [2019-12-18 15:06:20,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13828 to 13824. [2019-12-18 15:06:20,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13824 states. [2019-12-18 15:06:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13824 states to 13824 states and 39642 transitions. [2019-12-18 15:06:20,421 INFO L78 Accepts]: Start accepts. Automaton has 13824 states and 39642 transitions. Word has length 40 [2019-12-18 15:06:20,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:20,422 INFO L462 AbstractCegarLoop]: Abstraction has 13824 states and 39642 transitions. [2019-12-18 15:06:20,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:06:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 13824 states and 39642 transitions. [2019-12-18 15:06:20,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 15:06:20,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:20,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:06:20,434 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:20,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:20,434 INFO L82 PathProgramCache]: Analyzing trace with hash 234062339, now seen corresponding path program 1 times [2019-12-18 15:06:20,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:20,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157031270] [2019-12-18 15:06:20,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:20,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157031270] [2019-12-18 15:06:20,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:20,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:06:20,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902944384] [2019-12-18 15:06:20,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:06:20,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:20,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:06:20,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:06:20,492 INFO L87 Difference]: Start difference. First operand 13824 states and 39642 transitions. Second operand 3 states. [2019-12-18 15:06:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:20,551 INFO L93 Difference]: Finished difference Result 13762 states and 39441 transitions. [2019-12-18 15:06:20,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:06:20,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 15:06:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:20,574 INFO L225 Difference]: With dead ends: 13762 [2019-12-18 15:06:20,574 INFO L226 Difference]: Without dead ends: 13762 [2019-12-18 15:06:20,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:06:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13762 states. [2019-12-18 15:06:20,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13762 to 12106. [2019-12-18 15:06:20,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12106 states. [2019-12-18 15:06:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12106 states to 12106 states and 35067 transitions. [2019-12-18 15:06:20,757 INFO L78 Accepts]: Start accepts. Automaton has 12106 states and 35067 transitions. Word has length 41 [2019-12-18 15:06:20,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:20,758 INFO L462 AbstractCegarLoop]: Abstraction has 12106 states and 35067 transitions. [2019-12-18 15:06:20,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:06:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 12106 states and 35067 transitions. [2019-12-18 15:06:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 15:06:20,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:20,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:06:20,770 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:20,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:20,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1386848900, now seen corresponding path program 1 times [2019-12-18 15:06:20,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:20,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738002408] [2019-12-18 15:06:20,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:20,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:20,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738002408] [2019-12-18 15:06:20,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:20,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:06:20,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798397402] [2019-12-18 15:06:20,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:06:20,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:20,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:06:20,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:06:20,863 INFO L87 Difference]: Start difference. First operand 12106 states and 35067 transitions. Second operand 6 states. [2019-12-18 15:06:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:20,965 INFO L93 Difference]: Finished difference Result 11274 states and 33248 transitions. [2019-12-18 15:06:20,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:06:20,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 15:06:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:20,982 INFO L225 Difference]: With dead ends: 11274 [2019-12-18 15:06:20,982 INFO L226 Difference]: Without dead ends: 9070 [2019-12-18 15:06:20,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:06:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9070 states. [2019-12-18 15:06:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9070 to 9070. [2019-12-18 15:06:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9070 states. [2019-12-18 15:06:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9070 states to 9070 states and 28236 transitions. [2019-12-18 15:06:21,121 INFO L78 Accepts]: Start accepts. Automaton has 9070 states and 28236 transitions. Word has length 42 [2019-12-18 15:06:21,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:21,121 INFO L462 AbstractCegarLoop]: Abstraction has 9070 states and 28236 transitions. [2019-12-18 15:06:21,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:06:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 9070 states and 28236 transitions. [2019-12-18 15:06:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:06:21,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:21,130 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] [2019-12-18 15:06:21,131 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:21,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:21,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1128251409, now seen corresponding path program 1 times [2019-12-18 15:06:21,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:21,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888890338] [2019-12-18 15:06:21,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:21,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888890338] [2019-12-18 15:06:21,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:21,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:06:21,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95718417] [2019-12-18 15:06:21,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:06:21,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:21,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:06:21,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:06:21,168 INFO L87 Difference]: Start difference. First operand 9070 states and 28236 transitions. Second operand 3 states. [2019-12-18 15:06:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:21,282 INFO L93 Difference]: Finished difference Result 13366 states and 41764 transitions. [2019-12-18 15:06:21,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:06:21,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 15:06:21,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:21,307 INFO L225 Difference]: With dead ends: 13366 [2019-12-18 15:06:21,307 INFO L226 Difference]: Without dead ends: 13366 [2019-12-18 15:06:21,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:06:21,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-18 15:06:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11014. [2019-12-18 15:06:21,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11014 states. [2019-12-18 15:06:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11014 states to 11014 states and 34672 transitions. [2019-12-18 15:06:21,497 INFO L78 Accepts]: Start accepts. Automaton has 11014 states and 34672 transitions. Word has length 66 [2019-12-18 15:06:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:21,497 INFO L462 AbstractCegarLoop]: Abstraction has 11014 states and 34672 transitions. [2019-12-18 15:06:21,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:06:21,497 INFO L276 IsEmpty]: Start isEmpty. Operand 11014 states and 34672 transitions. [2019-12-18 15:06:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:06:21,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:21,509 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] [2019-12-18 15:06:21,510 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:21,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:21,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1486247926, now seen corresponding path program 1 times [2019-12-18 15:06:21,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:21,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470581955] [2019-12-18 15:06:21,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:21,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470581955] [2019-12-18 15:06:21,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:21,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:06:21,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012669115] [2019-12-18 15:06:21,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:06:21,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:21,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:06:21,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:06:21,548 INFO L87 Difference]: Start difference. First operand 11014 states and 34672 transitions. Second operand 3 states. [2019-12-18 15:06:21,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:21,624 INFO L93 Difference]: Finished difference Result 13366 states and 40402 transitions. [2019-12-18 15:06:21,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:06:21,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 15:06:21,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:21,641 INFO L225 Difference]: With dead ends: 13366 [2019-12-18 15:06:21,642 INFO L226 Difference]: Without dead ends: 13366 [2019-12-18 15:06:21,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:06:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-12-18 15:06:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 10822. [2019-12-18 15:06:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10822 states. [2019-12-18 15:06:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10822 states to 10822 states and 32790 transitions. [2019-12-18 15:06:21,822 INFO L78 Accepts]: Start accepts. Automaton has 10822 states and 32790 transitions. Word has length 66 [2019-12-18 15:06:21,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:21,822 INFO L462 AbstractCegarLoop]: Abstraction has 10822 states and 32790 transitions. [2019-12-18 15:06:21,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:06:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 10822 states and 32790 transitions. [2019-12-18 15:06:21,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:06:21,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:21,834 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] [2019-12-18 15:06:21,835 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:21,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:21,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2105019115, now seen corresponding path program 1 times [2019-12-18 15:06:21,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:21,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346314198] [2019-12-18 15:06:21,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:21,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346314198] [2019-12-18 15:06:21,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:21,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:06:21,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798948560] [2019-12-18 15:06:21,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:06:21,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:21,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:06:21,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:06:21,920 INFO L87 Difference]: Start difference. First operand 10822 states and 32790 transitions. Second operand 7 states. [2019-12-18 15:06:22,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:22,226 INFO L93 Difference]: Finished difference Result 20681 states and 61631 transitions. [2019-12-18 15:06:22,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:06:22,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 15:06:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:22,247 INFO L225 Difference]: With dead ends: 20681 [2019-12-18 15:06:22,248 INFO L226 Difference]: Without dead ends: 14543 [2019-12-18 15:06:22,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:06:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14543 states. [2019-12-18 15:06:22,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14543 to 12441. [2019-12-18 15:06:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12441 states. [2019-12-18 15:06:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12441 states to 12441 states and 37169 transitions. [2019-12-18 15:06:22,567 INFO L78 Accepts]: Start accepts. Automaton has 12441 states and 37169 transitions. Word has length 66 [2019-12-18 15:06:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:22,567 INFO L462 AbstractCegarLoop]: Abstraction has 12441 states and 37169 transitions. [2019-12-18 15:06:22,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:06:22,568 INFO L276 IsEmpty]: Start isEmpty. Operand 12441 states and 37169 transitions. [2019-12-18 15:06:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 15:06:22,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:22,580 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] [2019-12-18 15:06:22,580 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash 659069437, now seen corresponding path program 2 times [2019-12-18 15:06:22,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:22,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608659672] [2019-12-18 15:06:22,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:22,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:22,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608659672] [2019-12-18 15:06:22,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:22,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:06:22,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254748084] [2019-12-18 15:06:22,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:06:22,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:22,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:06:22,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:06:22,650 INFO L87 Difference]: Start difference. First operand 12441 states and 37169 transitions. Second operand 3 states. [2019-12-18 15:06:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:22,749 INFO L93 Difference]: Finished difference Result 14253 states and 42667 transitions. [2019-12-18 15:06:22,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:06:22,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 15:06:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:22,774 INFO L225 Difference]: With dead ends: 14253 [2019-12-18 15:06:22,774 INFO L226 Difference]: Without dead ends: 14253 [2019-12-18 15:06:22,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:06:22,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14253 states. [2019-12-18 15:06:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14253 to 11598. [2019-12-18 15:06:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11598 states. [2019-12-18 15:06:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11598 states to 11598 states and 34911 transitions. [2019-12-18 15:06:22,970 INFO L78 Accepts]: Start accepts. Automaton has 11598 states and 34911 transitions. Word has length 66 [2019-12-18 15:06:22,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:22,970 INFO L462 AbstractCegarLoop]: Abstraction has 11598 states and 34911 transitions. [2019-12-18 15:06:22,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:06:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 11598 states and 34911 transitions. [2019-12-18 15:06:22,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:06:22,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:22,982 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] [2019-12-18 15:06:22,983 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:22,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:22,983 INFO L82 PathProgramCache]: Analyzing trace with hash -881684233, now seen corresponding path program 1 times [2019-12-18 15:06:22,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:22,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739147911] [2019-12-18 15:06:22,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:23,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739147911] [2019-12-18 15:06:23,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:23,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 15:06:23,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721484496] [2019-12-18 15:06:23,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:06:23,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:23,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:06:23,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:06:23,092 INFO L87 Difference]: Start difference. First operand 11598 states and 34911 transitions. Second operand 7 states. [2019-12-18 15:06:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:23,892 INFO L93 Difference]: Finished difference Result 18745 states and 54912 transitions. [2019-12-18 15:06:23,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:06:23,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-18 15:06:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:23,916 INFO L225 Difference]: With dead ends: 18745 [2019-12-18 15:06:23,917 INFO L226 Difference]: Without dead ends: 18745 [2019-12-18 15:06:23,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:06:23,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18745 states. [2019-12-18 15:06:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18745 to 12654. [2019-12-18 15:06:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12654 states. [2019-12-18 15:06:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12654 states to 12654 states and 37855 transitions. [2019-12-18 15:06:24,137 INFO L78 Accepts]: Start accepts. Automaton has 12654 states and 37855 transitions. Word has length 67 [2019-12-18 15:06:24,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:24,137 INFO L462 AbstractCegarLoop]: Abstraction has 12654 states and 37855 transitions. [2019-12-18 15:06:24,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:06:24,138 INFO L276 IsEmpty]: Start isEmpty. Operand 12654 states and 37855 transitions. [2019-12-18 15:06:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:06:24,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:24,150 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] [2019-12-18 15:06:24,151 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:24,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:24,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1394509299, now seen corresponding path program 2 times [2019-12-18 15:06:24,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:24,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367340459] [2019-12-18 15:06:24,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:24,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367340459] [2019-12-18 15:06:24,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:24,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:06:24,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617261923] [2019-12-18 15:06:24,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:06:24,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:24,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:06:24,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:06:24,227 INFO L87 Difference]: Start difference. First operand 12654 states and 37855 transitions. Second operand 4 states. [2019-12-18 15:06:24,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:24,327 INFO L93 Difference]: Finished difference Result 12522 states and 37296 transitions. [2019-12-18 15:06:24,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:06:24,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-18 15:06:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:24,344 INFO L225 Difference]: With dead ends: 12522 [2019-12-18 15:06:24,344 INFO L226 Difference]: Without dead ends: 12522 [2019-12-18 15:06:24,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:06:24,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12522 states. [2019-12-18 15:06:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12522 to 11586. [2019-12-18 15:06:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-12-18 15:06:24,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 34463 transitions. [2019-12-18 15:06:24,527 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 34463 transitions. Word has length 67 [2019-12-18 15:06:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:24,527 INFO L462 AbstractCegarLoop]: Abstraction has 11586 states and 34463 transitions. [2019-12-18 15:06:24,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:06:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 34463 transitions. [2019-12-18 15:06:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:06:24,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:24,539 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] [2019-12-18 15:06:24,539 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:24,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:24,540 INFO L82 PathProgramCache]: Analyzing trace with hash -825405888, now seen corresponding path program 1 times [2019-12-18 15:06:24,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:24,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696747843] [2019-12-18 15:06:24,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:25,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696747843] [2019-12-18 15:06:25,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:25,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 15:06:25,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865486473] [2019-12-18 15:06:25,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:06:25,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:25,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:06:25,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:06:25,074 INFO L87 Difference]: Start difference. First operand 11586 states and 34463 transitions. Second operand 18 states. [2019-12-18 15:06:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:26,984 INFO L93 Difference]: Finished difference Result 13638 states and 39910 transitions. [2019-12-18 15:06:26,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 15:06:26,985 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-18 15:06:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:27,002 INFO L225 Difference]: With dead ends: 13638 [2019-12-18 15:06:27,002 INFO L226 Difference]: Without dead ends: 12427 [2019-12-18 15:06:27,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:06:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12427 states. [2019-12-18 15:06:27,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12427 to 11150. [2019-12-18 15:06:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11150 states. [2019-12-18 15:06:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11150 states to 11150 states and 32824 transitions. [2019-12-18 15:06:27,162 INFO L78 Accepts]: Start accepts. Automaton has 11150 states and 32824 transitions. Word has length 67 [2019-12-18 15:06:27,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:27,162 INFO L462 AbstractCegarLoop]: Abstraction has 11150 states and 32824 transitions. [2019-12-18 15:06:27,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:06:27,162 INFO L276 IsEmpty]: Start isEmpty. Operand 11150 states and 32824 transitions. [2019-12-18 15:06:27,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:06:27,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:27,172 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] [2019-12-18 15:06:27,172 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:27,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:27,172 INFO L82 PathProgramCache]: Analyzing trace with hash 289864222, now seen corresponding path program 2 times [2019-12-18 15:06:27,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:27,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470471537] [2019-12-18 15:06:27,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:27,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:27,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470471537] [2019-12-18 15:06:27,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:27,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 15:06:27,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551163602] [2019-12-18 15:06:27,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:06:27,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:27,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:06:27,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:06:27,672 INFO L87 Difference]: Start difference. First operand 11150 states and 32824 transitions. Second operand 18 states. [2019-12-18 15:06:31,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:31,808 INFO L93 Difference]: Finished difference Result 18221 states and 52595 transitions. [2019-12-18 15:06:31,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-18 15:06:31,808 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-18 15:06:31,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:31,829 INFO L225 Difference]: With dead ends: 18221 [2019-12-18 15:06:31,829 INFO L226 Difference]: Without dead ends: 13458 [2019-12-18 15:06:31,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=542, Invalid=3118, Unknown=0, NotChecked=0, Total=3660 [2019-12-18 15:06:31,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13458 states. [2019-12-18 15:06:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13458 to 11476. [2019-12-18 15:06:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11476 states. [2019-12-18 15:06:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11476 states to 11476 states and 33561 transitions. [2019-12-18 15:06:32,013 INFO L78 Accepts]: Start accepts. Automaton has 11476 states and 33561 transitions. Word has length 67 [2019-12-18 15:06:32,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:32,013 INFO L462 AbstractCegarLoop]: Abstraction has 11476 states and 33561 transitions. [2019-12-18 15:06:32,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:06:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 11476 states and 33561 transitions. [2019-12-18 15:06:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:06:32,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:32,026 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] [2019-12-18 15:06:32,026 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:32,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:32,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1102267118, now seen corresponding path program 3 times [2019-12-18 15:06:32,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:32,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302365938] [2019-12-18 15:06:32,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:32,409 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 12 [2019-12-18 15:06:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:32,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302365938] [2019-12-18 15:06:32,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:32,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:06:32,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665908922] [2019-12-18 15:06:32,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:06:32,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:32,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:06:32,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:06:32,712 INFO L87 Difference]: Start difference. First operand 11476 states and 33561 transitions. Second operand 17 states. [2019-12-18 15:06:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:35,825 INFO L93 Difference]: Finished difference Result 16112 states and 46412 transitions. [2019-12-18 15:06:35,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 15:06:35,825 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 15:06:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:35,844 INFO L225 Difference]: With dead ends: 16112 [2019-12-18 15:06:35,844 INFO L226 Difference]: Without dead ends: 13695 [2019-12-18 15:06:35,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=541, Invalid=2881, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 15:06:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13695 states. [2019-12-18 15:06:36,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13695 to 11848. [2019-12-18 15:06:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11848 states. [2019-12-18 15:06:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 34603 transitions. [2019-12-18 15:06:36,021 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 34603 transitions. Word has length 67 [2019-12-18 15:06:36,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:36,021 INFO L462 AbstractCegarLoop]: Abstraction has 11848 states and 34603 transitions. [2019-12-18 15:06:36,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:06:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 34603 transitions. [2019-12-18 15:06:36,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:06:36,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:36,033 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] [2019-12-18 15:06:36,034 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:36,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:36,034 INFO L82 PathProgramCache]: Analyzing trace with hash -164342018, now seen corresponding path program 4 times [2019-12-18 15:06:36,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:36,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543818765] [2019-12-18 15:06:36,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:36,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-18 15:06:36,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543818765] [2019-12-18 15:06:36,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:36,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:06:36,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466453169] [2019-12-18 15:06:36,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:06:36,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:36,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:06:36,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:06:36,600 INFO L87 Difference]: Start difference. First operand 11848 states and 34603 transitions. Second operand 17 states. [2019-12-18 15:06:39,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:39,887 INFO L93 Difference]: Finished difference Result 13964 states and 40050 transitions. [2019-12-18 15:06:39,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 15:06:39,889 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 15:06:39,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:39,906 INFO L225 Difference]: With dead ends: 13964 [2019-12-18 15:06:39,906 INFO L226 Difference]: Without dead ends: 13239 [2019-12-18 15:06:39,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=521, Invalid=2785, Unknown=0, NotChecked=0, Total=3306 [2019-12-18 15:06:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13239 states. [2019-12-18 15:06:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13239 to 11506. [2019-12-18 15:06:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11506 states. [2019-12-18 15:06:40,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11506 states to 11506 states and 33703 transitions. [2019-12-18 15:06:40,072 INFO L78 Accepts]: Start accepts. Automaton has 11506 states and 33703 transitions. Word has length 67 [2019-12-18 15:06:40,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:40,072 INFO L462 AbstractCegarLoop]: Abstraction has 11506 states and 33703 transitions. [2019-12-18 15:06:40,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:06:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand 11506 states and 33703 transitions. [2019-12-18 15:06:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:06:40,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:40,084 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] [2019-12-18 15:06:40,084 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:40,084 INFO L82 PathProgramCache]: Analyzing trace with hash -839530064, now seen corresponding path program 5 times [2019-12-18 15:06:40,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:40,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649782770] [2019-12-18 15:06:40,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:40,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649782770] [2019-12-18 15:06:40,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:40,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:06:40,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091036387] [2019-12-18 15:06:40,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:06:40,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:40,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:06:40,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:06:40,243 INFO L87 Difference]: Start difference. First operand 11506 states and 33703 transitions. Second operand 11 states. [2019-12-18 15:06:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:41,090 INFO L93 Difference]: Finished difference Result 19280 states and 55879 transitions. [2019-12-18 15:06:41,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 15:06:41,090 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 15:06:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:41,108 INFO L225 Difference]: With dead ends: 19280 [2019-12-18 15:06:41,108 INFO L226 Difference]: Without dead ends: 13442 [2019-12-18 15:06:41,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:06:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13442 states. [2019-12-18 15:06:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13442 to 11225. [2019-12-18 15:06:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11225 states. [2019-12-18 15:06:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11225 states to 11225 states and 32653 transitions. [2019-12-18 15:06:41,277 INFO L78 Accepts]: Start accepts. Automaton has 11225 states and 32653 transitions. Word has length 67 [2019-12-18 15:06:41,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:41,277 INFO L462 AbstractCegarLoop]: Abstraction has 11225 states and 32653 transitions. [2019-12-18 15:06:41,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:06:41,277 INFO L276 IsEmpty]: Start isEmpty. Operand 11225 states and 32653 transitions. [2019-12-18 15:06:41,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:06:41,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:41,288 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] [2019-12-18 15:06:41,288 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:41,289 INFO L82 PathProgramCache]: Analyzing trace with hash 600070166, now seen corresponding path program 6 times [2019-12-18 15:06:41,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:41,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502531961] [2019-12-18 15:06:41,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:06:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:06:41,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502531961] [2019-12-18 15:06:41,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:06:41,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 15:06:41,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119574025] [2019-12-18 15:06:41,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:06:41,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:06:41,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:06:41,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:06:41,398 INFO L87 Difference]: Start difference. First operand 11225 states and 32653 transitions. Second operand 9 states. [2019-12-18 15:06:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:06:42,093 INFO L93 Difference]: Finished difference Result 13576 states and 38536 transitions. [2019-12-18 15:06:42,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:06:42,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 15:06:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:06:42,110 INFO L225 Difference]: With dead ends: 13576 [2019-12-18 15:06:42,110 INFO L226 Difference]: Without dead ends: 12510 [2019-12-18 15:06:42,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:06:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12510 states. [2019-12-18 15:06:42,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12510 to 10461. [2019-12-18 15:06:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10461 states. [2019-12-18 15:06:42,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10461 states to 10461 states and 30602 transitions. [2019-12-18 15:06:42,261 INFO L78 Accepts]: Start accepts. Automaton has 10461 states and 30602 transitions. Word has length 67 [2019-12-18 15:06:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:06:42,261 INFO L462 AbstractCegarLoop]: Abstraction has 10461 states and 30602 transitions. [2019-12-18 15:06:42,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:06:42,262 INFO L276 IsEmpty]: Start isEmpty. Operand 10461 states and 30602 transitions. [2019-12-18 15:06:42,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 15:06:42,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:06:42,271 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] [2019-12-18 15:06:42,271 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:06:42,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:06:42,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1080421452, now seen corresponding path program 7 times [2019-12-18 15:06:42,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:06:42,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064343715] [2019-12-18 15:06:42,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:06:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:06:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:06:42,376 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:06:42,376 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:06:42,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_201 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2408~0.base_39| 4)) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2408~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2408~0.base_39|) |v_ULTIMATE.start_main_~#t2408~0.offset_26| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2408~0.base_39|) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2408~0.base_39| 1)) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 v_~y$r_buff1_thd2~0_197) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2408~0.base_39|)) (= v_~y~0_189 0) (= |v_ULTIMATE.start_main_~#t2408~0.offset_26| 0) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t2409~0.base=|v_ULTIMATE.start_main_~#t2409~0.base_37|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ULTIMATE.start_main_~#t2409~0.offset=|v_ULTIMATE.start_main_~#t2409~0.offset_25|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~y~0=v_~y~0_189, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_~#t2408~0.offset=|v_ULTIMATE.start_main_~#t2408~0.offset_26|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t2408~0.base=|v_ULTIMATE.start_main_~#t2408~0.base_39|, ULTIMATE.start_main_~#t2410~0.base=|v_ULTIMATE.start_main_~#t2410~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t2410~0.offset=|v_ULTIMATE.start_main_~#t2410~0.offset_20|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2409~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t2409~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t2408~0.offset, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t2408~0.base, ULTIMATE.start_main_~#t2410~0.base, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2410~0.offset, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:06:42,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_15 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|) (= 0 (mod v_~y$w_buff1_used~0_76 256))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_15, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_13|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:06:42,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2409~0.base_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2409~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t2409~0.offset_10| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2409~0.base_11| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2409~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2409~0.base_11|) |v_ULTIMATE.start_main_~#t2409~0.offset_10| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t2409~0.base_11| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2409~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2409~0.base=|v_ULTIMATE.start_main_~#t2409~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2409~0.offset=|v_ULTIMATE.start_main_~#t2409~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2409~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2409~0.offset, #length] because there is no mapped edge [2019-12-18 15:06:42,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2410~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2410~0.base_11|) |v_ULTIMATE.start_main_~#t2410~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2410~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2410~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2410~0.base_11| 4)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2410~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t2410~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t2410~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2410~0.offset=|v_ULTIMATE.start_main_~#t2410~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2410~0.base=|v_ULTIMATE.start_main_~#t2410~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2410~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2410~0.base, #length] because there is no mapped edge [2019-12-18 15:06:42,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2024995035 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite23_In-2024995035| |P2Thread1of1ForFork2_#t~ite23_Out-2024995035|) (not .cse0) (= ~y$w_buff1~0_In-2024995035 |P2Thread1of1ForFork2_#t~ite24_Out-2024995035|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-2024995035 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-2024995035 256)) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd3~0_In-2024995035 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-2024995035 256)))) (= |P2Thread1of1ForFork2_#t~ite23_Out-2024995035| |P2Thread1of1ForFork2_#t~ite24_Out-2024995035|) (= |P2Thread1of1ForFork2_#t~ite23_Out-2024995035| ~y$w_buff1~0_In-2024995035) .cse0))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-2024995035|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2024995035, ~y$w_buff1~0=~y$w_buff1~0_In-2024995035, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2024995035, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2024995035, ~weak$$choice2~0=~weak$$choice2~0_In-2024995035, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2024995035} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-2024995035|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-2024995035|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2024995035, ~y$w_buff1~0=~y$w_buff1~0_In-2024995035, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2024995035, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2024995035, ~weak$$choice2~0=~weak$$choice2~0_In-2024995035, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2024995035} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 15:06:42,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In526384523 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out526384523| |P2Thread1of1ForFork2_#t~ite26_Out526384523|) (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In526384523 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In526384523 256)) (and .cse0 (= (mod ~y$r_buff1_thd3~0_In526384523 256) 0)) (and .cse0 (= (mod ~y$w_buff1_used~0_In526384523 256) 0)))) .cse1 (= |P2Thread1of1ForFork2_#t~ite26_Out526384523| ~y$w_buff0_used~0_In526384523)) (and (= |P2Thread1of1ForFork2_#t~ite27_Out526384523| ~y$w_buff0_used~0_In526384523) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite26_In526384523| |P2Thread1of1ForFork2_#t~ite26_Out526384523|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In526384523, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In526384523|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In526384523, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In526384523, ~weak$$choice2~0=~weak$$choice2~0_In526384523, ~y$w_buff1_used~0=~y$w_buff1_used~0_In526384523} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out526384523|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In526384523, ~y$w_buff0_used~0=~y$w_buff0_used~0_In526384523, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In526384523, ~weak$$choice2~0=~weak$$choice2~0_In526384523, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out526384523|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In526384523} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 15:06:42,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1739036730 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite30_Out1739036730| |P2Thread1of1ForFork2_#t~ite29_Out1739036730|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1739036730 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In1739036730 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1739036730 256)) (and .cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1739036730 256))))) (= |P2Thread1of1ForFork2_#t~ite29_Out1739036730| ~y$w_buff1_used~0_In1739036730) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite30_Out1739036730| ~y$w_buff1_used~0_In1739036730) (= |P2Thread1of1ForFork2_#t~ite29_In1739036730| |P2Thread1of1ForFork2_#t~ite29_Out1739036730|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1739036730, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1739036730, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1739036730, ~weak$$choice2~0=~weak$$choice2~0_In1739036730, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In1739036730|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1739036730} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1739036730, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1739036730, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1739036730|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1739036730, ~weak$$choice2~0=~weak$$choice2~0_In1739036730, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out1739036730|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1739036730} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 15:06:42,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_10|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-18 15:06:42,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 15:06:42,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-684043450 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-684043450 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out-684043450| ~y$w_buff1~0_In-684043450) (not .cse0) (not .cse1)) (and (= ~y~0_In-684043450 |P2Thread1of1ForFork2_#t~ite38_Out-684043450|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-684043450, ~y$w_buff1~0=~y$w_buff1~0_In-684043450, ~y~0=~y~0_In-684043450, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-684043450} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-684043450, ~y$w_buff1~0=~y$w_buff1~0_In-684043450, ~y~0=~y~0_In-684043450, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-684043450|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-684043450} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 15:06:42,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-2081593783 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2081593783 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2081593783|)) (and (= ~y$w_buff0_used~0_In-2081593783 |P0Thread1of1ForFork0_#t~ite5_Out-2081593783|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2081593783, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2081593783} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2081593783|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2081593783, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2081593783} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 15:06:42,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-168516647 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-168516647 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-168516647 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-168516647 256) 0))) (or (and (= ~y$w_buff1_used~0_In-168516647 |P0Thread1of1ForFork0_#t~ite6_Out-168516647|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-168516647|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-168516647, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-168516647, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-168516647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-168516647} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-168516647|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-168516647, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-168516647, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-168516647, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-168516647} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 15:06:42,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-777157991 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-777157991 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-777157991| |P1Thread1of1ForFork1_#t~ite10_Out-777157991|))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-777157991| ~y$w_buff1~0_In-777157991) .cse2) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-777157991| ~y~0_In-777157991) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-777157991, ~y$w_buff1~0=~y$w_buff1~0_In-777157991, ~y~0=~y~0_In-777157991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-777157991} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-777157991, ~y$w_buff1~0=~y$w_buff1~0_In-777157991, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-777157991|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-777157991|, ~y~0=~y~0_In-777157991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-777157991} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 15:06:42,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_12|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_12|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_7|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_11|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 15:06:42,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1772733630 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1772733630 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-1772733630|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1772733630 |P2Thread1of1ForFork2_#t~ite40_Out-1772733630|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1772733630, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1772733630} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1772733630, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1772733630, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1772733630|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 15:06:42,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1713443545 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1713443545 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1713443545 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1713443545 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out1713443545| 0)) (and (= |P2Thread1of1ForFork2_#t~ite41_Out1713443545| ~y$w_buff1_used~0_In1713443545) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1713443545, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1713443545, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1713443545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1713443545} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1713443545, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1713443545, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out1713443545|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1713443545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1713443545} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 15:06:42,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1862865987 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1862865987 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out1862865987| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out1862865987| ~y$r_buff0_thd3~0_In1862865987)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1862865987, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1862865987} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1862865987, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out1862865987|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1862865987} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 15:06:42,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-699094732 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-699094732 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-699094732 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-699094732 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out-699094732| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite43_Out-699094732| ~y$r_buff1_thd3~0_In-699094732)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-699094732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-699094732, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-699094732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-699094732} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-699094732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-699094732, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-699094732, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-699094732|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-699094732} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 15:06:42,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1782449381 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1782449381 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out1782449381 ~y$r_buff0_thd1~0_In1782449381) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd1~0_Out1782449381 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1782449381, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1782449381} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1782449381, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1782449381|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1782449381} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 15:06:42,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In5136008 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In5136008 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In5136008 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In5136008 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out5136008| 0)) (and (= ~y$r_buff1_thd1~0_In5136008 |P0Thread1of1ForFork0_#t~ite8_Out5136008|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In5136008, ~y$w_buff0_used~0=~y$w_buff0_used~0_In5136008, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In5136008, ~y$w_buff1_used~0=~y$w_buff1_used~0_In5136008} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In5136008, ~y$w_buff0_used~0=~y$w_buff0_used~0_In5136008, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out5136008|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In5136008, ~y$w_buff1_used~0=~y$w_buff1_used~0_In5136008} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 15:06:42,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} 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-18 15:06:42,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_34| v_~y$r_buff1_thd3~0_152) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_33|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 15:06:42,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In714562578 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In714562578 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out714562578|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In714562578 |P1Thread1of1ForFork1_#t~ite11_Out714562578|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In714562578, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In714562578} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In714562578, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In714562578, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out714562578|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 15:06:42,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1388294289 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1388294289 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1388294289 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1388294289 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1388294289 |P1Thread1of1ForFork1_#t~ite12_Out-1388294289|)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-1388294289| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1388294289, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1388294289, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1388294289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1388294289} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1388294289, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1388294289, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1388294289, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1388294289|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1388294289} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 15:06:42,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1839961781 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1839961781 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-1839961781| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1839961781| ~y$r_buff0_thd2~0_In-1839961781) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1839961781, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1839961781} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1839961781, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1839961781, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1839961781|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 15:06:42,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In1392007150 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1392007150 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1392007150 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1392007150 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1392007150| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out1392007150| ~y$r_buff1_thd2~0_In1392007150) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1392007150, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1392007150, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1392007150, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1392007150} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1392007150, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1392007150, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1392007150, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1392007150|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1392007150} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 15:06:42,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 15:06:42,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 15:06:42,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2055686714 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2055686714 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In2055686714 |ULTIMATE.start_main_#t~ite47_Out2055686714|)) (and (or .cse0 .cse1) (= ~y~0_In2055686714 |ULTIMATE.start_main_#t~ite47_Out2055686714|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2055686714, ~y~0=~y~0_In2055686714, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2055686714, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2055686714} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2055686714, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2055686714|, ~y~0=~y~0_In2055686714, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2055686714, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2055686714} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 15:06:42,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-18 15:06:42,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-183165397 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-183165397 256)))) (or (and (= ~y$w_buff0_used~0_In-183165397 |ULTIMATE.start_main_#t~ite49_Out-183165397|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-183165397|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-183165397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-183165397} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-183165397, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-183165397, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-183165397|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 15:06:42,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In657971540 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In657971540 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In657971540 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In657971540 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out657971540|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In657971540 |ULTIMATE.start_main_#t~ite50_Out657971540|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In657971540, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In657971540, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In657971540, ~y$w_buff1_used~0=~y$w_buff1_used~0_In657971540} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out657971540|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In657971540, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In657971540, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In657971540, ~y$w_buff1_used~0=~y$w_buff1_used~0_In657971540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 15:06:42,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In455541026 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In455541026 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out455541026| ~y$r_buff0_thd0~0_In455541026)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out455541026| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In455541026, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In455541026} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out455541026|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In455541026, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In455541026} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 15:06:42,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1495867866 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1495867866 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1495867866 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1495867866 256)))) (or (and (= ~y$r_buff1_thd0~0_In1495867866 |ULTIMATE.start_main_#t~ite52_Out1495867866|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1495867866|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1495867866, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1495867866, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1495867866, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1495867866} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1495867866|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1495867866, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1495867866, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1495867866, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1495867866} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 15:06:42,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= 2 v_~x~0_130) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 15:06:42,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:06:42 BasicIcfg [2019-12-18 15:06:42,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:06:42,490 INFO L168 Benchmark]: Toolchain (without parser) took 178422.87 ms. Allocated memory was 140.0 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 101.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 15:06:42,490 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 140.0 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 15:06:42,491 INFO L168 Benchmark]: CACSL2BoogieTranslator took 821.14 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 100.7 MB in the beginning and 156.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:06:42,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.80 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:06:42,492 INFO L168 Benchmark]: Boogie Preprocessor took 40.83 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:06:42,492 INFO L168 Benchmark]: RCFGBuilder took 842.23 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 101.8 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:06:42,493 INFO L168 Benchmark]: TraceAbstraction took 176654.08 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 15:06:42,502 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.53 ms. Allocated memory is still 140.0 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 821.14 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 100.7 MB in the beginning and 156.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.80 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.83 ms. Allocated memory is still 202.9 MB. Free memory was 153.5 MB in the beginning and 151.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.23 ms. Allocated memory is still 202.9 MB. Free memory was 151.5 MB in the beginning and 101.8 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 176654.08 ms. Allocated memory was 202.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 252 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 241 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78269 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L815] FCALL, FORK 0 pthread_create(&t2408, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L736] 1 y$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2409, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 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_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2410, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 3 __unbuffered_p2_EAX = x [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 y$flush_delayed = weak$$choice2 [L779] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 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) [L743] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 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 [L759] 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=0] [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L759] 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) [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 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 [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 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 [L828] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 176.3s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 72.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5779 SDtfs, 8664 SDslu, 19013 SDs, 0 SdLazy, 15197 SolverSat, 493 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 429 GetRequests, 48 SyntacticMatches, 21 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3158 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206903occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 75.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 184030 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1356 NumberOfCodeBlocks, 1356 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1258 ConstructedInterpolants, 0 QuantifiedInterpolants, 297129 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...