/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:12:47,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:12:47,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:12:47,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:12:47,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:12:47,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:12:47,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:12:47,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:12:47,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:12:47,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:12:47,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:12:47,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:12:47,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:12:47,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:12:47,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:12:47,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:12:47,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:12:47,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:12:47,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:12:47,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:12:47,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:12:47,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:12:47,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:12:47,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:12:47,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:12:47,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:12:47,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:12:47,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:12:47,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:12:47,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:12:47,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:12:47,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:12:47,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:12:47,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:12:47,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:12:47,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:12:47,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:12:47,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:12:47,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:12:47,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:12:47,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:12:47,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:12:47,794 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:12:47,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:12:47,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:12:47,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:12:47,796 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:12:47,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:12:47,796 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:12:47,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:12:47,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:12:47,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:12:47,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:12:47,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:12:47,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:12:47,797 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:12:47,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:12:47,798 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:12:47,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:12:47,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:12:47,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:12:47,798 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:12:47,799 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:12:47,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:12:47,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:12:47,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:12:47,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:12:47,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:12:47,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:12:47,800 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:12:47,800 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:12:47,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:12:47,801 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:12:47,801 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:12:48,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:12:48,089 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:12:48,092 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:12:48,094 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:12:48,096 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:12:48,097 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.oepc.i [2019-12-27 21:12:48,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40687c354/e052eee8534543229b78b0a529cb6a2e/FLAG7a08d7ff0 [2019-12-27 21:12:48,736 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:12:48,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.oepc.i [2019-12-27 21:12:48,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40687c354/e052eee8534543229b78b0a529cb6a2e/FLAG7a08d7ff0 [2019-12-27 21:12:48,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40687c354/e052eee8534543229b78b0a529cb6a2e [2019-12-27 21:12:48,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:12:48,999 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:12:49,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:12:49,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:12:49,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:12:49,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:12:48" (1/1) ... [2019-12-27 21:12:49,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778a9215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:49, skipping insertion in model container [2019-12-27 21:12:49,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:12:48" (1/1) ... [2019-12-27 21:12:49,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:12:49,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:12:49,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:12:49,648 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:12:49,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:12:49,852 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:12:49,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:49 WrapperNode [2019-12-27 21:12:49,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:12:49,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:12:49,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:12:49,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:12:49,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:49" (1/1) ... [2019-12-27 21:12:49,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:49" (1/1) ... [2019-12-27 21:12:49,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:12:49,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:12:49,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:12:49,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:12:49,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:49" (1/1) ... [2019-12-27 21:12:49,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:49" (1/1) ... [2019-12-27 21:12:49,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:49" (1/1) ... [2019-12-27 21:12:49,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:49" (1/1) ... [2019-12-27 21:12:49,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:49" (1/1) ... [2019-12-27 21:12:49,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:49" (1/1) ... [2019-12-27 21:12:49,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:49" (1/1) ... [2019-12-27 21:12:49,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:12:49,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:12:49,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:12:49,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:12:49,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:12:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:12:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:12:50,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:12:50,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:12:50,041 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:12:50,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:12:50,041 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:12:50,041 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:12:50,042 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:12:50,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:12:50,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:12:50,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:12:50,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:12:50,044 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:12:50,853 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:12:50,854 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:12:50,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:12:50 BoogieIcfgContainer [2019-12-27 21:12:50,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:12:50,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:12:50,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:12:50,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:12:50,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:12:48" (1/3) ... [2019-12-27 21:12:50,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea7fd5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:12:50, skipping insertion in model container [2019-12-27 21:12:50,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:12:49" (2/3) ... [2019-12-27 21:12:50,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea7fd5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:12:50, skipping insertion in model container [2019-12-27 21:12:50,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:12:50" (3/3) ... [2019-12-27 21:12:50,864 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_power.oepc.i [2019-12-27 21:12:50,872 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:12:50,873 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:12:50,881 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:12:50,882 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:12:50,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,928 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,928 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,942 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,943 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,959 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,959 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,961 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,962 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,963 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:50,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,024 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,026 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,035 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,042 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,042 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:12:51,058 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:12:51,083 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:12:51,083 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:12:51,083 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:12:51,083 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:12:51,083 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:12:51,083 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:12:51,084 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:12:51,084 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:12:51,099 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 21:12:51,101 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 21:12:51,219 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 21:12:51,220 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:12:51,240 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:12:51,269 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 21:12:51,325 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 21:12:51,325 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:12:51,333 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:12:51,355 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 21:12:51,356 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:12:54,954 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 21:12:55,090 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 21:12:55,137 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80962 [2019-12-27 21:12:55,137 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 21:12:55,141 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 21:13:11,374 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-27 21:13:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-27 21:13:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:13:11,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:11,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:13:11,385 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-27 21:13:11,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:11,391 INFO L82 PathProgramCache]: Analyzing trace with hash 916881, now seen corresponding path program 1 times [2019-12-27 21:13:11,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:11,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987607624] [2019-12-27 21:13:11,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:11,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:11,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987607624] [2019-12-27 21:13:11,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:11,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:13:11,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [422990929] [2019-12-27 21:13:11,615 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:11,619 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:11,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:13:11,633 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:11,637 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:11,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:11,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:11,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:11,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:11,655 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-27 21:13:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:13,324 INFO L93 Difference]: Finished difference Result 104092 states and 443334 transitions. [2019-12-27 21:13:13,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:13,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:13:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:13,930 INFO L225 Difference]: With dead ends: 104092 [2019-12-27 21:13:13,930 INFO L226 Difference]: Without dead ends: 97696 [2019-12-27 21:13:13,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:20,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97696 states. [2019-12-27 21:13:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97696 to 97696. [2019-12-27 21:13:25,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97696 states. [2019-12-27 21:13:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97696 states to 97696 states and 415501 transitions. [2019-12-27 21:13:25,663 INFO L78 Accepts]: Start accepts. Automaton has 97696 states and 415501 transitions. Word has length 3 [2019-12-27 21:13:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:25,664 INFO L462 AbstractCegarLoop]: Abstraction has 97696 states and 415501 transitions. [2019-12-27 21:13:25,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 97696 states and 415501 transitions. [2019-12-27 21:13:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:13:25,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:25,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:25,669 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-27 21:13:25,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1566799458, now seen corresponding path program 1 times [2019-12-27 21:13:25,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:25,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050597497] [2019-12-27 21:13:25,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:25,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050597497] [2019-12-27 21:13:25,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:25,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:25,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1921048301] [2019-12-27 21:13:25,804 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:25,805 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:25,808 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:13:25,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:25,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:25,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:13:25,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:25,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:13:25,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:13:25,811 INFO L87 Difference]: Start difference. First operand 97696 states and 415501 transitions. Second operand 4 states. [2019-12-27 21:13:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:30,859 INFO L93 Difference]: Finished difference Result 155904 states and 634680 transitions. [2019-12-27 21:13:30,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:13:30,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:13:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:31,485 INFO L225 Difference]: With dead ends: 155904 [2019-12-27 21:13:31,485 INFO L226 Difference]: Without dead ends: 155855 [2019-12-27 21:13:31,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155855 states. [2019-12-27 21:13:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155855 to 141665. [2019-12-27 21:13:39,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141665 states. [2019-12-27 21:13:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141665 states to 141665 states and 584468 transitions. [2019-12-27 21:13:39,852 INFO L78 Accepts]: Start accepts. Automaton has 141665 states and 584468 transitions. Word has length 11 [2019-12-27 21:13:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:39,852 INFO L462 AbstractCegarLoop]: Abstraction has 141665 states and 584468 transitions. [2019-12-27 21:13:39,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:13:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 141665 states and 584468 transitions. [2019-12-27 21:13:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:13:39,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:39,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:39,857 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-27 21:13:39,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:39,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2120295885, now seen corresponding path program 1 times [2019-12-27 21:13:39,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:39,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115814095] [2019-12-27 21:13:39,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:39,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115814095] [2019-12-27 21:13:39,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:39,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:39,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2092756009] [2019-12-27 21:13:39,914 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:39,915 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:39,916 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:13:39,916 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:39,917 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:39,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:39,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:39,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:39,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:39,918 INFO L87 Difference]: Start difference. First operand 141665 states and 584468 transitions. Second operand 3 states. [2019-12-27 21:13:40,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:40,050 INFO L93 Difference]: Finished difference Result 31684 states and 102658 transitions. [2019-12-27 21:13:40,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:40,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:13:40,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:40,138 INFO L225 Difference]: With dead ends: 31684 [2019-12-27 21:13:40,138 INFO L226 Difference]: Without dead ends: 31684 [2019-12-27 21:13:40,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31684 states. [2019-12-27 21:13:45,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31684 to 31684. [2019-12-27 21:13:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31684 states. [2019-12-27 21:13:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31684 states to 31684 states and 102658 transitions. [2019-12-27 21:13:45,096 INFO L78 Accepts]: Start accepts. Automaton has 31684 states and 102658 transitions. Word has length 13 [2019-12-27 21:13:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:45,097 INFO L462 AbstractCegarLoop]: Abstraction has 31684 states and 102658 transitions. [2019-12-27 21:13:45,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 31684 states and 102658 transitions. [2019-12-27 21:13:45,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:13:45,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:45,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:45,100 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-27 21:13:45,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:45,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2058055416, now seen corresponding path program 1 times [2019-12-27 21:13:45,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:45,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034830950] [2019-12-27 21:13:45,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:45,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034830950] [2019-12-27 21:13:45,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:45,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:13:45,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [862585595] [2019-12-27 21:13:45,204 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:45,208 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:45,211 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:13:45,211 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:45,211 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:45,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:13:45,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:45,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:13:45,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:13:45,213 INFO L87 Difference]: Start difference. First operand 31684 states and 102658 transitions. Second operand 4 states. [2019-12-27 21:13:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:45,593 INFO L93 Difference]: Finished difference Result 39269 states and 126736 transitions. [2019-12-27 21:13:45,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:13:45,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 21:13:45,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:45,673 INFO L225 Difference]: With dead ends: 39269 [2019-12-27 21:13:45,673 INFO L226 Difference]: Without dead ends: 39269 [2019-12-27 21:13:45,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39269 states. [2019-12-27 21:13:46,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39269 to 35204. [2019-12-27 21:13:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35204 states. [2019-12-27 21:13:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35204 states to 35204 states and 113989 transitions. [2019-12-27 21:13:46,383 INFO L78 Accepts]: Start accepts. Automaton has 35204 states and 113989 transitions. Word has length 16 [2019-12-27 21:13:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:46,384 INFO L462 AbstractCegarLoop]: Abstraction has 35204 states and 113989 transitions. [2019-12-27 21:13:46,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:13:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 35204 states and 113989 transitions. [2019-12-27 21:13:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:13:46,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:46,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:46,721 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-27 21:13:46,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:46,721 INFO L82 PathProgramCache]: Analyzing trace with hash -36065168, now seen corresponding path program 1 times [2019-12-27 21:13:46,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:46,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805354234] [2019-12-27 21:13:46,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:46,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805354234] [2019-12-27 21:13:46,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:46,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:13:46,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [508021827] [2019-12-27 21:13:46,816 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:46,820 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:46,829 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 54 transitions. [2019-12-27 21:13:46,830 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:47,070 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:13:47,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:13:47,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:47,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:13:47,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:13:47,073 INFO L87 Difference]: Start difference. First operand 35204 states and 113989 transitions. Second operand 8 states. [2019-12-27 21:13:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:48,384 INFO L93 Difference]: Finished difference Result 73117 states and 235583 transitions. [2019-12-27 21:13:48,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:13:48,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 21:13:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:48,514 INFO L225 Difference]: With dead ends: 73117 [2019-12-27 21:13:48,514 INFO L226 Difference]: Without dead ends: 73110 [2019-12-27 21:13:48,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:13:48,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73110 states. [2019-12-27 21:13:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73110 to 34913. [2019-12-27 21:13:49,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34913 states. [2019-12-27 21:13:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34913 states to 34913 states and 112936 transitions. [2019-12-27 21:13:49,386 INFO L78 Accepts]: Start accepts. Automaton has 34913 states and 112936 transitions. Word has length 22 [2019-12-27 21:13:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:49,386 INFO L462 AbstractCegarLoop]: Abstraction has 34913 states and 112936 transitions. [2019-12-27 21:13:49,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:13:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 34913 states and 112936 transitions. [2019-12-27 21:13:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:13:49,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:49,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:13:49,398 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-27 21:13:49,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:49,399 INFO L82 PathProgramCache]: Analyzing trace with hash -74237997, now seen corresponding path program 1 times [2019-12-27 21:13:49,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:49,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341777287] [2019-12-27 21:13:49,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:49,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341777287] [2019-12-27 21:13:49,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:49,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:13:49,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [288230991] [2019-12-27 21:13:49,765 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:49,771 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:49,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:13:49,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:49,804 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:13:49,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:13:49,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:49,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:13:49,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:49,805 INFO L87 Difference]: Start difference. First operand 34913 states and 112936 transitions. Second operand 5 states. [2019-12-27 21:13:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:49,876 INFO L93 Difference]: Finished difference Result 14109 states and 42996 transitions. [2019-12-27 21:13:49,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:13:49,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:13:49,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:49,897 INFO L225 Difference]: With dead ends: 14109 [2019-12-27 21:13:49,898 INFO L226 Difference]: Without dead ends: 14109 [2019-12-27 21:13:49,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:13:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14109 states. [2019-12-27 21:13:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14109 to 13809. [2019-12-27 21:13:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-27 21:13:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 42140 transitions. [2019-12-27 21:13:50,108 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 42140 transitions. Word has length 25 [2019-12-27 21:13:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:50,109 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 42140 transitions. [2019-12-27 21:13:50,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:13:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 42140 transitions. [2019-12-27 21:13:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:13:50,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:50,119 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-27 21:13:50,119 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-27 21:13:50,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:50,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1416816819, now seen corresponding path program 1 times [2019-12-27 21:13:50,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:50,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375298817] [2019-12-27 21:13:50,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:50,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375298817] [2019-12-27 21:13:50,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:50,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:13:50,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [553409739] [2019-12-27 21:13:50,172 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:50,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:50,183 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:13:50,183 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:50,184 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:50,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:50,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:50,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:50,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:50,185 INFO L87 Difference]: Start difference. First operand 13809 states and 42140 transitions. Second operand 3 states. [2019-12-27 21:13:50,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:50,296 INFO L93 Difference]: Finished difference Result 19650 states and 58966 transitions. [2019-12-27 21:13:50,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:50,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 21:13:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:50,323 INFO L225 Difference]: With dead ends: 19650 [2019-12-27 21:13:50,323 INFO L226 Difference]: Without dead ends: 19650 [2019-12-27 21:13:50,324 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-27 21:13:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19650 states. [2019-12-27 21:13:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19650 to 14555. [2019-12-27 21:13:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14555 states. [2019-12-27 21:13:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14555 states to 14555 states and 44278 transitions. [2019-12-27 21:13:50,572 INFO L78 Accepts]: Start accepts. Automaton has 14555 states and 44278 transitions. Word has length 27 [2019-12-27 21:13:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:50,573 INFO L462 AbstractCegarLoop]: Abstraction has 14555 states and 44278 transitions. [2019-12-27 21:13:50,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 14555 states and 44278 transitions. [2019-12-27 21:13:50,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:13:50,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:50,583 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-27 21:13:50,583 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-27 21:13:50,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:50,583 INFO L82 PathProgramCache]: Analyzing trace with hash -522150304, now seen corresponding path program 1 times [2019-12-27 21:13:50,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:50,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697899920] [2019-12-27 21:13:50,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:50,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697899920] [2019-12-27 21:13:50,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:50,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:13:50,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [831176189] [2019-12-27 21:13:50,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:50,700 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:50,707 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:13:50,707 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:50,708 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:50,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:13:50,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:50,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:13:50,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:13:50,709 INFO L87 Difference]: Start difference. First operand 14555 states and 44278 transitions. Second operand 6 states. [2019-12-27 21:13:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:51,570 INFO L93 Difference]: Finished difference Result 37188 states and 111594 transitions. [2019-12-27 21:13:51,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:13:51,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:13:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:51,626 INFO L225 Difference]: With dead ends: 37188 [2019-12-27 21:13:51,626 INFO L226 Difference]: Without dead ends: 37188 [2019-12-27 21:13:51,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:13:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37188 states. [2019-12-27 21:13:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37188 to 20478. [2019-12-27 21:13:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-27 21:13:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 63215 transitions. [2019-12-27 21:13:52,389 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 63215 transitions. Word has length 27 [2019-12-27 21:13:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:52,389 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 63215 transitions. [2019-12-27 21:13:52,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:13:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 63215 transitions. [2019-12-27 21:13:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 21:13:52,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:52,404 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] [2019-12-27 21:13:52,404 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-27 21:13:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:52,405 INFO L82 PathProgramCache]: Analyzing trace with hash -624201971, now seen corresponding path program 1 times [2019-12-27 21:13:52,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:52,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105498064] [2019-12-27 21:13:52,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:52,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105498064] [2019-12-27 21:13:52,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:52,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:13:52,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [930095783] [2019-12-27 21:13:52,501 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:52,506 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:52,513 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 21:13:52,514 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:52,514 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:13:52,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:13:52,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:52,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:13:52,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:13:52,515 INFO L87 Difference]: Start difference. First operand 20478 states and 63215 transitions. Second operand 6 states. [2019-12-27 21:13:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:53,325 INFO L93 Difference]: Finished difference Result 34478 states and 103330 transitions. [2019-12-27 21:13:53,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 21:13:53,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 21:13:53,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:53,411 INFO L225 Difference]: With dead ends: 34478 [2019-12-27 21:13:53,411 INFO L226 Difference]: Without dead ends: 34478 [2019-12-27 21:13:53,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:13:53,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34478 states. [2019-12-27 21:13:53,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34478 to 20240. [2019-12-27 21:13:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20240 states. [2019-12-27 21:13:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20240 states to 20240 states and 62600 transitions. [2019-12-27 21:13:53,865 INFO L78 Accepts]: Start accepts. Automaton has 20240 states and 62600 transitions. Word has length 28 [2019-12-27 21:13:53,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:53,866 INFO L462 AbstractCegarLoop]: Abstraction has 20240 states and 62600 transitions. [2019-12-27 21:13:53,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:13:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 20240 states and 62600 transitions. [2019-12-27 21:13:53,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:13:53,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:53,890 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-27 21:13:53,890 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-27 21:13:53,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:53,890 INFO L82 PathProgramCache]: Analyzing trace with hash -160608776, now seen corresponding path program 1 times [2019-12-27 21:13:53,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:53,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453075196] [2019-12-27 21:13:53,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:53,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453075196] [2019-12-27 21:13:53,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:53,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:13:53,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [623162373] [2019-12-27 21:13:53,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:53,989 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:54,003 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 65 transitions. [2019-12-27 21:13:54,004 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:54,219 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:13:54,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:13:54,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:54,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:13:54,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:13:54,221 INFO L87 Difference]: Start difference. First operand 20240 states and 62600 transitions. Second operand 10 states. [2019-12-27 21:13:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:56,951 INFO L93 Difference]: Finished difference Result 69823 states and 209190 transitions. [2019-12-27 21:13:56,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 21:13:56,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-12-27 21:13:56,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:57,062 INFO L225 Difference]: With dead ends: 69823 [2019-12-27 21:13:57,062 INFO L226 Difference]: Without dead ends: 69823 [2019-12-27 21:13:57,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:13:57,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69823 states. [2019-12-27 21:13:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69823 to 21771. [2019-12-27 21:13:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21771 states. [2019-12-27 21:13:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21771 states to 21771 states and 67265 transitions. [2019-12-27 21:13:58,046 INFO L78 Accepts]: Start accepts. Automaton has 21771 states and 67265 transitions. Word has length 33 [2019-12-27 21:13:58,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:58,047 INFO L462 AbstractCegarLoop]: Abstraction has 21771 states and 67265 transitions. [2019-12-27 21:13:58,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:13:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 21771 states and 67265 transitions. [2019-12-27 21:13:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:13:58,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:58,069 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-27 21:13:58,070 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-27 21:13:58,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:58,070 INFO L82 PathProgramCache]: Analyzing trace with hash 88321435, now seen corresponding path program 1 times [2019-12-27 21:13:58,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:58,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206041574] [2019-12-27 21:13:58,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:58,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206041574] [2019-12-27 21:13:58,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:58,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:13:58,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [888370396] [2019-12-27 21:13:58,113 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:58,119 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:58,135 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 71 transitions. [2019-12-27 21:13:58,135 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:58,137 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:13:58,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:13:58,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:58,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:13:58,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:58,138 INFO L87 Difference]: Start difference. First operand 21771 states and 67265 transitions. Second operand 3 states. [2019-12-27 21:13:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:13:58,262 INFO L93 Difference]: Finished difference Result 29013 states and 86739 transitions. [2019-12-27 21:13:58,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:13:58,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 21:13:58,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:13:58,303 INFO L225 Difference]: With dead ends: 29013 [2019-12-27 21:13:58,303 INFO L226 Difference]: Without dead ends: 29013 [2019-12-27 21:13:58,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:13:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29013 states. [2019-12-27 21:13:58,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29013 to 20501. [2019-12-27 21:13:58,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20501 states. [2019-12-27 21:13:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20501 states to 20501 states and 61416 transitions. [2019-12-27 21:13:58,659 INFO L78 Accepts]: Start accepts. Automaton has 20501 states and 61416 transitions. Word has length 33 [2019-12-27 21:13:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:13:58,659 INFO L462 AbstractCegarLoop]: Abstraction has 20501 states and 61416 transitions. [2019-12-27 21:13:58,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:13:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 20501 states and 61416 transitions. [2019-12-27 21:13:58,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:13:58,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:13:58,677 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-27 21:13:58,677 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-27 21:13:58,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:13:58,677 INFO L82 PathProgramCache]: Analyzing trace with hash 838482894, now seen corresponding path program 2 times [2019-12-27 21:13:58,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:13:58,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557187087] [2019-12-27 21:13:58,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:13:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:13:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:13:58,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557187087] [2019-12-27 21:13:58,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:13:58,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:13:58,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1307974549] [2019-12-27 21:13:58,789 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:13:58,796 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:13:58,812 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 21:13:58,813 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:13:58,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:13:58,848 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:13:58,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:13:58,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:13:58,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:13:58,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:13:58,850 INFO L87 Difference]: Start difference. First operand 20501 states and 61416 transitions. Second operand 9 states. [2019-12-27 21:14:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:02,253 INFO L93 Difference]: Finished difference Result 62586 states and 182614 transitions. [2019-12-27 21:14:02,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 21:14:02,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 21:14:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:02,349 INFO L225 Difference]: With dead ends: 62586 [2019-12-27 21:14:02,350 INFO L226 Difference]: Without dead ends: 62586 [2019-12-27 21:14:02,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=327, Invalid=1079, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 21:14:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62586 states. [2019-12-27 21:14:02,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62586 to 23222. [2019-12-27 21:14:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23222 states. [2019-12-27 21:14:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23222 states to 23222 states and 69697 transitions. [2019-12-27 21:14:02,994 INFO L78 Accepts]: Start accepts. Automaton has 23222 states and 69697 transitions. Word has length 33 [2019-12-27 21:14:02,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:02,994 INFO L462 AbstractCegarLoop]: Abstraction has 23222 states and 69697 transitions. [2019-12-27 21:14:02,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:14:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 23222 states and 69697 transitions. [2019-12-27 21:14:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:14:03,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:03,015 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] [2019-12-27 21:14:03,016 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-27 21:14:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:03,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1993650805, now seen corresponding path program 1 times [2019-12-27 21:14:03,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:03,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080565419] [2019-12-27 21:14:03,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:03,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080565419] [2019-12-27 21:14:03,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:03,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:14:03,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [456701894] [2019-12-27 21:14:03,099 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:03,106 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:03,121 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 66 transitions. [2019-12-27 21:14:03,122 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:03,321 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:14:03,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:14:03,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:03,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:14:03,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:14:03,322 INFO L87 Difference]: Start difference. First operand 23222 states and 69697 transitions. Second operand 10 states. [2019-12-27 21:14:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:05,800 INFO L93 Difference]: Finished difference Result 53461 states and 158997 transitions. [2019-12-27 21:14:05,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:14:05,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-27 21:14:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:05,882 INFO L225 Difference]: With dead ends: 53461 [2019-12-27 21:14:05,882 INFO L226 Difference]: Without dead ends: 53461 [2019-12-27 21:14:05,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:14:06,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53461 states. [2019-12-27 21:14:06,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53461 to 22086. [2019-12-27 21:14:06,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22086 states. [2019-12-27 21:14:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22086 states to 22086 states and 66380 transitions. [2019-12-27 21:14:06,750 INFO L78 Accepts]: Start accepts. Automaton has 22086 states and 66380 transitions. Word has length 34 [2019-12-27 21:14:06,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:06,750 INFO L462 AbstractCegarLoop]: Abstraction has 22086 states and 66380 transitions. [2019-12-27 21:14:06,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:14:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand 22086 states and 66380 transitions. [2019-12-27 21:14:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 21:14:06,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:06,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] [2019-12-27 21:14:06,770 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-27 21:14:06,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:06,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1065822653, now seen corresponding path program 2 times [2019-12-27 21:14:06,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:06,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312659649] [2019-12-27 21:14:06,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:06,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312659649] [2019-12-27 21:14:06,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:06,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:14:06,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [366887549] [2019-12-27 21:14:06,922 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:06,929 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:06,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 56 transitions. [2019-12-27 21:14:06,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:06,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:14:06,964 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:14:06,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:14:06,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:06,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:14:06,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:14:06,965 INFO L87 Difference]: Start difference. First operand 22086 states and 66380 transitions. Second operand 9 states. [2019-12-27 21:14:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:10,172 INFO L93 Difference]: Finished difference Result 49937 states and 145534 transitions. [2019-12-27 21:14:10,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 21:14:10,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 21:14:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:10,276 INFO L225 Difference]: With dead ends: 49937 [2019-12-27 21:14:10,276 INFO L226 Difference]: Without dead ends: 49937 [2019-12-27 21:14:10,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 21:14:10,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49937 states. [2019-12-27 21:14:10,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49937 to 21809. [2019-12-27 21:14:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21809 states. [2019-12-27 21:14:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21809 states to 21809 states and 65494 transitions. [2019-12-27 21:14:10,834 INFO L78 Accepts]: Start accepts. Automaton has 21809 states and 65494 transitions. Word has length 34 [2019-12-27 21:14:10,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:10,835 INFO L462 AbstractCegarLoop]: Abstraction has 21809 states and 65494 transitions. [2019-12-27 21:14:10,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:14:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 21809 states and 65494 transitions. [2019-12-27 21:14:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:14:10,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:10,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:14:10,868 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-27 21:14:10,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:10,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2067431116, now seen corresponding path program 1 times [2019-12-27 21:14:10,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:10,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678535042] [2019-12-27 21:14:10,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:11,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678535042] [2019-12-27 21:14:11,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:11,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:14:11,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1613944116] [2019-12-27 21:14:11,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:11,150 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:11,219 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 355 transitions. [2019-12-27 21:14:11,219 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:11,320 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:14:11,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:14:11,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:11,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:14:11,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:14:11,321 INFO L87 Difference]: Start difference. First operand 21809 states and 65494 transitions. Second operand 7 states. [2019-12-27 21:14:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:11,891 INFO L93 Difference]: Finished difference Result 41973 states and 126408 transitions. [2019-12-27 21:14:11,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:14:11,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-27 21:14:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:11,940 INFO L225 Difference]: With dead ends: 41973 [2019-12-27 21:14:11,940 INFO L226 Difference]: Without dead ends: 23340 [2019-12-27 21:14:11,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:14:12,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23340 states. [2019-12-27 21:14:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23340 to 19570. [2019-12-27 21:14:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19570 states. [2019-12-27 21:14:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19570 states to 19570 states and 57630 transitions. [2019-12-27 21:14:12,272 INFO L78 Accepts]: Start accepts. Automaton has 19570 states and 57630 transitions. Word has length 39 [2019-12-27 21:14:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:12,272 INFO L462 AbstractCegarLoop]: Abstraction has 19570 states and 57630 transitions. [2019-12-27 21:14:12,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:14:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 19570 states and 57630 transitions. [2019-12-27 21:14:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:14:12,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:12,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:14:12,290 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-27 21:14:12,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:12,290 INFO L82 PathProgramCache]: Analyzing trace with hash -757785660, now seen corresponding path program 2 times [2019-12-27 21:14:12,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:12,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034732940] [2019-12-27 21:14:12,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:12,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034732940] [2019-12-27 21:14:12,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:12,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:14:12,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1261144634] [2019-12-27 21:14:12,347 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:12,354 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:12,415 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 21:14:12,415 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:12,428 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:14:12,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:14:12,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:12,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:14:12,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:14:12,429 INFO L87 Difference]: Start difference. First operand 19570 states and 57630 transitions. Second operand 4 states. [2019-12-27 21:14:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:12,574 INFO L93 Difference]: Finished difference Result 34672 states and 102113 transitions. [2019-12-27 21:14:12,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:14:12,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 21:14:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:12,598 INFO L225 Difference]: With dead ends: 34672 [2019-12-27 21:14:12,598 INFO L226 Difference]: Without dead ends: 17443 [2019-12-27 21:14:12,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:14:12,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17443 states. [2019-12-27 21:14:12,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17443 to 17386. [2019-12-27 21:14:12,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17386 states. [2019-12-27 21:14:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17386 states to 17386 states and 49950 transitions. [2019-12-27 21:14:12,833 INFO L78 Accepts]: Start accepts. Automaton has 17386 states and 49950 transitions. Word has length 39 [2019-12-27 21:14:12,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:12,834 INFO L462 AbstractCegarLoop]: Abstraction has 17386 states and 49950 transitions. [2019-12-27 21:14:12,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:14:12,834 INFO L276 IsEmpty]: Start isEmpty. Operand 17386 states and 49950 transitions. [2019-12-27 21:14:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 21:14:12,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:12,849 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-27 21:14:12,849 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-27 21:14:12,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:12,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1539619421, now seen corresponding path program 1 times [2019-12-27 21:14:12,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:12,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188069664] [2019-12-27 21:14:12,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:12,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188069664] [2019-12-27 21:14:12,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:12,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:14:12,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [604768269] [2019-12-27 21:14:12,906 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:12,914 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:13,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 21:14:13,001 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:13,038 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:14:13,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:14:13,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:13,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:14:13,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:14:13,040 INFO L87 Difference]: Start difference. First operand 17386 states and 49950 transitions. Second operand 7 states. [2019-12-27 21:14:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:13,112 INFO L93 Difference]: Finished difference Result 16160 states and 47184 transitions. [2019-12-27 21:14:13,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:14:13,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 21:14:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:13,134 INFO L225 Difference]: With dead ends: 16160 [2019-12-27 21:14:13,134 INFO L226 Difference]: Without dead ends: 13131 [2019-12-27 21:14:13,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:14:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13131 states. [2019-12-27 21:14:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13131 to 12213. [2019-12-27 21:14:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12213 states. [2019-12-27 21:14:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12213 states to 12213 states and 37837 transitions. [2019-12-27 21:14:13,325 INFO L78 Accepts]: Start accepts. Automaton has 12213 states and 37837 transitions. Word has length 40 [2019-12-27 21:14:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:13,325 INFO L462 AbstractCegarLoop]: Abstraction has 12213 states and 37837 transitions. [2019-12-27 21:14:13,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:14:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 12213 states and 37837 transitions. [2019-12-27 21:14:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:14:13,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:13,338 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] [2019-12-27 21:14:13,338 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-27 21:14:13,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:13,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1729634848, now seen corresponding path program 1 times [2019-12-27 21:14:13,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:13,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411413909] [2019-12-27 21:14:13,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:13,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411413909] [2019-12-27 21:14:13,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:13,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:14:13,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [842795665] [2019-12-27 21:14:13,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:13,489 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:13,865 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 248 states and 487 transitions. [2019-12-27 21:14:13,865 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:14,079 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 21:14:14,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:14:14,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:14,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:14:14,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:14:14,080 INFO L87 Difference]: Start difference. First operand 12213 states and 37837 transitions. Second operand 11 states. [2019-12-27 21:14:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:17,603 INFO L93 Difference]: Finished difference Result 80487 states and 241300 transitions. [2019-12-27 21:14:17,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 21:14:17,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 21:14:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:17,684 INFO L225 Difference]: With dead ends: 80487 [2019-12-27 21:14:17,684 INFO L226 Difference]: Without dead ends: 60492 [2019-12-27 21:14:17,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 29 SyntacticMatches, 14 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=710, Invalid=2830, Unknown=0, NotChecked=0, Total=3540 [2019-12-27 21:14:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60492 states. [2019-12-27 21:14:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60492 to 14200. [2019-12-27 21:14:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14200 states. [2019-12-27 21:14:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14200 states to 14200 states and 44003 transitions. [2019-12-27 21:14:18,215 INFO L78 Accepts]: Start accepts. Automaton has 14200 states and 44003 transitions. Word has length 64 [2019-12-27 21:14:18,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:18,215 INFO L462 AbstractCegarLoop]: Abstraction has 14200 states and 44003 transitions. [2019-12-27 21:14:18,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:14:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 14200 states and 44003 transitions. [2019-12-27 21:14:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:14:18,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:18,230 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] [2019-12-27 21:14:18,231 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-27 21:14:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2099431100, now seen corresponding path program 2 times [2019-12-27 21:14:18,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:18,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019450036] [2019-12-27 21:14:18,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:18,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019450036] [2019-12-27 21:14:18,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:18,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:14:18,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1610365912] [2019-12-27 21:14:18,517 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:18,537 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:18,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 332 transitions. [2019-12-27 21:14:18,678 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:18,744 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:14:18,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:14:18,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:18,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:14:18,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:14:18,745 INFO L87 Difference]: Start difference. First operand 14200 states and 44003 transitions. Second operand 10 states. [2019-12-27 21:14:20,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:20,433 INFO L93 Difference]: Finished difference Result 36699 states and 110238 transitions. [2019-12-27 21:14:20,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:14:20,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 21:14:20,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:20,472 INFO L225 Difference]: With dead ends: 36699 [2019-12-27 21:14:20,472 INFO L226 Difference]: Without dead ends: 27159 [2019-12-27 21:14:20,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:14:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27159 states. [2019-12-27 21:14:20,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27159 to 16055. [2019-12-27 21:14:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16055 states. [2019-12-27 21:14:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16055 states to 16055 states and 49323 transitions. [2019-12-27 21:14:20,801 INFO L78 Accepts]: Start accepts. Automaton has 16055 states and 49323 transitions. Word has length 64 [2019-12-27 21:14:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:20,801 INFO L462 AbstractCegarLoop]: Abstraction has 16055 states and 49323 transitions. [2019-12-27 21:14:20,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:14:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 16055 states and 49323 transitions. [2019-12-27 21:14:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:14:20,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:20,818 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] [2019-12-27 21:14:20,819 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-27 21:14:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:20,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1686766406, now seen corresponding path program 3 times [2019-12-27 21:14:20,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:20,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645691779] [2019-12-27 21:14:20,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:20,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645691779] [2019-12-27 21:14:20,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:20,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:14:20,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [874155927] [2019-12-27 21:14:20,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:20,925 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:21,142 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 284 states and 557 transitions. [2019-12-27 21:14:21,142 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:21,337 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 21:14:21,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:14:21,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:21,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:14:21,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:14:21,338 INFO L87 Difference]: Start difference. First operand 16055 states and 49323 transitions. Second operand 11 states. [2019-12-27 21:14:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:23,245 INFO L93 Difference]: Finished difference Result 33035 states and 100301 transitions. [2019-12-27 21:14:23,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:14:23,246 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 21:14:23,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:23,281 INFO L225 Difference]: With dead ends: 33035 [2019-12-27 21:14:23,281 INFO L226 Difference]: Without dead ends: 24689 [2019-12-27 21:14:23,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:14:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-27 21:14:23,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16343. [2019-12-27 21:14:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16343 states. [2019-12-27 21:14:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16343 states to 16343 states and 50175 transitions. [2019-12-27 21:14:23,598 INFO L78 Accepts]: Start accepts. Automaton has 16343 states and 50175 transitions. Word has length 64 [2019-12-27 21:14:23,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:23,598 INFO L462 AbstractCegarLoop]: Abstraction has 16343 states and 50175 transitions. [2019-12-27 21:14:23,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:14:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 16343 states and 50175 transitions. [2019-12-27 21:14:23,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:14:23,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:23,617 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] [2019-12-27 21:14:23,618 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-27 21:14:23,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:23,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2033773150, now seen corresponding path program 4 times [2019-12-27 21:14:23,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:23,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607126082] [2019-12-27 21:14:23,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:23,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:23,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607126082] [2019-12-27 21:14:23,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:23,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:14:23,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [322045364] [2019-12-27 21:14:23,782 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:23,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:23,984 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 339 transitions. [2019-12-27 21:14:23,984 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:24,182 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 21:14:24,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:14:24,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:24,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:14:24,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:14:24,183 INFO L87 Difference]: Start difference. First operand 16343 states and 50175 transitions. Second operand 11 states. [2019-12-27 21:14:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:29,493 INFO L93 Difference]: Finished difference Result 66342 states and 201578 transitions. [2019-12-27 21:14:29,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 21:14:29,493 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 21:14:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:29,587 INFO L225 Difference]: With dead ends: 66342 [2019-12-27 21:14:29,587 INFO L226 Difference]: Without dead ends: 66342 [2019-12-27 21:14:29,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=362, Invalid=1278, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 21:14:29,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66342 states. [2019-12-27 21:14:30,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66342 to 16343. [2019-12-27 21:14:30,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16343 states. [2019-12-27 21:14:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16343 states to 16343 states and 50175 transitions. [2019-12-27 21:14:30,212 INFO L78 Accepts]: Start accepts. Automaton has 16343 states and 50175 transitions. Word has length 64 [2019-12-27 21:14:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:30,215 INFO L462 AbstractCegarLoop]: Abstraction has 16343 states and 50175 transitions. [2019-12-27 21:14:30,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:14:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 16343 states and 50175 transitions. [2019-12-27 21:14:30,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:14:30,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:30,235 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] [2019-12-27 21:14:30,235 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-27 21:14:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:30,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1056383140, now seen corresponding path program 5 times [2019-12-27 21:14:30,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:30,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002262844] [2019-12-27 21:14:30,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:30,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002262844] [2019-12-27 21:14:30,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:30,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:14:30,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [101980298] [2019-12-27 21:14:30,302 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:30,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:30,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 397 transitions. [2019-12-27 21:14:30,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:30,512 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:14:30,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:14:30,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:30,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:14:30,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:30,513 INFO L87 Difference]: Start difference. First operand 16343 states and 50175 transitions. Second operand 3 states. [2019-12-27 21:14:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:30,610 INFO L93 Difference]: Finished difference Result 18900 states and 57905 transitions. [2019-12-27 21:14:30,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:14:30,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 21:14:30,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:30,634 INFO L225 Difference]: With dead ends: 18900 [2019-12-27 21:14:30,635 INFO L226 Difference]: Without dead ends: 18900 [2019-12-27 21:14:30,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18900 states. [2019-12-27 21:14:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18900 to 16943. [2019-12-27 21:14:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16943 states. [2019-12-27 21:14:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16943 states to 16943 states and 52160 transitions. [2019-12-27 21:14:30,911 INFO L78 Accepts]: Start accepts. Automaton has 16943 states and 52160 transitions. Word has length 64 [2019-12-27 21:14:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:30,911 INFO L462 AbstractCegarLoop]: Abstraction has 16943 states and 52160 transitions. [2019-12-27 21:14:30,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:14:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 16943 states and 52160 transitions. [2019-12-27 21:14:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:14:30,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:30,930 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] [2019-12-27 21:14:30,930 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-27 21:14:30,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:30,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1170002163, now seen corresponding path program 1 times [2019-12-27 21:14:30,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:30,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474321239] [2019-12-27 21:14:30,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:30,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:30,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474321239] [2019-12-27 21:14:30,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:30,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:14:30,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1013187408] [2019-12-27 21:14:30,987 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:31,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:31,568 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 230 states and 441 transitions. [2019-12-27 21:14:31,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:31,600 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:14:31,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:14:31,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:31,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:14:31,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:14:31,602 INFO L87 Difference]: Start difference. First operand 16943 states and 52160 transitions. Second operand 5 states. [2019-12-27 21:14:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:32,313 INFO L93 Difference]: Finished difference Result 32273 states and 98975 transitions. [2019-12-27 21:14:32,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:14:32,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 21:14:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:32,389 INFO L225 Difference]: With dead ends: 32273 [2019-12-27 21:14:32,389 INFO L226 Difference]: Without dead ends: 32273 [2019-12-27 21:14:32,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:14:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32273 states. [2019-12-27 21:14:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32273 to 18786. [2019-12-27 21:14:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18786 states. [2019-12-27 21:14:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18786 states to 18786 states and 58154 transitions. [2019-12-27 21:14:32,846 INFO L78 Accepts]: Start accepts. Automaton has 18786 states and 58154 transitions. Word has length 65 [2019-12-27 21:14:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:32,846 INFO L462 AbstractCegarLoop]: Abstraction has 18786 states and 58154 transitions. [2019-12-27 21:14:32,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:14:32,846 INFO L276 IsEmpty]: Start isEmpty. Operand 18786 states and 58154 transitions. [2019-12-27 21:14:32,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:14:32,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:32,867 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] [2019-12-27 21:14:32,867 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-27 21:14:32,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:32,868 INFO L82 PathProgramCache]: Analyzing trace with hash -162352739, now seen corresponding path program 2 times [2019-12-27 21:14:32,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:32,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701208708] [2019-12-27 21:14:32,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:32,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701208708] [2019-12-27 21:14:32,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:32,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:14:32,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1951192162] [2019-12-27 21:14:32,914 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:32,935 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:33,149 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 421 transitions. [2019-12-27 21:14:33,149 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:33,150 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:14:33,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:14:33,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:33,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:14:33,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:33,151 INFO L87 Difference]: Start difference. First operand 18786 states and 58154 transitions. Second operand 3 states. [2019-12-27 21:14:33,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:33,347 INFO L93 Difference]: Finished difference Result 27204 states and 84265 transitions. [2019-12-27 21:14:33,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:14:33,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:14:33,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:33,388 INFO L225 Difference]: With dead ends: 27204 [2019-12-27 21:14:33,388 INFO L226 Difference]: Without dead ends: 27204 [2019-12-27 21:14:33,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:33,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27204 states. [2019-12-27 21:14:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27204 to 18918. [2019-12-27 21:14:33,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18918 states. [2019-12-27 21:14:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18918 states to 18918 states and 58536 transitions. [2019-12-27 21:14:33,741 INFO L78 Accepts]: Start accepts. Automaton has 18918 states and 58536 transitions. Word has length 65 [2019-12-27 21:14:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:33,741 INFO L462 AbstractCegarLoop]: Abstraction has 18918 states and 58536 transitions. [2019-12-27 21:14:33,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:14:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 18918 states and 58536 transitions. [2019-12-27 21:14:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:14:33,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:33,763 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] [2019-12-27 21:14:33,763 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-27 21:14:33,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:33,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1707397215, now seen corresponding path program 3 times [2019-12-27 21:14:33,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:33,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952509412] [2019-12-27 21:14:33,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:33,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952509412] [2019-12-27 21:14:33,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:33,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:14:33,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082468562] [2019-12-27 21:14:33,868 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:33,888 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:34,355 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 407 transitions. [2019-12-27 21:14:34,356 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:34,503 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:14:34,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:14:34,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:34,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:14:34,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:14:34,505 INFO L87 Difference]: Start difference. First operand 18918 states and 58536 transitions. Second operand 12 states. [2019-12-27 21:14:36,091 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:14:36,452 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 21:14:37,393 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 21:14:37,900 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 21:14:38,905 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 21:14:39,174 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:14:39,378 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:14:39,597 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-27 21:14:40,649 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-12-27 21:14:41,471 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-12-27 21:14:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:43,754 INFO L93 Difference]: Finished difference Result 58066 states and 175891 transitions. [2019-12-27 21:14:43,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-27 21:14:43,754 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 21:14:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:43,821 INFO L225 Difference]: With dead ends: 58066 [2019-12-27 21:14:43,821 INFO L226 Difference]: Without dead ends: 50130 [2019-12-27 21:14:43,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2391 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1103, Invalid=5539, Unknown=0, NotChecked=0, Total=6642 [2019-12-27 21:14:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50130 states. [2019-12-27 21:14:44,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50130 to 19126. [2019-12-27 21:14:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19126 states. [2019-12-27 21:14:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19126 states to 19126 states and 59069 transitions. [2019-12-27 21:14:44,316 INFO L78 Accepts]: Start accepts. Automaton has 19126 states and 59069 transitions. Word has length 65 [2019-12-27 21:14:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:44,316 INFO L462 AbstractCegarLoop]: Abstraction has 19126 states and 59069 transitions. [2019-12-27 21:14:44,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:14:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 19126 states and 59069 transitions. [2019-12-27 21:14:44,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:14:44,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:44,335 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] [2019-12-27 21:14:44,335 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-27 21:14:44,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:44,335 INFO L82 PathProgramCache]: Analyzing trace with hash 812378529, now seen corresponding path program 4 times [2019-12-27 21:14:44,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:44,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046459665] [2019-12-27 21:14:44,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:44,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046459665] [2019-12-27 21:14:44,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:44,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:14:44,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1610227443] [2019-12-27 21:14:44,456 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:44,477 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:44,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 408 transitions. [2019-12-27 21:14:44,714 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:44,738 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:14:44,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:14:44,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:44,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:14:44,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:14:44,739 INFO L87 Difference]: Start difference. First operand 19126 states and 59069 transitions. Second operand 10 states. [2019-12-27 21:14:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:46,045 INFO L93 Difference]: Finished difference Result 48643 states and 146148 transitions. [2019-12-27 21:14:46,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:14:46,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 21:14:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:46,101 INFO L225 Difference]: With dead ends: 48643 [2019-12-27 21:14:46,101 INFO L226 Difference]: Without dead ends: 41291 [2019-12-27 21:14:46,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2019-12-27 21:14:46,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41291 states. [2019-12-27 21:14:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41291 to 18471. [2019-12-27 21:14:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18471 states. [2019-12-27 21:14:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18471 states to 18471 states and 56699 transitions. [2019-12-27 21:14:46,555 INFO L78 Accepts]: Start accepts. Automaton has 18471 states and 56699 transitions. Word has length 65 [2019-12-27 21:14:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:46,555 INFO L462 AbstractCegarLoop]: Abstraction has 18471 states and 56699 transitions. [2019-12-27 21:14:46,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:14:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 18471 states and 56699 transitions. [2019-12-27 21:14:46,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:14:46,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:46,576 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] [2019-12-27 21:14:46,576 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-27 21:14:46,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:46,576 INFO L82 PathProgramCache]: Analyzing trace with hash 393402024, now seen corresponding path program 1 times [2019-12-27 21:14:46,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:46,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83538464] [2019-12-27 21:14:46,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:46,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83538464] [2019-12-27 21:14:46,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:46,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:14:46,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [62648889] [2019-12-27 21:14:46,639 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:46,659 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:47,189 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 250 states and 458 transitions. [2019-12-27 21:14:47,189 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:47,190 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:14:47,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:14:47,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:47,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:14:47,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:47,191 INFO L87 Difference]: Start difference. First operand 18471 states and 56699 transitions. Second operand 3 states. [2019-12-27 21:14:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:47,250 INFO L93 Difference]: Finished difference Result 18471 states and 56698 transitions. [2019-12-27 21:14:47,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:14:47,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:14:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:47,281 INFO L225 Difference]: With dead ends: 18471 [2019-12-27 21:14:47,281 INFO L226 Difference]: Without dead ends: 18471 [2019-12-27 21:14:47,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:14:47,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18471 states. [2019-12-27 21:14:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18471 to 16316. [2019-12-27 21:14:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16316 states. [2019-12-27 21:14:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16316 states to 16316 states and 50732 transitions. [2019-12-27 21:14:47,550 INFO L78 Accepts]: Start accepts. Automaton has 16316 states and 50732 transitions. Word has length 65 [2019-12-27 21:14:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:47,550 INFO L462 AbstractCegarLoop]: Abstraction has 16316 states and 50732 transitions. [2019-12-27 21:14:47,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:14:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 16316 states and 50732 transitions. [2019-12-27 21:14:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:14:47,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:47,568 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-27 21:14:47,568 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-27 21:14:47,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:47,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1214771677, now seen corresponding path program 1 times [2019-12-27 21:14:47,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:47,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092965479] [2019-12-27 21:14:47,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:14:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:14:47,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092965479] [2019-12-27 21:14:47,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:14:47,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:14:47,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1939383687] [2019-12-27 21:14:47,626 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:14:47,646 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:14:47,932 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 247 states and 438 transitions. [2019-12-27 21:14:47,933 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:14:47,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:14:47,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:14:47,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:14:47,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:14:47,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:14:47,942 INFO L87 Difference]: Start difference. First operand 16316 states and 50732 transitions. Second operand 4 states. [2019-12-27 21:14:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:14:47,993 INFO L93 Difference]: Finished difference Result 11507 states and 35457 transitions. [2019-12-27 21:14:47,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:14:47,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 21:14:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:14:48,008 INFO L225 Difference]: With dead ends: 11507 [2019-12-27 21:14:48,009 INFO L226 Difference]: Without dead ends: 11507 [2019-12-27 21:14:48,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:14:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11507 states. [2019-12-27 21:14:48,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11507 to 11507. [2019-12-27 21:14:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11507 states. [2019-12-27 21:14:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11507 states to 11507 states and 35457 transitions. [2019-12-27 21:14:48,185 INFO L78 Accepts]: Start accepts. Automaton has 11507 states and 35457 transitions. Word has length 66 [2019-12-27 21:14:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:14:48,186 INFO L462 AbstractCegarLoop]: Abstraction has 11507 states and 35457 transitions. [2019-12-27 21:14:48,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:14:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 11507 states and 35457 transitions. [2019-12-27 21:14:48,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:14:48,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:14:48,198 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-27 21:14:48,198 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-27 21:14:48,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:14:48,199 INFO L82 PathProgramCache]: Analyzing trace with hash -611821270, now seen corresponding path program 1 times [2019-12-27 21:14:48,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:14:48,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633360344] [2019-12-27 21:14:48,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:14:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:14:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:14:48,314 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:14:48,314 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:14:48,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= v_~x~0_11 0) (= 0 v_~a$mem_tmp~0_9) (= v_~a~0_26 0) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y~0_14 0) (= v_~a$r_buff0_thd2~0_19 0) (= |v_#NULL.offset_6| 0) (= 0 v_~a$read_delayed~0_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1105~0.base_23|) 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$r_buff1_thd1~0_19) (= 0 v_~z~0_6) (= 0 |v_ULTIMATE.start_main_~#t1105~0.offset_18|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1105~0.base_23| 4)) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~a$r_buff1_thd3~0_52) (= v_~a$r_buff0_thd3~0_77 0) (= v_~a$flush_delayed~0_12 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1105~0.base_23| 1) |v_#valid_63|) (= 0 v_~a$r_buff1_thd0~0_26) (= 0 v_~a$w_buff0~0_23) (= 0 v_~a$w_buff0_used~0_113) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~a$r_buff0_thd1~0_28 0) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1105~0.base_23|) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 v_~a$r_buff1_thd2~0_21) (= 0 v_~a$w_buff1~0_25) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1105~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1105~0.base_23|) |v_ULTIMATE.start_main_~#t1105~0.offset_18| 0)) |v_#memory_int_21|) (= 0 v_~a$w_buff1_used~0_76))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1107~0.offset=|v_ULTIMATE.start_main_~#t1107~0.offset_16|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t1106~0.base=|v_ULTIMATE.start_main_~#t1106~0.base_21|, ULTIMATE.start_main_~#t1105~0.base=|v_ULTIMATE.start_main_~#t1105~0.base_23|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_113, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1105~0.offset=|v_ULTIMATE.start_main_~#t1105~0.offset_18|, ~a$w_buff0~0=v_~a$w_buff0~0_23, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_26, ULTIMATE.start_main_~#t1106~0.offset=|v_ULTIMATE.start_main_~#t1106~0.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_11, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ULTIMATE.start_main_~#t1107~0.base=|v_ULTIMATE.start_main_~#t1107~0.base_20|, ~a$mem_tmp~0=v_~a$mem_tmp~0_9, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_19, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_6, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_76, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1107~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1106~0.base, ULTIMATE.start_main_~#t1105~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1105~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t1106~0.offset, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1107~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 21:14:48,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1106~0.base_9| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1106~0.base_9| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1106~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1106~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1106~0.base_9|) |v_ULTIMATE.start_main_~#t1106~0.offset_7| 1))) (= |v_ULTIMATE.start_main_~#t1106~0.offset_7| 0) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1106~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1106~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1106~0.offset=|v_ULTIMATE.start_main_~#t1106~0.offset_7|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1106~0.base=|v_ULTIMATE.start_main_~#t1106~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1106~0.offset, #length, ULTIMATE.start_main_~#t1106~0.base] because there is no mapped edge [2019-12-27 21:14:48,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t1107~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1107~0.base_9|)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1107~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1107~0.base_9|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1107~0.base_9| 4) |v_#length_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1107~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1107~0.base_9|) |v_ULTIMATE.start_main_~#t1107~0.offset_8| 2))) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1107~0.base_9| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1107~0.offset=|v_ULTIMATE.start_main_~#t1107~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1107~0.base=|v_ULTIMATE.start_main_~#t1107~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1107~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1107~0.base] because there is no mapped edge [2019-12-27 21:14:48,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L4-->L748: Formula: (and (= ~a$r_buff1_thd1~0_Out962872878 ~a$r_buff0_thd1~0_In962872878) (= ~a$r_buff1_thd3~0_Out962872878 ~a$r_buff0_thd3~0_In962872878) (= ~a$r_buff0_thd2~0_In962872878 ~a$r_buff1_thd2~0_Out962872878) (= ~a$r_buff0_thd0~0_In962872878 ~a$r_buff1_thd0~0_Out962872878) (= ~a$r_buff0_thd1~0_Out962872878 1) (= ~x~0_In962872878 ~__unbuffered_p0_EAX~0_Out962872878) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In962872878 0))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In962872878, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In962872878, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In962872878, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In962872878, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In962872878, ~x~0=~x~0_In962872878} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out962872878, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out962872878, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out962872878, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out962872878, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out962872878, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In962872878, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In962872878, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In962872878, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out962872878, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In962872878, ~x~0=~x~0_In962872878} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:14:48,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-211845818| |P1Thread1of1ForFork2_#t~ite10_Out-211845818|)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-211845818 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-211845818 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-211845818| ~a$w_buff1~0_In-211845818) (not .cse1) (not .cse2)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out-211845818| ~a~0_In-211845818) (or .cse2 .cse1)))) InVars {~a~0=~a~0_In-211845818, ~a$w_buff1~0=~a$w_buff1~0_In-211845818, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-211845818, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-211845818} OutVars{~a~0=~a~0_In-211845818, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-211845818|, ~a$w_buff1~0=~a$w_buff1~0_In-211845818, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-211845818, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out-211845818|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-211845818} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 21:14:48,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In237064098 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In237064098| |P2Thread1of1ForFork0_#t~ite20_Out237064098|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite21_Out237064098| ~a$w_buff0~0_In237064098)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In237064098 256)))) (or (= (mod ~a$w_buff0_used~0_In237064098 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In237064098 256)) .cse1) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In237064098 256))))) (= |P2Thread1of1ForFork0_#t~ite20_Out237064098| ~a$w_buff0~0_In237064098) (= |P2Thread1of1ForFork0_#t~ite21_Out237064098| |P2Thread1of1ForFork0_#t~ite20_Out237064098|) .cse0))) InVars {~a$w_buff0~0=~a$w_buff0~0_In237064098, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In237064098, ~a$w_buff0_used~0=~a$w_buff0_used~0_In237064098, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In237064098, ~a$w_buff1_used~0=~a$w_buff1_used~0_In237064098, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In237064098|, ~weak$$choice2~0=~weak$$choice2~0_In237064098} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out237064098|, ~a$w_buff0~0=~a$w_buff0~0_In237064098, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In237064098, ~a$w_buff0_used~0=~a$w_buff0_used~0_In237064098, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In237064098, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out237064098|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In237064098, ~weak$$choice2~0=~weak$$choice2~0_In237064098} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 21:14:48,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In485011376 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In485011376 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out485011376| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In485011376 |P1Thread1of1ForFork2_#t~ite11_Out485011376|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In485011376, ~a$w_buff0_used~0=~a$w_buff0_used~0_In485011376} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In485011376, ~a$w_buff0_used~0=~a$w_buff0_used~0_In485011376, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out485011376|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 21:14:48,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-752195637 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-752195637 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-752195637 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-752195637 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-752195637 |P1Thread1of1ForFork2_#t~ite12_Out-752195637|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-752195637|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-752195637, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-752195637, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-752195637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-752195637} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-752195637, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-752195637, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-752195637, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-752195637|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-752195637} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 21:14:48,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L797-->L797-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1936152785 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out1936152785| |P2Thread1of1ForFork0_#t~ite23_Out1936152785|) .cse0 (= ~a$w_buff1~0_In1936152785 |P2Thread1of1ForFork0_#t~ite23_Out1936152785|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1936152785 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In1936152785 256)) (and (= 0 (mod ~a$w_buff1_used~0_In1936152785 256)) .cse1) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1936152785 256)))))) (and (= ~a$w_buff1~0_In1936152785 |P2Thread1of1ForFork0_#t~ite24_Out1936152785|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In1936152785| |P2Thread1of1ForFork0_#t~ite23_Out1936152785|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In1936152785, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In1936152785|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1936152785, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1936152785, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1936152785, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1936152785, ~weak$$choice2~0=~weak$$choice2~0_In1936152785} OutVars{~a$w_buff1~0=~a$w_buff1~0_In1936152785, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out1936152785|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out1936152785|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1936152785, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1936152785, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1936152785, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1936152785, ~weak$$choice2~0=~weak$$choice2~0_In1936152785} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 21:14:48,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L798-->L798-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1342163523 256) 0))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1342163523 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In1342163523 256)) (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1342163523 256))) (and (= (mod ~a$w_buff1_used~0_In1342163523 256) 0) .cse0))) (= |P2Thread1of1ForFork0_#t~ite26_Out1342163523| ~a$w_buff0_used~0_In1342163523) (= |P2Thread1of1ForFork0_#t~ite26_Out1342163523| |P2Thread1of1ForFork0_#t~ite27_Out1342163523|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite27_Out1342163523| ~a$w_buff0_used~0_In1342163523) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In1342163523| |P2Thread1of1ForFork0_#t~ite26_Out1342163523|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1342163523|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1342163523, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1342163523, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1342163523, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1342163523, ~weak$$choice2~0=~weak$$choice2~0_In1342163523} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1342163523|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1342163523|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1342163523, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1342163523, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1342163523, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1342163523, ~weak$$choice2~0=~weak$$choice2~0_In1342163523} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 21:14:48,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1315659813 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1315659813 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1315659813|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd2~0_In1315659813 |P1Thread1of1ForFork2_#t~ite13_Out1315659813|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1315659813, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1315659813} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1315659813, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1315659813, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1315659813|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 21:14:48,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In863389006 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In863389006 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In863389006 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In863389006 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out863389006| ~a$r_buff1_thd2~0_In863389006) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out863389006| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In863389006, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In863389006, ~a$w_buff0_used~0=~a$w_buff0_used~0_In863389006, ~a$w_buff1_used~0=~a$w_buff1_used~0_In863389006} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In863389006, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In863389006, ~a$w_buff0_used~0=~a$w_buff0_used~0_In863389006, ~a$w_buff1_used~0=~a$w_buff1_used~0_In863389006, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out863389006|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 21:14:48,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L772-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_17) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 21:14:48,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_51 v_~a$r_buff0_thd3~0_50)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_50, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 21:14:48,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a~0_19 v_~a$mem_tmp~0_5) (= v_~a$flush_delayed~0_7 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_19, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 21:14:48,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-487317593 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-487317593 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-487317593| ~a~0_In-487317593)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-487317593| ~a$w_buff1~0_In-487317593) (not .cse1)))) InVars {~a~0=~a~0_In-487317593, ~a$w_buff1~0=~a$w_buff1~0_In-487317593, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-487317593, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-487317593} OutVars{~a~0=~a~0_In-487317593, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-487317593|, ~a$w_buff1~0=~a$w_buff1~0_In-487317593, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-487317593, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-487317593} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 21:14:48,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_16 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{~a~0=v_~a~0_16, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 21:14:48,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1128918884 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1128918884 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1128918884| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out1128918884| ~a$w_buff0_used~0_In1128918884)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1128918884, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1128918884} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1128918884|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1128918884, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1128918884} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 21:14:48,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1651424587 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1651424587 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1651424587|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1651424587 |P0Thread1of1ForFork1_#t~ite5_Out-1651424587|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1651424587, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1651424587} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1651424587|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1651424587, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1651424587} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 21:14:48,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-541807556 256))) (.cse3 (= (mod ~a$r_buff1_thd1~0_In-541807556 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-541807556 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-541807556 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-541807556| ~a$w_buff1_used~0_In-541807556) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite6_Out-541807556| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-541807556, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-541807556, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-541807556, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-541807556} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-541807556|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-541807556, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-541807556, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-541807556, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-541807556} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 21:14:48,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-1413387751 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1413387751 256) 0))) (or (and (= ~a$r_buff0_thd1~0_Out-1413387751 0) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_Out-1413387751 ~a$r_buff0_thd1~0_In-1413387751) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1413387751, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1413387751} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1413387751|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1413387751, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1413387751} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:14:48,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-898522060 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-898522060 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-898522060 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-898522060 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-898522060|)) (and (= ~a$r_buff1_thd1~0_In-898522060 |P0Thread1of1ForFork1_#t~ite8_Out-898522060|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-898522060, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-898522060, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-898522060, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-898522060} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-898522060|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-898522060, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-898522060, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-898522060, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-898522060} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:14:48,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L752-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:14:48,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-681838669 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-681838669 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In-681838669 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-681838669 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-681838669| 0)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-681838669| ~a$w_buff1_used~0_In-681838669) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-681838669, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-681838669, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-681838669, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-681838669} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-681838669, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-681838669, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-681838669, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-681838669, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-681838669|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 21:14:48,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1762813247 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1762813247 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1762813247| ~a$r_buff0_thd3~0_In-1762813247) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1762813247| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1762813247, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1762813247} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1762813247, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1762813247, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1762813247|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 21:14:48,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In2006504070 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2006504070 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In2006504070 256))) (.cse3 (= (mod ~a$r_buff1_thd3~0_In2006504070 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In2006504070 |P2Thread1of1ForFork0_#t~ite43_Out2006504070|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out2006504070| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2006504070, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2006504070, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2006504070, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2006504070} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out2006504070|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2006504070, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2006504070, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2006504070, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2006504070} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 21:14:48,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 21:14:48,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:14:48,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-453296220 256))) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-453296220 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-453296220| |ULTIMATE.start_main_#t~ite47_Out-453296220|))) (or (and (or .cse0 .cse1) (= ~a~0_In-453296220 |ULTIMATE.start_main_#t~ite47_Out-453296220|) .cse2) (and (not .cse0) (= ~a$w_buff1~0_In-453296220 |ULTIMATE.start_main_#t~ite47_Out-453296220|) (not .cse1) .cse2))) InVars {~a~0=~a~0_In-453296220, ~a$w_buff1~0=~a$w_buff1~0_In-453296220, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-453296220, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-453296220} OutVars{~a~0=~a~0_In-453296220, ~a$w_buff1~0=~a$w_buff1~0_In-453296220, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-453296220|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-453296220, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-453296220|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-453296220} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 21:14:48,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-970890987 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-970890987 256)))) (or (and (= ~a$w_buff0_used~0_In-970890987 |ULTIMATE.start_main_#t~ite49_Out-970890987|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-970890987|) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-970890987, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-970890987} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-970890987, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-970890987|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-970890987} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 21:14:48,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In258027767 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In258027767 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In258027767 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In258027767 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out258027767|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In258027767 |ULTIMATE.start_main_#t~ite50_Out258027767|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In258027767, ~a$w_buff0_used~0=~a$w_buff0_used~0_In258027767, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In258027767, ~a$w_buff1_used~0=~a$w_buff1_used~0_In258027767} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out258027767|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In258027767, ~a$w_buff0_used~0=~a$w_buff0_used~0_In258027767, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In258027767, ~a$w_buff1_used~0=~a$w_buff1_used~0_In258027767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 21:14:48,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In929093135 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In929093135 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out929093135|)) (and (= ~a$r_buff0_thd0~0_In929093135 |ULTIMATE.start_main_#t~ite51_Out929093135|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In929093135, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In929093135} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out929093135|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In929093135, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In929093135} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 21:14:48,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In1805733586 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1805733586 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1805733586 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1805733586 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out1805733586| ~a$r_buff1_thd0~0_In1805733586) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out1805733586| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1805733586, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1805733586, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1805733586, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1805733586} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1805733586|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1805733586, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1805733586, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1805733586, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1805733586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 21:14:48,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_10 0) (= 2 v_~y~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= |v_ULTIMATE.start_main_#t~ite52_12| v_~a$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_8} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:14:48,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:14:48 BasicIcfg [2019-12-27 21:14:48,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:14:48,421 INFO L168 Benchmark]: Toolchain (without parser) took 119421.38 ms. Allocated memory was 138.9 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 101.6 MB in the beginning and 962.8 MB in the end (delta: -861.2 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 21:14:48,421 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 21:14:48,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 852.30 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.2 MB in the beginning and 155.6 MB in the end (delta: -54.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:14:48,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.82 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 153.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:14:48,423 INFO L168 Benchmark]: Boogie Preprocessor took 43.74 ms. Allocated memory is still 202.4 MB. Free memory was 153.5 MB in the beginning and 150.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:14:48,424 INFO L168 Benchmark]: RCFGBuilder took 890.18 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 100.0 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:14:48,424 INFO L168 Benchmark]: TraceAbstraction took 117562.53 ms. Allocated memory was 202.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.0 MB in the beginning and 962.8 MB in the end (delta: -862.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 21:14:48,428 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 852.30 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.2 MB in the beginning and 155.6 MB in the end (delta: -54.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.82 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 153.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.74 ms. Allocated memory is still 202.4 MB. Free memory was 153.5 MB in the beginning and 150.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 890.18 ms. Allocated memory is still 202.4 MB. Free memory was 150.7 MB in the beginning and 100.0 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 117562.53 ms. Allocated memory was 202.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.0 MB in the beginning and 962.8 MB in the end (delta: -862.8 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 7189 VarBasedMoverChecksPositive, 222 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80962 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=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 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=2, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 117.2s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 50.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6951 SDtfs, 11675 SDslu, 19799 SDs, 0 SdLazy, 20062 SolverSat, 841 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 637 GetRequests, 169 SyntacticMatches, 45 SemanticMatches, 423 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5258 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141665occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 448421 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1235 NumberOfCodeBlocks, 1235 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1140 ConstructedInterpolants, 0 QuantifiedInterpolants, 174330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...