/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:06:33,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:06:33,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:06:33,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:06:33,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:06:33,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:06:33,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:06:33,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:06:33,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:06:33,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:06:33,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:06:33,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:06:33,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:06:33,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:06:33,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:06:33,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:06:33,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:06:33,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:06:33,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:06:33,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:06:33,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:06:33,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:06:33,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:06:33,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:06:33,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:06:33,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:06:33,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:06:33,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:06:33,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:06:33,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:06:33,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:06:33,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:06:33,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:06:33,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:06:33,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:06:33,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:06:33,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:06:33,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:06:33,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:06:33,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:06:33,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:06:33,774 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:06:33,802 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:06:33,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:06:33,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:06:33,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:06:33,805 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:06:33,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:06:33,806 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:06:33,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:06:33,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:06:33,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:06:33,807 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:06:33,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:06:33,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:06:33,808 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:06:33,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:06:33,808 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:06:33,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:06:33,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:06:33,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:06:33,809 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:06:33,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:06:33,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:06:33,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:06:33,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:06:33,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:06:33,810 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:06:33,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:06:33,811 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:06:33,811 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:06:33,811 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:06:34,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:06:34,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:06:34,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:06:34,129 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:06:34,130 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:06:34,131 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_rmo.oepc.i [2019-12-18 13:06:34,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085453e9c/1716b3fc0e48439abc160650318e4980/FLAG55c8c4bd9 [2019-12-18 13:06:34,803 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:06:34,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_rmo.oepc.i [2019-12-18 13:06:34,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085453e9c/1716b3fc0e48439abc160650318e4980/FLAG55c8c4bd9 [2019-12-18 13:06:35,029 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085453e9c/1716b3fc0e48439abc160650318e4980 [2019-12-18 13:06:35,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:06:35,042 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:06:35,043 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:06:35,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:06:35,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:06:35,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:06:35" (1/1) ... [2019-12-18 13:06:35,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5677aabb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:35, skipping insertion in model container [2019-12-18 13:06:35,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:06:35" (1/1) ... [2019-12-18 13:06:35,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:06:35,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:06:35,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:06:35,708 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:06:35,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:06:35,864 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:06:35,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:35 WrapperNode [2019-12-18 13:06:35,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:06:35,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:06:35,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:06:35,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:06:35,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:35" (1/1) ... [2019-12-18 13:06:35,898 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:35" (1/1) ... [2019-12-18 13:06:35,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:06:35,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:06:35,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:06:35,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:06:35,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:35" (1/1) ... [2019-12-18 13:06:35,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:35" (1/1) ... [2019-12-18 13:06:35,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:35" (1/1) ... [2019-12-18 13:06:35,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:35" (1/1) ... [2019-12-18 13:06:35,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:35" (1/1) ... [2019-12-18 13:06:35,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:35" (1/1) ... [2019-12-18 13:06:35,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:35" (1/1) ... [2019-12-18 13:06:35,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:06:35,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:06:35,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:06:35,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:06:35,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:06:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:06:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:06:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:06:36,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:06:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:06:36,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:06:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:06:36,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:06:36,056 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:06:36,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:06:36,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:06:36,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:06:36,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:06:36,059 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:06:36,866 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:06:36,866 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:06:36,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:06:36 BoogieIcfgContainer [2019-12-18 13:06:36,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:06:36,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:06:36,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:06:36,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:06:36,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:06:35" (1/3) ... [2019-12-18 13:06:36,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e45f8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:06:36, skipping insertion in model container [2019-12-18 13:06:36,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:06:35" (2/3) ... [2019-12-18 13:06:36,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e45f8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:06:36, skipping insertion in model container [2019-12-18 13:06:36,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:06:36" (3/3) ... [2019-12-18 13:06:36,882 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_rmo.oepc.i [2019-12-18 13:06:36,893 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:06:36,893 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:06:36,901 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:06:36,902 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:06:36,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,948 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,948 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,948 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,949 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,949 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,963 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,999 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:36,999 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,028 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,029 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,031 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,032 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,036 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,036 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,037 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,038 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,038 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,039 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,040 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:06:37,062 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:06:37,082 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:06:37,082 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:06:37,082 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:06:37,082 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:06:37,083 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:06:37,083 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:06:37,083 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:06:37,083 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:06:37,099 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 13:06:37,101 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 13:06:37,222 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 13:06:37,222 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:06:37,246 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:06:37,273 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 13:06:37,360 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 13:06:37,361 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:06:37,372 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:06:37,397 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:06:37,398 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:06:43,520 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 13:06:43,660 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:06:43,688 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87070 [2019-12-18 13:06:43,689 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 13:06:43,693 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 13:07:01,914 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-18 13:07:01,916 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-18 13:07:01,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:07:01,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:01,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:07:01,923 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:01,929 INFO L82 PathProgramCache]: Analyzing trace with hash 911890, now seen corresponding path program 1 times [2019-12-18 13:07:01,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:01,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961408651] [2019-12-18 13:07:01,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:02,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961408651] [2019-12-18 13:07:02,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:02,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:07:02,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489221248] [2019-12-18 13:07:02,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:07:02,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:02,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:07:02,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:02,190 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-18 13:07:05,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:05,583 INFO L93 Difference]: Finished difference Result 114158 states and 484836 transitions. [2019-12-18 13:07:05,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:07:05,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:07:05,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:06,319 INFO L225 Difference]: With dead ends: 114158 [2019-12-18 13:07:06,319 INFO L226 Difference]: Without dead ends: 107060 [2019-12-18 13:07:06,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107060 states. [2019-12-18 13:07:14,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107060 to 107060. [2019-12-18 13:07:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107060 states. [2019-12-18 13:07:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107060 states to 107060 states and 454078 transitions. [2019-12-18 13:07:14,507 INFO L78 Accepts]: Start accepts. Automaton has 107060 states and 454078 transitions. Word has length 3 [2019-12-18 13:07:14,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:14,507 INFO L462 AbstractCegarLoop]: Abstraction has 107060 states and 454078 transitions. [2019-12-18 13:07:14,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:07:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 107060 states and 454078 transitions. [2019-12-18 13:07:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:07:14,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:14,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:14,512 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:14,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:14,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1487504284, now seen corresponding path program 1 times [2019-12-18 13:07:14,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:14,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73823715] [2019-12-18 13:07:14,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:14,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73823715] [2019-12-18 13:07:14,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:14,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:07:14,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542551779] [2019-12-18 13:07:14,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:07:14,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:14,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:07:14,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:07:14,688 INFO L87 Difference]: Start difference. First operand 107060 states and 454078 transitions. Second operand 4 states. [2019-12-18 13:07:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:19,598 INFO L93 Difference]: Finished difference Result 166396 states and 678148 transitions. [2019-12-18 13:07:19,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:07:19,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:07:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:21,206 INFO L225 Difference]: With dead ends: 166396 [2019-12-18 13:07:21,206 INFO L226 Difference]: Without dead ends: 166347 [2019-12-18 13:07:21,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:07:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166347 states. [2019-12-18 13:07:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166347 to 151934. [2019-12-18 13:07:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151934 states. [2019-12-18 13:07:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151934 states to 151934 states and 627001 transitions. [2019-12-18 13:07:35,004 INFO L78 Accepts]: Start accepts. Automaton has 151934 states and 627001 transitions. Word has length 11 [2019-12-18 13:07:35,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:35,004 INFO L462 AbstractCegarLoop]: Abstraction has 151934 states and 627001 transitions. [2019-12-18 13:07:35,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:07:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 151934 states and 627001 transitions. [2019-12-18 13:07:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:07:35,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:35,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:35,011 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:35,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:35,011 INFO L82 PathProgramCache]: Analyzing trace with hash 881606285, now seen corresponding path program 1 times [2019-12-18 13:07:35,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:35,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405701624] [2019-12-18 13:07:35,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:35,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405701624] [2019-12-18 13:07:35,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:35,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:07:35,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505656176] [2019-12-18 13:07:35,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:07:35,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:35,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:07:35,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:35,076 INFO L87 Difference]: Start difference. First operand 151934 states and 627001 transitions. Second operand 3 states. [2019-12-18 13:07:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:35,229 INFO L93 Difference]: Finished difference Result 33114 states and 107084 transitions. [2019-12-18 13:07:35,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:07:35,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:07:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:35,326 INFO L225 Difference]: With dead ends: 33114 [2019-12-18 13:07:35,327 INFO L226 Difference]: Without dead ends: 33114 [2019-12-18 13:07:35,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33114 states. [2019-12-18 13:07:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33114 to 33114. [2019-12-18 13:07:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33114 states. [2019-12-18 13:07:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33114 states to 33114 states and 107084 transitions. [2019-12-18 13:07:36,033 INFO L78 Accepts]: Start accepts. Automaton has 33114 states and 107084 transitions. Word has length 13 [2019-12-18 13:07:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:36,033 INFO L462 AbstractCegarLoop]: Abstraction has 33114 states and 107084 transitions. [2019-12-18 13:07:36,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:07:36,033 INFO L276 IsEmpty]: Start isEmpty. Operand 33114 states and 107084 transitions. [2019-12-18 13:07:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:07:36,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:36,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:36,036 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:36,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:36,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1702625862, now seen corresponding path program 1 times [2019-12-18 13:07:36,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:36,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417009916] [2019-12-18 13:07:36,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:36,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:36,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417009916] [2019-12-18 13:07:36,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:36,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:07:36,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588906958] [2019-12-18 13:07:36,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:07:36,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:36,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:07:36,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:07:36,179 INFO L87 Difference]: Start difference. First operand 33114 states and 107084 transitions. Second operand 4 states. [2019-12-18 13:07:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:36,538 INFO L93 Difference]: Finished difference Result 41561 states and 133908 transitions. [2019-12-18 13:07:36,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:07:36,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:07:36,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:36,609 INFO L225 Difference]: With dead ends: 41561 [2019-12-18 13:07:36,610 INFO L226 Difference]: Without dead ends: 41561 [2019-12-18 13:07:36,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:07:36,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41561 states. [2019-12-18 13:07:39,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41561 to 37204. [2019-12-18 13:07:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37204 states. [2019-12-18 13:07:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 120245 transitions. [2019-12-18 13:07:39,815 INFO L78 Accepts]: Start accepts. Automaton has 37204 states and 120245 transitions. Word has length 16 [2019-12-18 13:07:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:39,816 INFO L462 AbstractCegarLoop]: Abstraction has 37204 states and 120245 transitions. [2019-12-18 13:07:39,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:07:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 37204 states and 120245 transitions. [2019-12-18 13:07:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:07:39,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:39,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:39,827 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:39,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash -989401703, now seen corresponding path program 1 times [2019-12-18 13:07:39,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:39,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748140419] [2019-12-18 13:07:39,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:39,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748140419] [2019-12-18 13:07:39,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:39,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:07:39,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077827456] [2019-12-18 13:07:39,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:07:39,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:39,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:07:39,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:07:39,947 INFO L87 Difference]: Start difference. First operand 37204 states and 120245 transitions. Second operand 5 states. [2019-12-18 13:07:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:40,607 INFO L93 Difference]: Finished difference Result 47941 states and 152440 transitions. [2019-12-18 13:07:40,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:07:40,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:07:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:40,697 INFO L225 Difference]: With dead ends: 47941 [2019-12-18 13:07:40,697 INFO L226 Difference]: Without dead ends: 47934 [2019-12-18 13:07:40,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:07:40,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47934 states. [2019-12-18 13:07:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47934 to 36849. [2019-12-18 13:07:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36849 states. [2019-12-18 13:07:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36849 states to 36849 states and 118974 transitions. [2019-12-18 13:07:42,131 INFO L78 Accepts]: Start accepts. Automaton has 36849 states and 118974 transitions. Word has length 22 [2019-12-18 13:07:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:42,131 INFO L462 AbstractCegarLoop]: Abstraction has 36849 states and 118974 transitions. [2019-12-18 13:07:42,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:07:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 36849 states and 118974 transitions. [2019-12-18 13:07:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:07:42,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:42,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:42,146 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2090054503, now seen corresponding path program 1 times [2019-12-18 13:07:42,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:42,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489767496] [2019-12-18 13:07:42,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:42,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489767496] [2019-12-18 13:07:42,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:42,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:07:42,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378747952] [2019-12-18 13:07:42,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:07:42,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:42,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:07:42,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:07:42,202 INFO L87 Difference]: Start difference. First operand 36849 states and 118974 transitions. Second operand 4 states. [2019-12-18 13:07:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:42,277 INFO L93 Difference]: Finished difference Result 15264 states and 46609 transitions. [2019-12-18 13:07:42,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:07:42,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:07:42,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:42,298 INFO L225 Difference]: With dead ends: 15264 [2019-12-18 13:07:42,299 INFO L226 Difference]: Without dead ends: 15264 [2019-12-18 13:07:42,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:07:42,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15264 states. [2019-12-18 13:07:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15264 to 14936. [2019-12-18 13:07:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14936 states. [2019-12-18 13:07:42,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14936 states to 14936 states and 45673 transitions. [2019-12-18 13:07:42,609 INFO L78 Accepts]: Start accepts. Automaton has 14936 states and 45673 transitions. Word has length 25 [2019-12-18 13:07:42,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:42,609 INFO L462 AbstractCegarLoop]: Abstraction has 14936 states and 45673 transitions. [2019-12-18 13:07:42,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:07:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 14936 states and 45673 transitions. [2019-12-18 13:07:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:07:42,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:42,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:42,622 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:42,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:42,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1906532401, now seen corresponding path program 1 times [2019-12-18 13:07:42,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:42,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084515564] [2019-12-18 13:07:42,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:42,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084515564] [2019-12-18 13:07:42,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:42,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:07:42,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119933390] [2019-12-18 13:07:42,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:07:42,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:42,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:07:42,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:42,672 INFO L87 Difference]: Start difference. First operand 14936 states and 45673 transitions. Second operand 3 states. [2019-12-18 13:07:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:42,785 INFO L93 Difference]: Finished difference Result 21267 states and 63997 transitions. [2019-12-18 13:07:42,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:07:42,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:07:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:42,813 INFO L225 Difference]: With dead ends: 21267 [2019-12-18 13:07:42,813 INFO L226 Difference]: Without dead ends: 21267 [2019-12-18 13:07:42,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21267 states. [2019-12-18 13:07:43,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21267 to 15790. [2019-12-18 13:07:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15790 states. [2019-12-18 13:07:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15790 states to 15790 states and 48131 transitions. [2019-12-18 13:07:43,091 INFO L78 Accepts]: Start accepts. Automaton has 15790 states and 48131 transitions. Word has length 27 [2019-12-18 13:07:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:43,092 INFO L462 AbstractCegarLoop]: Abstraction has 15790 states and 48131 transitions. [2019-12-18 13:07:43,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:07:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 15790 states and 48131 transitions. [2019-12-18 13:07:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:07:43,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:43,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:43,103 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:43,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1466938041, now seen corresponding path program 1 times [2019-12-18 13:07:43,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:43,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193156464] [2019-12-18 13:07:43,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:43,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193156464] [2019-12-18 13:07:43,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:43,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:07:43,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803216223] [2019-12-18 13:07:43,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:07:43,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:43,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:07:43,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:07:43,214 INFO L87 Difference]: Start difference. First operand 15790 states and 48131 transitions. Second operand 6 states. [2019-12-18 13:07:44,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:44,041 INFO L93 Difference]: Finished difference Result 40724 states and 122204 transitions. [2019-12-18 13:07:44,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:07:44,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:07:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:44,100 INFO L225 Difference]: With dead ends: 40724 [2019-12-18 13:07:44,100 INFO L226 Difference]: Without dead ends: 40724 [2019-12-18 13:07:44,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:07:44,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40724 states. [2019-12-18 13:07:44,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40724 to 22567. [2019-12-18 13:07:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22567 states. [2019-12-18 13:07:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22567 states to 22567 states and 69647 transitions. [2019-12-18 13:07:44,605 INFO L78 Accepts]: Start accepts. Automaton has 22567 states and 69647 transitions. Word has length 27 [2019-12-18 13:07:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:44,606 INFO L462 AbstractCegarLoop]: Abstraction has 22567 states and 69647 transitions. [2019-12-18 13:07:44,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:07:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 22567 states and 69647 transitions. [2019-12-18 13:07:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:07:44,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:44,624 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-18 13:07:44,624 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:44,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:44,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1177717026, now seen corresponding path program 1 times [2019-12-18 13:07:44,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:44,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657569092] [2019-12-18 13:07:44,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:44,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657569092] [2019-12-18 13:07:44,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:44,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:07:44,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811495177] [2019-12-18 13:07:44,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:07:44,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:44,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:07:44,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:07:44,747 INFO L87 Difference]: Start difference. First operand 22567 states and 69647 transitions. Second operand 6 states. [2019-12-18 13:07:45,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:45,775 INFO L93 Difference]: Finished difference Result 37765 states and 113362 transitions. [2019-12-18 13:07:45,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:07:45,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 13:07:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:45,829 INFO L225 Difference]: With dead ends: 37765 [2019-12-18 13:07:45,829 INFO L226 Difference]: Without dead ends: 37765 [2019-12-18 13:07:45,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:07:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37765 states. [2019-12-18 13:07:46,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37765 to 22218. [2019-12-18 13:07:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22218 states. [2019-12-18 13:07:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22218 states to 22218 states and 68697 transitions. [2019-12-18 13:07:46,320 INFO L78 Accepts]: Start accepts. Automaton has 22218 states and 68697 transitions. Word has length 28 [2019-12-18 13:07:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:46,321 INFO L462 AbstractCegarLoop]: Abstraction has 22218 states and 68697 transitions. [2019-12-18 13:07:46,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:07:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 22218 states and 68697 transitions. [2019-12-18 13:07:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:07:46,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:46,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:46,347 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:46,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1088633804, now seen corresponding path program 1 times [2019-12-18 13:07:46,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:46,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513548051] [2019-12-18 13:07:46,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:46,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513548051] [2019-12-18 13:07:46,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:46,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:07:46,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438980276] [2019-12-18 13:07:46,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:07:46,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:46,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:07:46,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:07:46,497 INFO L87 Difference]: Start difference. First operand 22218 states and 68697 transitions. Second operand 7 states. [2019-12-18 13:07:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:48,015 INFO L93 Difference]: Finished difference Result 50401 states and 150592 transitions. [2019-12-18 13:07:48,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:07:48,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:07:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:48,096 INFO L225 Difference]: With dead ends: 50401 [2019-12-18 13:07:48,096 INFO L226 Difference]: Without dead ends: 50401 [2019-12-18 13:07:48,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:07:48,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50401 states. [2019-12-18 13:07:48,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50401 to 23449. [2019-12-18 13:07:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23449 states. [2019-12-18 13:07:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23449 states to 23449 states and 72523 transitions. [2019-12-18 13:07:48,924 INFO L78 Accepts]: Start accepts. Automaton has 23449 states and 72523 transitions. Word has length 33 [2019-12-18 13:07:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:48,924 INFO L462 AbstractCegarLoop]: Abstraction has 23449 states and 72523 transitions. [2019-12-18 13:07:48,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:07:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 23449 states and 72523 transitions. [2019-12-18 13:07:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:07:48,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:48,950 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:48,950 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:48,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:48,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1082826604, now seen corresponding path program 1 times [2019-12-18 13:07:48,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:48,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675086971] [2019-12-18 13:07:48,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:49,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675086971] [2019-12-18 13:07:49,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:49,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:07:49,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437009090] [2019-12-18 13:07:49,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:07:49,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:49,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:07:49,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:49,013 INFO L87 Difference]: Start difference. First operand 23449 states and 72523 transitions. Second operand 3 states. [2019-12-18 13:07:49,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:49,189 INFO L93 Difference]: Finished difference Result 31046 states and 92713 transitions. [2019-12-18 13:07:49,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:07:49,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 13:07:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:49,265 INFO L225 Difference]: With dead ends: 31046 [2019-12-18 13:07:49,266 INFO L226 Difference]: Without dead ends: 31046 [2019-12-18 13:07:49,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:07:49,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31046 states. [2019-12-18 13:07:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31046 to 22288. [2019-12-18 13:07:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22288 states. [2019-12-18 13:07:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22288 states to 22288 states and 66690 transitions. [2019-12-18 13:07:49,901 INFO L78 Accepts]: Start accepts. Automaton has 22288 states and 66690 transitions. Word has length 33 [2019-12-18 13:07:49,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:49,902 INFO L462 AbstractCegarLoop]: Abstraction has 22288 states and 66690 transitions. [2019-12-18 13:07:49,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:07:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 22288 states and 66690 transitions. [2019-12-18 13:07:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:07:49,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:49,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:07:49,935 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:49,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:49,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1090977820, now seen corresponding path program 2 times [2019-12-18 13:07:49,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:49,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626534431] [2019-12-18 13:07:49,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:50,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626534431] [2019-12-18 13:07:50,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:50,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:07:50,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402970220] [2019-12-18 13:07:50,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:07:50,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:50,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:07:50,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:07:50,150 INFO L87 Difference]: Start difference. First operand 22288 states and 66690 transitions. Second operand 9 states. [2019-12-18 13:07:52,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:52,487 INFO L93 Difference]: Finished difference Result 51139 states and 149852 transitions. [2019-12-18 13:07:52,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 13:07:52,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-18 13:07:52,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:52,565 INFO L225 Difference]: With dead ends: 51139 [2019-12-18 13:07:52,565 INFO L226 Difference]: Without dead ends: 51139 [2019-12-18 13:07:52,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2019-12-18 13:07:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51139 states. [2019-12-18 13:07:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51139 to 21685. [2019-12-18 13:07:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21685 states. [2019-12-18 13:07:53,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21685 states to 21685 states and 64891 transitions. [2019-12-18 13:07:53,106 INFO L78 Accepts]: Start accepts. Automaton has 21685 states and 64891 transitions. Word has length 33 [2019-12-18 13:07:53,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:53,107 INFO L462 AbstractCegarLoop]: Abstraction has 21685 states and 64891 transitions. [2019-12-18 13:07:53,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:07:53,107 INFO L276 IsEmpty]: Start isEmpty. Operand 21685 states and 64891 transitions. [2019-12-18 13:07:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:07:53,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:53,126 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-18 13:07:53,127 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:53,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:53,127 INFO L82 PathProgramCache]: Analyzing trace with hash 791261483, now seen corresponding path program 1 times [2019-12-18 13:07:53,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:53,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969768628] [2019-12-18 13:07:53,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:53,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969768628] [2019-12-18 13:07:53,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:53,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:07:53,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834310146] [2019-12-18 13:07:53,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:07:53,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:53,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:07:53,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:07:53,247 INFO L87 Difference]: Start difference. First operand 21685 states and 64891 transitions. Second operand 7 states. [2019-12-18 13:07:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:54,699 INFO L93 Difference]: Finished difference Result 37994 states and 111619 transitions. [2019-12-18 13:07:54,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:07:54,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 13:07:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:54,755 INFO L225 Difference]: With dead ends: 37994 [2019-12-18 13:07:54,755 INFO L226 Difference]: Without dead ends: 37994 [2019-12-18 13:07:54,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:07:54,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37994 states. [2019-12-18 13:07:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37994 to 20324. [2019-12-18 13:07:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20324 states. [2019-12-18 13:07:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20324 states to 20324 states and 60908 transitions. [2019-12-18 13:07:55,206 INFO L78 Accepts]: Start accepts. Automaton has 20324 states and 60908 transitions. Word has length 34 [2019-12-18 13:07:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:55,206 INFO L462 AbstractCegarLoop]: Abstraction has 20324 states and 60908 transitions. [2019-12-18 13:07:55,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:07:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 20324 states and 60908 transitions. [2019-12-18 13:07:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:07:55,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:55,227 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-18 13:07:55,227 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:55,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1244987983, now seen corresponding path program 2 times [2019-12-18 13:07:55,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:55,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053192155] [2019-12-18 13:07:55,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:55,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053192155] [2019-12-18 13:07:55,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:55,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:07:55,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449199560] [2019-12-18 13:07:55,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:07:55,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:55,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:07:55,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:07:55,355 INFO L87 Difference]: Start difference. First operand 20324 states and 60908 transitions. Second operand 7 states. [2019-12-18 13:07:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:56,695 INFO L93 Difference]: Finished difference Result 46732 states and 135699 transitions. [2019-12-18 13:07:56,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:07:56,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 13:07:56,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:56,798 INFO L225 Difference]: With dead ends: 46732 [2019-12-18 13:07:56,798 INFO L226 Difference]: Without dead ends: 46732 [2019-12-18 13:07:56,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:07:57,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46732 states. [2019-12-18 13:07:57,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46732 to 19737. [2019-12-18 13:07:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19737 states. [2019-12-18 13:07:57,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19737 states to 19737 states and 59173 transitions. [2019-12-18 13:07:57,730 INFO L78 Accepts]: Start accepts. Automaton has 19737 states and 59173 transitions. Word has length 34 [2019-12-18 13:07:57,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:57,730 INFO L462 AbstractCegarLoop]: Abstraction has 19737 states and 59173 transitions. [2019-12-18 13:07:57,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:07:57,730 INFO L276 IsEmpty]: Start isEmpty. Operand 19737 states and 59173 transitions. [2019-12-18 13:07:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:07:57,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:57,755 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-18 13:07:57,755 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:57,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:57,756 INFO L82 PathProgramCache]: Analyzing trace with hash -851207469, now seen corresponding path program 3 times [2019-12-18 13:07:57,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:57,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87063561] [2019-12-18 13:07:57,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:07:57,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87063561] [2019-12-18 13:07:57,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:57,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:07:57,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100289417] [2019-12-18 13:07:57,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:07:57,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:57,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:07:57,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:07:57,931 INFO L87 Difference]: Start difference. First operand 19737 states and 59173 transitions. Second operand 9 states. [2019-12-18 13:07:58,606 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2019-12-18 13:07:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:59,896 INFO L93 Difference]: Finished difference Result 41366 states and 121149 transitions. [2019-12-18 13:07:59,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:07:59,899 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-18 13:07:59,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:59,969 INFO L225 Difference]: With dead ends: 41366 [2019-12-18 13:07:59,969 INFO L226 Difference]: Without dead ends: 41366 [2019-12-18 13:07:59,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:08:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41366 states. [2019-12-18 13:08:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41366 to 19413. [2019-12-18 13:08:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19413 states. [2019-12-18 13:08:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19413 states to 19413 states and 58228 transitions. [2019-12-18 13:08:00,427 INFO L78 Accepts]: Start accepts. Automaton has 19413 states and 58228 transitions. Word has length 34 [2019-12-18 13:08:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:00,427 INFO L462 AbstractCegarLoop]: Abstraction has 19413 states and 58228 transitions. [2019-12-18 13:08:00,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:08:00,427 INFO L276 IsEmpty]: Start isEmpty. Operand 19413 states and 58228 transitions. [2019-12-18 13:08:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:08:00,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:00,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:00,451 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:00,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:00,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1420266152, now seen corresponding path program 1 times [2019-12-18 13:08:00,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:00,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929420346] [2019-12-18 13:08:00,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:00,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929420346] [2019-12-18 13:08:00,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:00,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:08:00,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143005794] [2019-12-18 13:08:00,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:08:00,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:00,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:08:00,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:00,498 INFO L87 Difference]: Start difference. First operand 19413 states and 58228 transitions. Second operand 3 states. [2019-12-18 13:08:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:00,569 INFO L93 Difference]: Finished difference Result 19412 states and 58226 transitions. [2019-12-18 13:08:00,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:08:00,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:08:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:00,601 INFO L225 Difference]: With dead ends: 19412 [2019-12-18 13:08:00,601 INFO L226 Difference]: Without dead ends: 19412 [2019-12-18 13:08:00,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19412 states. [2019-12-18 13:08:00,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19412 to 19412. [2019-12-18 13:08:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19412 states. [2019-12-18 13:08:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19412 states to 19412 states and 58226 transitions. [2019-12-18 13:08:00,894 INFO L78 Accepts]: Start accepts. Automaton has 19412 states and 58226 transitions. Word has length 39 [2019-12-18 13:08:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:00,894 INFO L462 AbstractCegarLoop]: Abstraction has 19412 states and 58226 transitions. [2019-12-18 13:08:00,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:08:00,894 INFO L276 IsEmpty]: Start isEmpty. Operand 19412 states and 58226 transitions. [2019-12-18 13:08:00,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:08:00,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:00,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:00,914 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:00,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:00,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1015126435, now seen corresponding path program 1 times [2019-12-18 13:08:00,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:00,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71046202] [2019-12-18 13:08:00,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:00,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71046202] [2019-12-18 13:08:00,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:00,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:08:00,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999144322] [2019-12-18 13:08:00,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:08:00,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:00,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:08:00,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:00,954 INFO L87 Difference]: Start difference. First operand 19412 states and 58226 transitions. Second operand 3 states. [2019-12-18 13:08:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:01,092 INFO L93 Difference]: Finished difference Result 36821 states and 110495 transitions. [2019-12-18 13:08:01,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:08:01,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 13:08:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:01,123 INFO L225 Difference]: With dead ends: 36821 [2019-12-18 13:08:01,123 INFO L226 Difference]: Without dead ends: 19829 [2019-12-18 13:08:01,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19829 states. [2019-12-18 13:08:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19829 to 19763. [2019-12-18 13:08:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19763 states. [2019-12-18 13:08:01,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19763 states to 19763 states and 57956 transitions. [2019-12-18 13:08:01,425 INFO L78 Accepts]: Start accepts. Automaton has 19763 states and 57956 transitions. Word has length 40 [2019-12-18 13:08:01,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:01,425 INFO L462 AbstractCegarLoop]: Abstraction has 19763 states and 57956 transitions. [2019-12-18 13:08:01,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:08:01,425 INFO L276 IsEmpty]: Start isEmpty. Operand 19763 states and 57956 transitions. [2019-12-18 13:08:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:08:01,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:01,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:01,445 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:01,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:01,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1234885869, now seen corresponding path program 2 times [2019-12-18 13:08:01,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:01,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392303364] [2019-12-18 13:08:01,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:01,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-18 13:08:01,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392303364] [2019-12-18 13:08:01,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:01,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:08:01,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884777125] [2019-12-18 13:08:01,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:08:01,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:01,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:08:01,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:08:01,518 INFO L87 Difference]: Start difference. First operand 19763 states and 57956 transitions. Second operand 5 states. [2019-12-18 13:08:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:02,137 INFO L93 Difference]: Finished difference Result 28152 states and 81728 transitions. [2019-12-18 13:08:02,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:08:02,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:08:02,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:02,175 INFO L225 Difference]: With dead ends: 28152 [2019-12-18 13:08:02,175 INFO L226 Difference]: Without dead ends: 28152 [2019-12-18 13:08:02,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:08:02,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28152 states. [2019-12-18 13:08:02,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28152 to 25718. [2019-12-18 13:08:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25718 states. [2019-12-18 13:08:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25718 states to 25718 states and 75196 transitions. [2019-12-18 13:08:02,724 INFO L78 Accepts]: Start accepts. Automaton has 25718 states and 75196 transitions. Word has length 40 [2019-12-18 13:08:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:02,724 INFO L462 AbstractCegarLoop]: Abstraction has 25718 states and 75196 transitions. [2019-12-18 13:08:02,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:08:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 25718 states and 75196 transitions. [2019-12-18 13:08:02,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:08:02,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:02,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:02,750 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:02,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:02,751 INFO L82 PathProgramCache]: Analyzing trace with hash 342200019, now seen corresponding path program 3 times [2019-12-18 13:08:02,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:02,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662907911] [2019-12-18 13:08:02,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:02,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662907911] [2019-12-18 13:08:02,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:02,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:08:02,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982344541] [2019-12-18 13:08:02,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:08:02,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:02,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:08:02,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:02,821 INFO L87 Difference]: Start difference. First operand 25718 states and 75196 transitions. Second operand 3 states. [2019-12-18 13:08:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:02,922 INFO L93 Difference]: Finished difference Result 24330 states and 70130 transitions. [2019-12-18 13:08:02,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:08:02,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 13:08:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:02,971 INFO L225 Difference]: With dead ends: 24330 [2019-12-18 13:08:02,971 INFO L226 Difference]: Without dead ends: 24330 [2019-12-18 13:08:02,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:03,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24330 states. [2019-12-18 13:08:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24330 to 24266. [2019-12-18 13:08:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24266 states. [2019-12-18 13:08:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24266 states to 24266 states and 69952 transitions. [2019-12-18 13:08:03,372 INFO L78 Accepts]: Start accepts. Automaton has 24266 states and 69952 transitions. Word has length 40 [2019-12-18 13:08:03,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:03,372 INFO L462 AbstractCegarLoop]: Abstraction has 24266 states and 69952 transitions. [2019-12-18 13:08:03,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:08:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 24266 states and 69952 transitions. [2019-12-18 13:08:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:08:03,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:03,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:03,396 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:03,396 INFO L82 PathProgramCache]: Analyzing trace with hash -2044650148, now seen corresponding path program 1 times [2019-12-18 13:08:03,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:03,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248481640] [2019-12-18 13:08:03,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:03,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248481640] [2019-12-18 13:08:03,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:03,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:08:03,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20168294] [2019-12-18 13:08:03,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:08:03,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:03,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:08:03,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:03,464 INFO L87 Difference]: Start difference. First operand 24266 states and 69952 transitions. Second operand 3 states. [2019-12-18 13:08:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:03,555 INFO L93 Difference]: Finished difference Result 24266 states and 69874 transitions. [2019-12-18 13:08:03,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:08:03,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 13:08:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:03,585 INFO L225 Difference]: With dead ends: 24266 [2019-12-18 13:08:03,585 INFO L226 Difference]: Without dead ends: 24266 [2019-12-18 13:08:03,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24266 states. [2019-12-18 13:08:03,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24266 to 19817. [2019-12-18 13:08:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19817 states. [2019-12-18 13:08:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19817 states to 19817 states and 57519 transitions. [2019-12-18 13:08:03,916 INFO L78 Accepts]: Start accepts. Automaton has 19817 states and 57519 transitions. Word has length 41 [2019-12-18 13:08:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:03,916 INFO L462 AbstractCegarLoop]: Abstraction has 19817 states and 57519 transitions. [2019-12-18 13:08:03,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:08:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 19817 states and 57519 transitions. [2019-12-18 13:08:03,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 13:08:03,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:03,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:03,936 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:03,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:03,936 INFO L82 PathProgramCache]: Analyzing trace with hash 884175412, now seen corresponding path program 1 times [2019-12-18 13:08:03,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:03,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540116502] [2019-12-18 13:08:03,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:03,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-18 13:08:03,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540116502] [2019-12-18 13:08:03,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:03,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:08:03,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13961127] [2019-12-18 13:08:03,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:08:03,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:03,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:08:03,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:08:03,987 INFO L87 Difference]: Start difference. First operand 19817 states and 57519 transitions. Second operand 5 states. [2019-12-18 13:08:04,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:04,064 INFO L93 Difference]: Finished difference Result 18568 states and 54840 transitions. [2019-12-18 13:08:04,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:08:04,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 13:08:04,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:04,089 INFO L225 Difference]: With dead ends: 18568 [2019-12-18 13:08:04,089 INFO L226 Difference]: Without dead ends: 17139 [2019-12-18 13:08:04,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:08:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17139 states. [2019-12-18 13:08:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17139 to 17139. [2019-12-18 13:08:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17139 states. [2019-12-18 13:08:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17139 states to 17139 states and 51794 transitions. [2019-12-18 13:08:04,355 INFO L78 Accepts]: Start accepts. Automaton has 17139 states and 51794 transitions. Word has length 42 [2019-12-18 13:08:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:04,355 INFO L462 AbstractCegarLoop]: Abstraction has 17139 states and 51794 transitions. [2019-12-18 13:08:04,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:08:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 17139 states and 51794 transitions. [2019-12-18 13:08:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:08:04,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:04,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:04,374 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:04,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1215626616, now seen corresponding path program 1 times [2019-12-18 13:08:04,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:04,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079300126] [2019-12-18 13:08:04,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:04,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079300126] [2019-12-18 13:08:04,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:04,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:08:04,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110762615] [2019-12-18 13:08:04,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:08:04,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:04,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:08:04,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:08:04,458 INFO L87 Difference]: Start difference. First operand 17139 states and 51794 transitions. Second operand 7 states. [2019-12-18 13:08:05,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:05,088 INFO L93 Difference]: Finished difference Result 48114 states and 143833 transitions. [2019-12-18 13:08:05,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:08:05,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 13:08:05,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:05,175 INFO L225 Difference]: With dead ends: 48114 [2019-12-18 13:08:05,175 INFO L226 Difference]: Without dead ends: 33834 [2019-12-18 13:08:05,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:08:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33834 states. [2019-12-18 13:08:05,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33834 to 20005. [2019-12-18 13:08:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20005 states. [2019-12-18 13:08:05,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20005 states to 20005 states and 59874 transitions. [2019-12-18 13:08:05,949 INFO L78 Accepts]: Start accepts. Automaton has 20005 states and 59874 transitions. Word has length 66 [2019-12-18 13:08:05,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:05,949 INFO L462 AbstractCegarLoop]: Abstraction has 20005 states and 59874 transitions. [2019-12-18 13:08:05,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:08:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 20005 states and 59874 transitions. [2019-12-18 13:08:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:08:05,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:05,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:05,969 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:05,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:05,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1961322332, now seen corresponding path program 2 times [2019-12-18 13:08:05,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:05,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114979724] [2019-12-18 13:08:05,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:06,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114979724] [2019-12-18 13:08:06,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:06,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:08:06,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683207036] [2019-12-18 13:08:06,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:08:06,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:06,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:08:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:08:06,075 INFO L87 Difference]: Start difference. First operand 20005 states and 59874 transitions. Second operand 8 states. [2019-12-18 13:08:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:08,777 INFO L93 Difference]: Finished difference Result 42581 states and 126178 transitions. [2019-12-18 13:08:08,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 13:08:08,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 13:08:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:08,833 INFO L225 Difference]: With dead ends: 42581 [2019-12-18 13:08:08,834 INFO L226 Difference]: Without dead ends: 42309 [2019-12-18 13:08:08,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=946, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 13:08:08,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42309 states. [2019-12-18 13:08:09,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42309 to 21043. [2019-12-18 13:08:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21043 states. [2019-12-18 13:08:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21043 states to 21043 states and 63048 transitions. [2019-12-18 13:08:09,352 INFO L78 Accepts]: Start accepts. Automaton has 21043 states and 63048 transitions. Word has length 66 [2019-12-18 13:08:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:09,352 INFO L462 AbstractCegarLoop]: Abstraction has 21043 states and 63048 transitions. [2019-12-18 13:08:09,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:08:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 21043 states and 63048 transitions. [2019-12-18 13:08:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:08:09,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:09,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:09,373 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:09,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:09,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1828255542, now seen corresponding path program 3 times [2019-12-18 13:08:09,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:09,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413328017] [2019-12-18 13:08:09,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:09,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413328017] [2019-12-18 13:08:09,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:09,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:08:09,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619750586] [2019-12-18 13:08:09,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:08:09,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:09,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:08:09,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:08:09,501 INFO L87 Difference]: Start difference. First operand 21043 states and 63048 transitions. Second operand 9 states. [2019-12-18 13:08:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:13,197 INFO L93 Difference]: Finished difference Result 47208 states and 139511 transitions. [2019-12-18 13:08:13,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 13:08:13,198 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 13:08:13,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:13,259 INFO L225 Difference]: With dead ends: 47208 [2019-12-18 13:08:13,260 INFO L226 Difference]: Without dead ends: 47208 [2019-12-18 13:08:13,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=466, Invalid=1984, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 13:08:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47208 states. [2019-12-18 13:08:13,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47208 to 20769. [2019-12-18 13:08:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20769 states. [2019-12-18 13:08:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20769 states to 20769 states and 62252 transitions. [2019-12-18 13:08:13,817 INFO L78 Accepts]: Start accepts. Automaton has 20769 states and 62252 transitions. Word has length 66 [2019-12-18 13:08:13,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:13,817 INFO L462 AbstractCegarLoop]: Abstraction has 20769 states and 62252 transitions. [2019-12-18 13:08:13,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:08:13,818 INFO L276 IsEmpty]: Start isEmpty. Operand 20769 states and 62252 transitions. [2019-12-18 13:08:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:08:13,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:13,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:13,842 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:13,842 INFO L82 PathProgramCache]: Analyzing trace with hash -178270044, now seen corresponding path program 4 times [2019-12-18 13:08:13,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:13,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576181421] [2019-12-18 13:08:13,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:13,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:13,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576181421] [2019-12-18 13:08:13,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:13,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:08:13,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154657984] [2019-12-18 13:08:13,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:08:13,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:13,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:08:13,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:08:13,945 INFO L87 Difference]: Start difference. First operand 20769 states and 62252 transitions. Second operand 8 states. [2019-12-18 13:08:15,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:15,141 INFO L93 Difference]: Finished difference Result 40034 states and 119878 transitions. [2019-12-18 13:08:15,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:08:15,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 13:08:15,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:15,184 INFO L225 Difference]: With dead ends: 40034 [2019-12-18 13:08:15,184 INFO L226 Difference]: Without dead ends: 32335 [2019-12-18 13:08:15,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:08:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32335 states. [2019-12-18 13:08:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32335 to 21470. [2019-12-18 13:08:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21470 states. [2019-12-18 13:08:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21470 states to 21470 states and 63912 transitions. [2019-12-18 13:08:15,591 INFO L78 Accepts]: Start accepts. Automaton has 21470 states and 63912 transitions. Word has length 66 [2019-12-18 13:08:15,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:15,591 INFO L462 AbstractCegarLoop]: Abstraction has 21470 states and 63912 transitions. [2019-12-18 13:08:15,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:08:15,591 INFO L276 IsEmpty]: Start isEmpty. Operand 21470 states and 63912 transitions. [2019-12-18 13:08:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:08:15,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:15,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:15,612 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:15,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:15,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1109171142, now seen corresponding path program 5 times [2019-12-18 13:08:15,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:15,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082330612] [2019-12-18 13:08:15,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:15,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082330612] [2019-12-18 13:08:15,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:15,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:08:15,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429250545] [2019-12-18 13:08:15,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:08:15,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:15,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:08:15,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:08:15,756 INFO L87 Difference]: Start difference. First operand 21470 states and 63912 transitions. Second operand 9 states. [2019-12-18 13:08:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:16,968 INFO L93 Difference]: Finished difference Result 37534 states and 111576 transitions. [2019-12-18 13:08:16,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:08:16,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 13:08:16,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:17,012 INFO L225 Difference]: With dead ends: 37534 [2019-12-18 13:08:17,012 INFO L226 Difference]: Without dead ends: 31687 [2019-12-18 13:08:17,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:08:17,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31687 states. [2019-12-18 13:08:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31687 to 21254. [2019-12-18 13:08:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21254 states. [2019-12-18 13:08:17,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21254 states to 21254 states and 63224 transitions. [2019-12-18 13:08:17,555 INFO L78 Accepts]: Start accepts. Automaton has 21254 states and 63224 transitions. Word has length 66 [2019-12-18 13:08:17,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:17,555 INFO L462 AbstractCegarLoop]: Abstraction has 21254 states and 63224 transitions. [2019-12-18 13:08:17,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:08:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 21254 states and 63224 transitions. [2019-12-18 13:08:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:08:17,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:17,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, 1] [2019-12-18 13:08:17,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-18 13:08:17,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:17,577 INFO L82 PathProgramCache]: Analyzing trace with hash 191706936, now seen corresponding path program 6 times [2019-12-18 13:08:17,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:17,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233079566] [2019-12-18 13:08:17,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:18,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233079566] [2019-12-18 13:08:18,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:18,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 13:08:18,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143817914] [2019-12-18 13:08:18,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 13:08:18,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:18,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 13:08:18,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:08:18,116 INFO L87 Difference]: Start difference. First operand 21254 states and 63224 transitions. Second operand 17 states. [2019-12-18 13:08:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:22,405 INFO L93 Difference]: Finished difference Result 33360 states and 97673 transitions. [2019-12-18 13:08:22,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 13:08:22,405 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 13:08:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:22,449 INFO L225 Difference]: With dead ends: 33360 [2019-12-18 13:08:22,449 INFO L226 Difference]: Without dead ends: 29816 [2019-12-18 13:08:22,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=429, Invalid=2121, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 13:08:22,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29816 states. [2019-12-18 13:08:22,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29816 to 21868. [2019-12-18 13:08:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21868 states. [2019-12-18 13:08:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21868 states to 21868 states and 64767 transitions. [2019-12-18 13:08:22,843 INFO L78 Accepts]: Start accepts. Automaton has 21868 states and 64767 transitions. Word has length 66 [2019-12-18 13:08:22,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:22,843 INFO L462 AbstractCegarLoop]: Abstraction has 21868 states and 64767 transitions. [2019-12-18 13:08:22,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 13:08:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 21868 states and 64767 transitions. [2019-12-18 13:08:22,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:08:22,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:22,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:22,865 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:22,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:22,866 INFO L82 PathProgramCache]: Analyzing trace with hash 390243420, now seen corresponding path program 7 times [2019-12-18 13:08:22,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:22,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056790805] [2019-12-18 13:08:22,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:23,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056790805] [2019-12-18 13:08:23,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:23,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 13:08:23,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355087416] [2019-12-18 13:08:23,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 13:08:23,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:23,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 13:08:23,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-12-18 13:08:23,311 INFO L87 Difference]: Start difference. First operand 21868 states and 64767 transitions. Second operand 16 states. [2019-12-18 13:08:26,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:26,693 INFO L93 Difference]: Finished difference Result 31075 states and 91188 transitions. [2019-12-18 13:08:26,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 13:08:26,693 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-18 13:08:26,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:26,734 INFO L225 Difference]: With dead ends: 31075 [2019-12-18 13:08:26,734 INFO L226 Difference]: Without dead ends: 29732 [2019-12-18 13:08:26,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=288, Invalid=1272, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 13:08:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29732 states. [2019-12-18 13:08:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29732 to 21676. [2019-12-18 13:08:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21676 states. [2019-12-18 13:08:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21676 states to 21676 states and 64281 transitions. [2019-12-18 13:08:27,135 INFO L78 Accepts]: Start accepts. Automaton has 21676 states and 64281 transitions. Word has length 66 [2019-12-18 13:08:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:27,135 INFO L462 AbstractCegarLoop]: Abstraction has 21676 states and 64281 transitions. [2019-12-18 13:08:27,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 13:08:27,135 INFO L276 IsEmpty]: Start isEmpty. Operand 21676 states and 64281 transitions. [2019-12-18 13:08:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:08:27,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:27,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:27,160 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:27,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:27,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1093592258, now seen corresponding path program 8 times [2019-12-18 13:08:27,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:27,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644350020] [2019-12-18 13:08:27,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:27,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644350020] [2019-12-18 13:08:27,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:27,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:08:27,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188047084] [2019-12-18 13:08:27,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:08:27,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:27,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:08:27,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:27,236 INFO L87 Difference]: Start difference. First operand 21676 states and 64281 transitions. Second operand 3 states. [2019-12-18 13:08:27,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:27,391 INFO L93 Difference]: Finished difference Result 24361 states and 72452 transitions. [2019-12-18 13:08:27,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:08:27,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:08:27,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:27,446 INFO L225 Difference]: With dead ends: 24361 [2019-12-18 13:08:27,446 INFO L226 Difference]: Without dead ends: 24361 [2019-12-18 13:08:27,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24361 states. [2019-12-18 13:08:28,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24361 to 20458. [2019-12-18 13:08:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20458 states. [2019-12-18 13:08:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20458 states to 20458 states and 60947 transitions. [2019-12-18 13:08:28,090 INFO L78 Accepts]: Start accepts. Automaton has 20458 states and 60947 transitions. Word has length 66 [2019-12-18 13:08:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:28,091 INFO L462 AbstractCegarLoop]: Abstraction has 20458 states and 60947 transitions. [2019-12-18 13:08:28,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:08:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 20458 states and 60947 transitions. [2019-12-18 13:08:28,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:08:28,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:28,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:28,124 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:28,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:28,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1111193301, now seen corresponding path program 1 times [2019-12-18 13:08:28,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:28,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918472189] [2019-12-18 13:08:28,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:28,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918472189] [2019-12-18 13:08:28,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:28,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 13:08:28,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133575916] [2019-12-18 13:08:28,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 13:08:28,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:28,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 13:08:28,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-18 13:08:28,735 INFO L87 Difference]: Start difference. First operand 20458 states and 60947 transitions. Second operand 16 states. [2019-12-18 13:08:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:32,047 INFO L93 Difference]: Finished difference Result 28876 states and 84704 transitions. [2019-12-18 13:08:32,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 13:08:32,047 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 13:08:32,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:32,084 INFO L225 Difference]: With dead ends: 28876 [2019-12-18 13:08:32,084 INFO L226 Difference]: Without dead ends: 27325 [2019-12-18 13:08:32,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 13:08:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27325 states. [2019-12-18 13:08:32,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27325 to 20582. [2019-12-18 13:08:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20582 states. [2019-12-18 13:08:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20582 states to 20582 states and 61251 transitions. [2019-12-18 13:08:32,578 INFO L78 Accepts]: Start accepts. Automaton has 20582 states and 61251 transitions. Word has length 67 [2019-12-18 13:08:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:32,578 INFO L462 AbstractCegarLoop]: Abstraction has 20582 states and 61251 transitions. [2019-12-18 13:08:32,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 13:08:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 20582 states and 61251 transitions. [2019-12-18 13:08:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:08:32,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:32,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:32,602 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:32,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:32,602 INFO L82 PathProgramCache]: Analyzing trace with hash -2057057855, now seen corresponding path program 2 times [2019-12-18 13:08:32,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:32,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480653578] [2019-12-18 13:08:32,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:33,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480653578] [2019-12-18 13:08:33,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:33,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 13:08:33,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875395625] [2019-12-18 13:08:33,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 13:08:33,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:33,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 13:08:33,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:08:33,184 INFO L87 Difference]: Start difference. First operand 20582 states and 61251 transitions. Second operand 17 states. [2019-12-18 13:08:36,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:36,258 INFO L93 Difference]: Finished difference Result 28790 states and 84443 transitions. [2019-12-18 13:08:36,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 13:08:36,258 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 13:08:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:36,296 INFO L225 Difference]: With dead ends: 28790 [2019-12-18 13:08:36,296 INFO L226 Difference]: Without dead ends: 27013 [2019-12-18 13:08:36,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=347, Invalid=1545, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 13:08:36,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27013 states. [2019-12-18 13:08:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27013 to 20514. [2019-12-18 13:08:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20514 states. [2019-12-18 13:08:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20514 states to 20514 states and 61065 transitions. [2019-12-18 13:08:36,656 INFO L78 Accepts]: Start accepts. Automaton has 20514 states and 61065 transitions. Word has length 67 [2019-12-18 13:08:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:36,656 INFO L462 AbstractCegarLoop]: Abstraction has 20514 states and 61065 transitions. [2019-12-18 13:08:36,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 13:08:36,656 INFO L276 IsEmpty]: Start isEmpty. Operand 20514 states and 61065 transitions. [2019-12-18 13:08:36,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:08:36,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:36,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:36,679 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:36,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:36,679 INFO L82 PathProgramCache]: Analyzing trace with hash -697251353, now seen corresponding path program 3 times [2019-12-18 13:08:36,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:36,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656922011] [2019-12-18 13:08:36,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:37,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656922011] [2019-12-18 13:08:37,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:37,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 13:08:37,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362208496] [2019-12-18 13:08:37,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 13:08:37,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:37,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 13:08:37,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-18 13:08:37,169 INFO L87 Difference]: Start difference. First operand 20514 states and 61065 transitions. Second operand 16 states. [2019-12-18 13:08:40,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:40,092 INFO L93 Difference]: Finished difference Result 29628 states and 86959 transitions. [2019-12-18 13:08:40,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 13:08:40,093 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 13:08:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:40,131 INFO L225 Difference]: With dead ends: 29628 [2019-12-18 13:08:40,131 INFO L226 Difference]: Without dead ends: 27993 [2019-12-18 13:08:40,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=261, Invalid=1221, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 13:08:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27993 states. [2019-12-18 13:08:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27993 to 20598. [2019-12-18 13:08:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20598 states. [2019-12-18 13:08:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20598 states to 20598 states and 61261 transitions. [2019-12-18 13:08:40,647 INFO L78 Accepts]: Start accepts. Automaton has 20598 states and 61261 transitions. Word has length 67 [2019-12-18 13:08:40,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:40,647 INFO L462 AbstractCegarLoop]: Abstraction has 20598 states and 61261 transitions. [2019-12-18 13:08:40,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 13:08:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 20598 states and 61261 transitions. [2019-12-18 13:08:40,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:08:40,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:40,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:40,671 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:40,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:40,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1676819099, now seen corresponding path program 4 times [2019-12-18 13:08:40,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:40,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885611176] [2019-12-18 13:08:40,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:41,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885611176] [2019-12-18 13:08:41,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:41,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 13:08:41,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30163812] [2019-12-18 13:08:41,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 13:08:41,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:41,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 13:08:41,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:08:41,429 INFO L87 Difference]: Start difference. First operand 20598 states and 61261 transitions. Second operand 17 states. [2019-12-18 13:08:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:46,225 INFO L93 Difference]: Finished difference Result 29679 states and 87115 transitions. [2019-12-18 13:08:46,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 13:08:46,225 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 13:08:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:46,264 INFO L225 Difference]: With dead ends: 29679 [2019-12-18 13:08:46,264 INFO L226 Difference]: Without dead ends: 28576 [2019-12-18 13:08:46,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 13:08:46,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28576 states. [2019-12-18 13:08:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28576 to 20598. [2019-12-18 13:08:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20598 states. [2019-12-18 13:08:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20598 states to 20598 states and 61261 transitions. [2019-12-18 13:08:46,642 INFO L78 Accepts]: Start accepts. Automaton has 20598 states and 61261 transitions. Word has length 67 [2019-12-18 13:08:46,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:46,642 INFO L462 AbstractCegarLoop]: Abstraction has 20598 states and 61261 transitions. [2019-12-18 13:08:46,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 13:08:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 20598 states and 61261 transitions. [2019-12-18 13:08:46,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:08:46,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:46,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:46,666 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:46,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:46,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1347841601, now seen corresponding path program 5 times [2019-12-18 13:08:46,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:46,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460125682] [2019-12-18 13:08:46,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:47,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460125682] [2019-12-18 13:08:47,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:47,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 13:08:47,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569187690] [2019-12-18 13:08:47,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 13:08:47,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:47,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 13:08:47,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:08:47,132 INFO L87 Difference]: Start difference. First operand 20598 states and 61261 transitions. Second operand 17 states. [2019-12-18 13:08:52,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:52,679 INFO L93 Difference]: Finished difference Result 30738 states and 90107 transitions. [2019-12-18 13:08:52,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-12-18 13:08:52,679 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 13:08:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:52,716 INFO L225 Difference]: With dead ends: 30738 [2019-12-18 13:08:52,717 INFO L226 Difference]: Without dead ends: 27234 [2019-12-18 13:08:52,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=698, Invalid=4132, Unknown=0, NotChecked=0, Total=4830 [2019-12-18 13:08:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27234 states. [2019-12-18 13:08:53,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27234 to 20732. [2019-12-18 13:08:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20732 states. [2019-12-18 13:08:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20732 states to 20732 states and 61598 transitions. [2019-12-18 13:08:53,080 INFO L78 Accepts]: Start accepts. Automaton has 20732 states and 61598 transitions. Word has length 67 [2019-12-18 13:08:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:53,081 INFO L462 AbstractCegarLoop]: Abstraction has 20732 states and 61598 transitions. [2019-12-18 13:08:53,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 13:08:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 20732 states and 61598 transitions. [2019-12-18 13:08:53,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:08:53,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:53,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:53,103 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:53,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:53,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1759012269, now seen corresponding path program 1 times [2019-12-18 13:08:53,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:53,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898429798] [2019-12-18 13:08:53,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:53,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898429798] [2019-12-18 13:08:53,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:53,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:08:53,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19933564] [2019-12-18 13:08:53,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:08:53,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:53,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:08:53,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:53,151 INFO L87 Difference]: Start difference. First operand 20732 states and 61598 transitions. Second operand 3 states. [2019-12-18 13:08:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:53,402 INFO L93 Difference]: Finished difference Result 28524 states and 85150 transitions. [2019-12-18 13:08:53,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:08:53,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 13:08:53,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:53,463 INFO L225 Difference]: With dead ends: 28524 [2019-12-18 13:08:53,463 INFO L226 Difference]: Without dead ends: 28524 [2019-12-18 13:08:53,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:08:53,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28524 states. [2019-12-18 13:08:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28524 to 21117. [2019-12-18 13:08:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21117 states. [2019-12-18 13:08:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21117 states to 21117 states and 62851 transitions. [2019-12-18 13:08:53,986 INFO L78 Accepts]: Start accepts. Automaton has 21117 states and 62851 transitions. Word has length 67 [2019-12-18 13:08:53,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:53,987 INFO L462 AbstractCegarLoop]: Abstraction has 21117 states and 62851 transitions. [2019-12-18 13:08:53,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:08:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand 21117 states and 62851 transitions. [2019-12-18 13:08:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:08:54,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:54,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:54,008 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:54,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:54,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1524318628, now seen corresponding path program 1 times [2019-12-18 13:08:54,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:54,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680562227] [2019-12-18 13:08:54,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:54,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680562227] [2019-12-18 13:08:54,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:54,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:08:54,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461486876] [2019-12-18 13:08:54,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:08:54,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:54,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:08:54,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:08:54,117 INFO L87 Difference]: Start difference. First operand 21117 states and 62851 transitions. Second operand 8 states. [2019-12-18 13:08:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:56,689 INFO L93 Difference]: Finished difference Result 37993 states and 111260 transitions. [2019-12-18 13:08:56,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 13:08:56,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-18 13:08:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:56,739 INFO L225 Difference]: With dead ends: 37993 [2019-12-18 13:08:56,739 INFO L226 Difference]: Without dead ends: 37993 [2019-12-18 13:08:56,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=946, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 13:08:56,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37993 states. [2019-12-18 13:08:57,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37993 to 20447. [2019-12-18 13:08:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20447 states. [2019-12-18 13:08:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20447 states to 20447 states and 61088 transitions. [2019-12-18 13:08:57,385 INFO L78 Accepts]: Start accepts. Automaton has 20447 states and 61088 transitions. Word has length 67 [2019-12-18 13:08:57,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:57,386 INFO L462 AbstractCegarLoop]: Abstraction has 20447 states and 61088 transitions. [2019-12-18 13:08:57,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:08:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 20447 states and 61088 transitions. [2019-12-18 13:08:57,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:08:57,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:57,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:57,406 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:57,406 INFO L82 PathProgramCache]: Analyzing trace with hash 971774191, now seen corresponding path program 6 times [2019-12-18 13:08:57,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:57,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028967683] [2019-12-18 13:08:57,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:08:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:08:57,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028967683] [2019-12-18 13:08:57,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:08:57,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:08:57,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594551154] [2019-12-18 13:08:57,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:08:57,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:08:57,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:08:57,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:08:57,675 INFO L87 Difference]: Start difference. First operand 20447 states and 61088 transitions. Second operand 12 states. [2019-12-18 13:08:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:08:59,361 INFO L93 Difference]: Finished difference Result 28499 states and 84195 transitions. [2019-12-18 13:08:59,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 13:08:59,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 13:08:59,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:08:59,398 INFO L225 Difference]: With dead ends: 28499 [2019-12-18 13:08:59,398 INFO L226 Difference]: Without dead ends: 26456 [2019-12-18 13:08:59,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:08:59,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26456 states. [2019-12-18 13:08:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26456 to 20553. [2019-12-18 13:08:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20553 states. [2019-12-18 13:08:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20553 states to 20553 states and 61352 transitions. [2019-12-18 13:08:59,755 INFO L78 Accepts]: Start accepts. Automaton has 20553 states and 61352 transitions. Word has length 67 [2019-12-18 13:08:59,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:08:59,755 INFO L462 AbstractCegarLoop]: Abstraction has 20553 states and 61352 transitions. [2019-12-18 13:08:59,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:08:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 20553 states and 61352 transitions. [2019-12-18 13:08:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:08:59,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:08:59,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:08:59,776 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:08:59,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:08:59,776 INFO L82 PathProgramCache]: Analyzing trace with hash 196609103, now seen corresponding path program 7 times [2019-12-18 13:08:59,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:08:59,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740476761] [2019-12-18 13:08:59,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:08:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:09:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:09:00,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740476761] [2019-12-18 13:09:00,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:09:00,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 13:09:00,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934920035] [2019-12-18 13:09:00,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 13:09:00,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:09:00,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 13:09:00,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:09:00,728 INFO L87 Difference]: Start difference. First operand 20553 states and 61352 transitions. Second operand 18 states. [2019-12-18 13:09:07,015 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-12-18 13:09:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:09:13,036 INFO L93 Difference]: Finished difference Result 54948 states and 162942 transitions. [2019-12-18 13:09:13,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-12-18 13:09:13,037 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-18 13:09:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:09:13,108 INFO L225 Difference]: With dead ends: 54948 [2019-12-18 13:09:13,108 INFO L226 Difference]: Without dead ends: 51975 [2019-12-18 13:09:13,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4695 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1626, Invalid=11484, Unknown=0, NotChecked=0, Total=13110 [2019-12-18 13:09:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51975 states. [2019-12-18 13:09:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51975 to 21853. [2019-12-18 13:09:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21853 states. [2019-12-18 13:09:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21853 states to 21853 states and 64745 transitions. [2019-12-18 13:09:13,675 INFO L78 Accepts]: Start accepts. Automaton has 21853 states and 64745 transitions. Word has length 67 [2019-12-18 13:09:13,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:09:13,676 INFO L462 AbstractCegarLoop]: Abstraction has 21853 states and 64745 transitions. [2019-12-18 13:09:13,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 13:09:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 21853 states and 64745 transitions. [2019-12-18 13:09:13,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:09:13,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:09:13,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:09:13,701 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:09:13,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:09:13,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2034399099, now seen corresponding path program 8 times [2019-12-18 13:09:13,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:09:13,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016827390] [2019-12-18 13:09:13,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:09:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:09:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:09:13,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016827390] [2019-12-18 13:09:13,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:09:13,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:09:13,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170977715] [2019-12-18 13:09:13,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:09:13,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:09:13,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:09:13,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:09:13,993 INFO L87 Difference]: Start difference. First operand 21853 states and 64745 transitions. Second operand 11 states. [2019-12-18 13:09:15,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:09:15,192 INFO L93 Difference]: Finished difference Result 43590 states and 129372 transitions. [2019-12-18 13:09:15,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 13:09:15,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:09:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:09:15,239 INFO L225 Difference]: With dead ends: 43590 [2019-12-18 13:09:15,239 INFO L226 Difference]: Without dead ends: 32923 [2019-12-18 13:09:15,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2019-12-18 13:09:15,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32923 states. [2019-12-18 13:09:15,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32923 to 18857. [2019-12-18 13:09:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18857 states. [2019-12-18 13:09:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18857 states to 18857 states and 56845 transitions. [2019-12-18 13:09:15,807 INFO L78 Accepts]: Start accepts. Automaton has 18857 states and 56845 transitions. Word has length 67 [2019-12-18 13:09:15,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:09:15,808 INFO L462 AbstractCegarLoop]: Abstraction has 18857 states and 56845 transitions. [2019-12-18 13:09:15,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:09:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 18857 states and 56845 transitions. [2019-12-18 13:09:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:09:15,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:09:15,827 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:09:15,827 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:09:15,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:09:15,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1127178005, now seen corresponding path program 9 times [2019-12-18 13:09:15,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:09:15,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136180318] [2019-12-18 13:09:15,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:09:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:09:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:09:15,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:09:15,946 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:09:15,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= 0 v_~z$r_buff1_thd3~0_333) (= 0 v_~__unbuffered_cnt~0_79) (= v_~z~0_222 0) (= 0 v_~x~0_150) (= 0 v_~z$flush_delayed~0_66) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t757~0.base_43| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t757~0.base_43|) |v_ULTIMATE.start_main_~#t757~0.offset_29| 0))) (= |v_ULTIMATE.start_main_~#t757~0.offset_29| 0) (= v_~__unbuffered_p2_EBX~0_70 0) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t757~0.base_43| 1)) (= v_~y~0_71 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$r_buff0_thd1~0_186 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t757~0.base_43|) 0) (= v_~z$w_buff1_used~0_670 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t757~0.base_43|) (= v_~z$r_buff0_thd2~0_110 0) (= 0 v_~weak$$choice0~0_29) (= v_~z$w_buff0~0_701 0) (= v_~z$r_buff1_thd0~0_201 0) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t757~0.base_43| 4) |v_#length_27|) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_363) (= 0 v_~__unbuffered_p2_EAX~0_62) (= |v_#NULL.offset_5| 0) (= v_~z$mem_tmp~0_43 0) (= v_~z$r_buff0_thd0~0_137 0) (= v_~weak$$choice2~0_160 0) (= v_~z$r_buff1_thd1~0_144 0) (= v_~z$r_buff1_thd2~0_165 0) (= v_~z$w_buff0_used~0_1072 0) (= v_~z$w_buff1~0_410 0) (= v_~main$tmp_guard0~0_24 0) (= v_~main$tmp_guard1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_18|, #length=|v_#length_28|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_46|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_202|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_120|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_137, ULTIMATE.start_main_~#t759~0.offset=|v_ULTIMATE.start_main_~#t759~0.offset_21|, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ULTIMATE.start_main_~#t757~0.base=|v_ULTIMATE.start_main_~#t757~0.base_43|, ~z$mem_tmp~0=v_~z$mem_tmp~0_43, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_670, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ULTIMATE.start_main_~#t759~0.base=|v_ULTIMATE.start_main_~#t759~0.base_29|, ULTIMATE.start_main_~#t758~0.base=|v_ULTIMATE.start_main_~#t758~0.base_37|, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t757~0.offset=|v_ULTIMATE.start_main_~#t757~0.offset_29|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_144, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_363, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~x~0=v_~x~0_150, ULTIMATE.start_main_~#t758~0.offset=|v_ULTIMATE.start_main_~#t758~0.offset_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_410, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_74|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_34|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_201, ~y~0=v_~y~0_71, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_110, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_26|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1072, ~z$w_buff0~0=v_~z$w_buff0~0_701, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_333, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_222, ~weak$$choice2~0=v_~weak$$choice2~0_160, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_186} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t758~0.offset, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t759~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t757~0.base, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t759~0.base, #NULL.base, ULTIMATE.start_main_~#t758~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t757~0.offset, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 13:09:15,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L823-1-->L825: Formula: (and (= |v_ULTIMATE.start_main_~#t758~0.offset_10| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t758~0.base_11| 4)) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t758~0.base_11| 1) |v_#valid_33|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t758~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t758~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t758~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t758~0.base_11|) |v_ULTIMATE.start_main_~#t758~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t758~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t758~0.base=|v_ULTIMATE.start_main_~#t758~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, ULTIMATE.start_main_~#t758~0.offset=|v_ULTIMATE.start_main_~#t758~0.offset_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t758~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t758~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 13:09:15,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_23 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|) (= v_~z$w_buff0_used~0_174 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= v_~z$w_buff0~0_53 v_~z$w_buff1~0_38) (= v_~z$w_buff0_used~0_175 v_~z$w_buff1_used~0_104) (= (mod v_~z$w_buff1_used~0_104 256) 0) (= 1 v_~z$w_buff0~0_52)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~z$w_buff0~0=v_~z$w_buff0~0_53, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_174, ~z$w_buff0~0=v_~z$w_buff0~0_52, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_104, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~z$w_buff1~0=v_~z$w_buff1~0_38, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_21|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:09:15,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L825-1-->L827: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t759~0.offset_9|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t759~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t759~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t759~0.base_10|) |v_ULTIMATE.start_main_~#t759~0.offset_9| 2)) |v_#memory_int_11|) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t759~0.base_10| 1) |v_#valid_29|) (not (= |v_ULTIMATE.start_main_~#t759~0.base_10| 0)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t759~0.base_10|) 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t759~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t759~0.offset=|v_ULTIMATE.start_main_~#t759~0.offset_9|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t759~0.base=|v_ULTIMATE.start_main_~#t759~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t759~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t759~0.base] because there is no mapped edge [2019-12-18 13:09:15,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L764-2-->L764-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1340648329 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1340648329 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out1340648329| ~z~0_In1340648329) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out1340648329| ~z$w_buff1~0_In1340648329) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1340648329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1340648329, ~z$w_buff1~0=~z$w_buff1~0_In1340648329, ~z~0=~z~0_In1340648329} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1340648329|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1340648329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1340648329, ~z$w_buff1~0=~z$w_buff1~0_In1340648329, ~z~0=~z~0_In1340648329} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 13:09:15,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-136663262 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_In-136663262| |P2Thread1of1ForFork2_#t~ite20_Out-136663262|) (= ~z$w_buff0~0_In-136663262 |P2Thread1of1ForFork2_#t~ite21_Out-136663262|) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-136663262| ~z$w_buff0~0_In-136663262) (= |P2Thread1of1ForFork2_#t~ite20_Out-136663262| |P2Thread1of1ForFork2_#t~ite21_Out-136663262|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-136663262 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-136663262 256))) (= (mod ~z$w_buff0_used~0_In-136663262 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-136663262 256)))))))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-136663262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-136663262, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_In-136663262|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-136663262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-136663262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-136663262, ~weak$$choice2~0=~weak$$choice2~0_In-136663262} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-136663262, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-136663262|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-136663262, P2Thread1of1ForFork2_#t~ite21=|P2Thread1of1ForFork2_#t~ite21_Out-136663262|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-136663262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-136663262, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-136663262, ~weak$$choice2~0=~weak$$choice2~0_In-136663262} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 13:09:15,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In125823701 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In125823701 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out125823701| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out125823701| ~z$w_buff0_used~0_In125823701) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In125823701, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In125823701} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out125823701|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In125823701, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In125823701} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:09:15,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1402730083 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1402730083 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1402730083 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1402730083 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1402730083|)) (and (= ~z$w_buff1_used~0_In1402730083 |P0Thread1of1ForFork0_#t~ite6_Out1402730083|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1402730083, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1402730083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1402730083, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1402730083} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1402730083|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1402730083, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1402730083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1402730083, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1402730083} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:09:15,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2134521839 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-2134521839 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out-2134521839 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In-2134521839 ~z$r_buff0_thd1~0_Out-2134521839)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134521839, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2134521839} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2134521839, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2134521839|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2134521839} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:09:15,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L748-->L748-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-743639206 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-743639206 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-743639206 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-743639206 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-743639206| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-743639206| ~z$r_buff1_thd1~0_In-743639206) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-743639206, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-743639206, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-743639206, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-743639206} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-743639206, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-743639206|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-743639206, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-743639206, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-743639206} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:09:15,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L748-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_62 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_62, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:09:15,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L790-->L790-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-390281085 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-390281085 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-390281085 256)) (and (= (mod ~z$r_buff1_thd3~0_In-390281085 256) 0) .cse1) (and (= (mod ~z$w_buff1_used~0_In-390281085 256) 0) .cse1))) (= |P2Thread1of1ForFork2_#t~ite24_Out-390281085| |P2Thread1of1ForFork2_#t~ite23_Out-390281085|) (= ~z$w_buff1~0_In-390281085 |P2Thread1of1ForFork2_#t~ite23_Out-390281085|)) (and (= |P2Thread1of1ForFork2_#t~ite24_Out-390281085| ~z$w_buff1~0_In-390281085) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In-390281085| |P2Thread1of1ForFork2_#t~ite23_Out-390281085|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-390281085|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-390281085, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-390281085, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-390281085, ~z$w_buff1~0=~z$w_buff1~0_In-390281085, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-390281085, ~weak$$choice2~0=~weak$$choice2~0_In-390281085} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-390281085|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-390281085|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-390281085, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-390281085, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-390281085, ~z$w_buff1~0=~z$w_buff1~0_In-390281085, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-390281085, ~weak$$choice2~0=~weak$$choice2~0_In-390281085} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 13:09:15,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L791-->L791-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1028993432 256) 0))) (or (and .cse0 (= ~z$w_buff0_used~0_In1028993432 |P2Thread1of1ForFork2_#t~ite26_Out1028993432|) (= |P2Thread1of1ForFork2_#t~ite27_Out1028993432| |P2Thread1of1ForFork2_#t~ite26_Out1028993432|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1028993432 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In1028993432 256)) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In1028993432 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1028993432 256))))) (and (= |P2Thread1of1ForFork2_#t~ite26_In1028993432| |P2Thread1of1ForFork2_#t~ite26_Out1028993432|) (= |P2Thread1of1ForFork2_#t~ite27_Out1028993432| ~z$w_buff0_used~0_In1028993432) (not .cse0)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In1028993432|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1028993432, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1028993432, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1028993432, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1028993432, ~weak$$choice2~0=~weak$$choice2~0_In1028993432} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out1028993432|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1028993432, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1028993432, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1028993432, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1028993432, ~weak$$choice2~0=~weak$$choice2~0_In1028993432, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out1028993432|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 13:09:15,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L793-->L794: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_119 v_~z$r_buff0_thd3~0_118)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_119, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_8|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:09:15,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_16) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 13:09:15,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-980081733 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-980081733 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-980081733| ~z$w_buff0_used~0_In-980081733)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-980081733| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-980081733, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-980081733} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-980081733, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-980081733|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-980081733} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 13:09:15,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1298977107 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1298977107 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1298977107 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1298977107 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out1298977107| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1298977107 |P1Thread1of1ForFork1_#t~ite12_Out1298977107|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1298977107, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1298977107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1298977107, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1298977107} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1298977107, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1298977107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1298977107, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1298977107|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1298977107} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:09:15,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1933236173 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-1933236173 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1933236173|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1933236173| ~z$r_buff0_thd2~0_In-1933236173)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1933236173, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1933236173} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1933236173, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1933236173|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1933236173} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 13:09:15,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L796-->L800: Formula: (and (= v_~z~0_64 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 13:09:15,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L800-2-->L800-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-1759521446| |P2Thread1of1ForFork2_#t~ite39_Out-1759521446|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1759521446 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1759521446 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork2_#t~ite38_Out-1759521446| ~z~0_In-1759521446)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-1759521446| ~z$w_buff1~0_In-1759521446) (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1759521446, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1759521446, ~z$w_buff1~0=~z$w_buff1~0_In-1759521446, ~z~0=~z~0_In-1759521446} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1759521446, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1759521446, ~z$w_buff1~0=~z$w_buff1~0_In-1759521446, ~z~0=~z~0_In-1759521446, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1759521446|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1759521446|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 13:09:15,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-536732647 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-536732647 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-536732647|)) (and (= ~z$w_buff0_used~0_In-536732647 |P2Thread1of1ForFork2_#t~ite40_Out-536732647|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-536732647, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-536732647} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-536732647, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-536732647, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-536732647|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 13:09:15,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In613926938 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In613926938 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In613926938 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In613926938 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out613926938| ~z$w_buff1_used~0_In613926938) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite41_Out613926938| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In613926938, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In613926938, ~z$w_buff1_used~0=~z$w_buff1_used~0_In613926938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In613926938} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out613926938|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In613926938, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In613926938, ~z$w_buff1_used~0=~z$w_buff1_used~0_In613926938, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In613926938} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 13:09:15,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In1114620541 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1114620541 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1114620541 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1114620541 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1114620541|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1114620541| ~z$r_buff1_thd2~0_In1114620541)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1114620541, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1114620541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1114620541, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1114620541} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1114620541, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1114620541, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1114620541, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1114620541|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1114620541} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:09:15,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_70) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_70, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:09:15,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1339521192 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1339521192 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out1339521192| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out1339521192| ~z$r_buff0_thd3~0_In1339521192)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1339521192, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1339521192} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out1339521192|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1339521192, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1339521192} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 13:09:15,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In288526506 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In288526506 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In288526506 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In288526506 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out288526506| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite43_Out288526506| ~z$r_buff1_thd3~0_In288526506) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In288526506, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In288526506, ~z$w_buff1_used~0=~z$w_buff1_used~0_In288526506, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In288526506} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In288526506, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In288526506, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out288526506|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In288526506, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In288526506} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 13:09:15,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L804-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= v_~z$r_buff1_thd3~0_119 |v_P2Thread1of1ForFork2_#t~ite43_28|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_119, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_27|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 13:09:15,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L827-1-->L833: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 3 v_~__unbuffered_cnt~0_34)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:09:15,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L833-2-->L833-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In190733689 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In190733689 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite47_Out190733689| |ULTIMATE.start_main_#t~ite48_Out190733689|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out190733689| ~z~0_In190733689) .cse2) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out190733689| ~z$w_buff1~0_In190733689) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In190733689, ~z$w_buff1_used~0=~z$w_buff1_used~0_In190733689, ~z$w_buff1~0=~z$w_buff1~0_In190733689, ~z~0=~z~0_In190733689} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In190733689, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out190733689|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In190733689, ~z$w_buff1~0=~z$w_buff1~0_In190733689, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out190733689|, ~z~0=~z~0_In190733689} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:09:15,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1637027164 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1637027164 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1637027164 |ULTIMATE.start_main_#t~ite49_Out-1637027164|)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1637027164| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1637027164, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1637027164} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1637027164, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1637027164, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1637027164|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:09:15,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1380092603 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1380092603 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1380092603 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1380092603 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1380092603 |ULTIMATE.start_main_#t~ite50_Out-1380092603|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1380092603|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1380092603, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1380092603, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1380092603, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1380092603} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1380092603|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1380092603, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1380092603, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1380092603, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1380092603} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:09:15,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In111151249 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In111151249 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out111151249| ~z$r_buff0_thd0~0_In111151249) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out111151249| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In111151249, ~z$w_buff0_used~0=~z$w_buff0_used~0_In111151249} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In111151249, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out111151249|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In111151249} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:09:15,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1451222975 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1451222975 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1451222975 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1451222975 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out1451222975| ~z$r_buff1_thd0~0_In1451222975) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out1451222975| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1451222975, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1451222975, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1451222975, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1451222975} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1451222975|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1451222975, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1451222975, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1451222975, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1451222975} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:09:15,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L837-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_37 2) (= 2 v_~__unbuffered_p2_EAX~0_30) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~__unbuffered_p2_EBX~0_37 0) (= 2 v_~x~0_117) (= v_~main$tmp_guard1~0_27 0) (= (mod v_~main$tmp_guard1~0_27 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_162 |v_ULTIMATE.start_main_#t~ite52_69|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_69|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_162, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~y~0=v_~y~0_37, ~x~0=v_~x~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:09:16,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:09:16 BasicIcfg [2019-12-18 13:09:16,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:09:16,057 INFO L168 Benchmark]: Toolchain (without parser) took 161015.92 ms. Allocated memory was 145.2 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 100.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 853.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:09:16,057 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:09:16,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.83 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 100.5 MB in the beginning and 157.4 MB in the end (delta: -56.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:09:16,058 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.78 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:09:16,058 INFO L168 Benchmark]: Boogie Preprocessor took 43.84 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:09:16,058 INFO L168 Benchmark]: RCFGBuilder took 893.87 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 102.3 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:09:16,059 INFO L168 Benchmark]: TraceAbstraction took 159184.82 ms. Allocated memory was 203.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 102.3 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 796.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:09:16,061 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.52 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.83 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 100.5 MB in the beginning and 157.4 MB in the end (delta: -56.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.78 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.84 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 893.87 ms. Allocated memory is still 203.9 MB. Free memory was 152.1 MB in the beginning and 102.3 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 159184.82 ms. Allocated memory was 203.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 102.3 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 796.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.5s, 175 ProgramPointsBefore, 93 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 6798 VarBasedMoverChecksPositive, 289 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 285 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 0 MoverChecksTotal, 87070 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t757, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t758, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t759, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 3 z$flush_delayed = weak$$choice2 [L787] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L788] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L790] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L791] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L792] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=1, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L792] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=1, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L794] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L801] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L802] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L803] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L836] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 158.8s, OverallIterations: 40, TraceHistogramMax: 1, AutomataDifference: 80.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11056 SDtfs, 16119 SDslu, 40430 SDs, 0 SdLazy, 45378 SolverSat, 1110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 907 GetRequests, 86 SyntacticMatches, 41 SemanticMatches, 780 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11002 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151934occurred 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: 43.8s AutomataMinimizationTime, 39 MinimizatonAttempts, 421059 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 1880 NumberOfCodeBlocks, 1880 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1774 ConstructedInterpolants, 0 QuantifiedInterpolants, 603971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...