/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/mix032_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:15:37,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:15:37,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:15:37,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:15:37,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:15:37,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:15:37,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:15:37,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:15:37,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:15:37,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:15:37,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:15:37,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:15:37,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:15:37,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:15:37,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:15:37,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:15:37,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:15:37,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:15:37,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:15:37,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:15:37,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:15:37,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:15:37,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:15:37,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:15:37,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:15:37,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:15:37,777 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:15:37,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:15:37,778 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:15:37,779 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:15:37,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:15:37,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:15:37,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:15:37,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:15:37,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:15:37,783 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:15:37,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:15:37,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:15:37,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:15:37,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:15:37,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:15:37,786 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:15:37,806 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:15:37,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:15:37,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:15:37,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:15:37,810 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:15:37,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:15:37,811 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:15:37,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:15:37,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:15:37,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:15:37,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:15:37,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:15:37,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:15:37,813 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:15:37,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:15:37,813 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:15:37,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:15:37,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:15:37,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:15:37,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:15:37,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:15:37,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:15:37,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:15:37,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:15:37,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:15:37,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:15:37,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:15:37,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:15:37,817 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:15:37,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:15:38,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:15:38,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:15:38,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:15:38,106 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:15:38,107 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:15:38,108 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_pso.oepc.i [2019-12-18 13:15:38,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccd7866c/e54ab280c5c84d3fb74bac38843619fa/FLAG68b9f4f67 [2019-12-18 13:15:38,743 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:15:38,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_pso.oepc.i [2019-12-18 13:15:38,762 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccd7866c/e54ab280c5c84d3fb74bac38843619fa/FLAG68b9f4f67 [2019-12-18 13:15:39,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bccd7866c/e54ab280c5c84d3fb74bac38843619fa [2019-12-18 13:15:39,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:15:39,010 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:15:39,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:15:39,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:15:39,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:15:39,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:15:39" (1/1) ... [2019-12-18 13:15:39,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e483e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:39, skipping insertion in model container [2019-12-18 13:15:39,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:15:39" (1/1) ... [2019-12-18 13:15:39,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:15:39,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:15:39,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:15:39,645 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:15:39,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:15:39,812 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:15:39,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:39 WrapperNode [2019-12-18 13:15:39,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:15:39,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:15:39,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:15:39,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:15:39,823 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:15:39" (1/1) ... [2019-12-18 13:15:39,851 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:15:39" (1/1) ... [2019-12-18 13:15:39,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:15:39,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:15:39,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:15:39,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:15:39,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:39" (1/1) ... [2019-12-18 13:15:39,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:39" (1/1) ... [2019-12-18 13:15:39,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:39" (1/1) ... [2019-12-18 13:15:39,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:39" (1/1) ... [2019-12-18 13:15:39,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:39" (1/1) ... [2019-12-18 13:15:39,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:39" (1/1) ... [2019-12-18 13:15:39,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:39" (1/1) ... [2019-12-18 13:15:39,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:15:39,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:15:39,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:15:39,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:15:39,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:39" (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:15:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:15:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:15:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:15:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:15:40,000 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:15:40,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:15:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:15:40,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:15:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:15:40,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:15:40,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:15:40,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:15:40,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:15:40,004 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:15:40,790 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:15:40,790 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:15:40,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:15:40 BoogieIcfgContainer [2019-12-18 13:15:40,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:15:40,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:15:40,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:15:40,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:15:40,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:15:39" (1/3) ... [2019-12-18 13:15:40,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395a4379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:15:40, skipping insertion in model container [2019-12-18 13:15:40,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:15:39" (2/3) ... [2019-12-18 13:15:40,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395a4379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:15:40, skipping insertion in model container [2019-12-18 13:15:40,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:15:40" (3/3) ... [2019-12-18 13:15:40,801 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_pso.oepc.i [2019-12-18 13:15:40,811 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:15:40,811 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:15:40,819 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:15:40,820 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:15:40,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,866 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,867 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,867 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,868 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,868 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,876 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,901 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,902 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,903 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,928 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,928 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,934 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,936 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:15:40,961 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:15:40,984 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:15:40,984 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:15:40,984 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:15:40,984 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:15:40,984 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:15:40,984 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:15:40,985 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:15:40,985 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:15:41,009 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-18 13:15:41,011 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 13:15:41,104 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 13:15:41,105 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:15:41,123 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:15:41,152 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-18 13:15:41,207 INFO L126 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-18 13:15:41,207 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:15:41,220 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:15:41,245 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:15:41,246 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:15:46,742 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 13:15:46,891 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 13:15:46,925 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-18 13:15:46,925 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 13:15:46,929 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-18 13:16:09,850 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-18 13:16:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-18 13:16:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:16:09,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:09,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:16:09,859 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:16:09,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:09,864 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-18 13:16:09,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:09,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042906292] [2019-12-18 13:16:09,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:10,126 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:16:10,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042906292] [2019-12-18 13:16:10,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:10,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:16:10,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119491204] [2019-12-18 13:16:10,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:16:10,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:10,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:16:10,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:16:10,147 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-18 13:16:14,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:14,752 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-18 13:16:14,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:16:14,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:16:14,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:15,556 INFO L225 Difference]: With dead ends: 128376 [2019-12-18 13:16:15,556 INFO L226 Difference]: Without dead ends: 120914 [2019-12-18 13:16:15,559 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:16:20,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-18 13:16:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-18 13:16:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-18 13:16:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-18 13:16:28,142 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-18 13:16:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:28,142 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-18 13:16:28,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:16:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-18 13:16:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:16:28,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:28,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:16:28,147 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:16:28,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:28,147 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-18 13:16:28,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:28,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134116936] [2019-12-18 13:16:28,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:28,254 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:16:28,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134116936] [2019-12-18 13:16:28,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:28,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:16:28,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261326840] [2019-12-18 13:16:28,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:16:28,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:28,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:16:28,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:16:28,258 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-18 13:16:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:34,696 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-18 13:16:34,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:16:34,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:16:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:35,323 INFO L225 Difference]: With dead ends: 187704 [2019-12-18 13:16:35,324 INFO L226 Difference]: Without dead ends: 187655 [2019-12-18 13:16:35,325 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:16:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-18 13:16:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-18 13:16:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-18 13:16:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-18 13:16:45,789 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-18 13:16:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:45,789 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-18 13:16:45,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:16:45,789 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-18 13:16:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:16:45,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:45,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:16:45,796 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:16:45,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:45,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-18 13:16:45,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:45,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596189657] [2019-12-18 13:16:45,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:45,887 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:16:45,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596189657] [2019-12-18 13:16:45,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:45,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:16:45,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857223036] [2019-12-18 13:16:45,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:16:45,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:45,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:16:45,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:16:45,889 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 3 states. [2019-12-18 13:16:46,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:46,018 INFO L93 Difference]: Finished difference Result 36261 states and 117727 transitions. [2019-12-18 13:16:46,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:16:46,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:16:46,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:46,088 INFO L225 Difference]: With dead ends: 36261 [2019-12-18 13:16:46,088 INFO L226 Difference]: Without dead ends: 36261 [2019-12-18 13:16:46,088 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:16:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36261 states. [2019-12-18 13:16:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36261 to 36261. [2019-12-18 13:16:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36261 states. [2019-12-18 13:16:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36261 states to 36261 states and 117727 transitions. [2019-12-18 13:16:52,025 INFO L78 Accepts]: Start accepts. Automaton has 36261 states and 117727 transitions. Word has length 13 [2019-12-18 13:16:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:52,026 INFO L462 AbstractCegarLoop]: Abstraction has 36261 states and 117727 transitions. [2019-12-18 13:16:52,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:16:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 36261 states and 117727 transitions. [2019-12-18 13:16:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:16:52,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:52,029 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:16:52,030 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:16:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:52,030 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-18 13:16:52,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:52,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311576951] [2019-12-18 13:16:52,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:52,149 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:16:52,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311576951] [2019-12-18 13:16:52,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:52,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:16:52,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885307158] [2019-12-18 13:16:52,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:16:52,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:52,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:16:52,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:16:52,153 INFO L87 Difference]: Start difference. First operand 36261 states and 117727 transitions. Second operand 5 states. [2019-12-18 13:16:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:52,711 INFO L93 Difference]: Finished difference Result 50300 states and 161544 transitions. [2019-12-18 13:16:52,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:16:52,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 13:16:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:52,816 INFO L225 Difference]: With dead ends: 50300 [2019-12-18 13:16:52,816 INFO L226 Difference]: Without dead ends: 50300 [2019-12-18 13:16:52,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:16:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50300 states. [2019-12-18 13:16:53,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50300 to 43029. [2019-12-18 13:16:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-18 13:16:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-18 13:16:53,688 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 16 [2019-12-18 13:16:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:53,689 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-18 13:16:53,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:16:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-18 13:16:53,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:16:53,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:53,700 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:16:53,700 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:16:53,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:53,700 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-18 13:16:53,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:53,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514677128] [2019-12-18 13:16:53,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:54,222 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:16:54,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514677128] [2019-12-18 13:16:54,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:54,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:16:54,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313548065] [2019-12-18 13:16:54,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:16:54,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:54,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:16:54,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:16:54,225 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 6 states. [2019-12-18 13:16:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:55,133 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-18 13:16:55,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:16:55,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 13:16:55,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:55,249 INFO L225 Difference]: With dead ends: 64122 [2019-12-18 13:16:55,249 INFO L226 Difference]: Without dead ends: 64115 [2019-12-18 13:16:55,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:16:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-18 13:16:56,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-18 13:16:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-18 13:16:56,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-18 13:16:56,124 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-18 13:16:56,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:56,124 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-18 13:16:56,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:16:56,125 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-18 13:16:56,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:16:56,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:56,139 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:16:56,139 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:16:56,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:56,140 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-18 13:16:56,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:56,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523630242] [2019-12-18 13:16:56,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:56,199 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:16:56,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523630242] [2019-12-18 13:16:56,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:56,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:16:56,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687702465] [2019-12-18 13:16:56,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:16:56,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:56,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:16:56,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:16:56,201 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 4 states. [2019-12-18 13:16:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:56,262 INFO L93 Difference]: Finished difference Result 17024 states and 51836 transitions. [2019-12-18 13:16:56,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:16:56,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:16:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:56,286 INFO L225 Difference]: With dead ends: 17024 [2019-12-18 13:16:56,286 INFO L226 Difference]: Without dead ends: 17024 [2019-12-18 13:16:56,286 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:16:56,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-12-18 13:16:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16731. [2019-12-18 13:16:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2019-12-18 13:16:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 51000 transitions. [2019-12-18 13:16:56,532 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 51000 transitions. Word has length 25 [2019-12-18 13:16:56,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:56,533 INFO L462 AbstractCegarLoop]: Abstraction has 16731 states and 51000 transitions. [2019-12-18 13:16:56,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:16:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 51000 transitions. [2019-12-18 13:16:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:16:56,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:56,545 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:16:56,545 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:16:56,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:56,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-18 13:16:56,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:56,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547964700] [2019-12-18 13:16:56,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:56,603 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:16:56,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547964700] [2019-12-18 13:16:56,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:56,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:16:56,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649593008] [2019-12-18 13:16:56,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:16:56,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:56,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:16:56,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:16:56,605 INFO L87 Difference]: Start difference. First operand 16731 states and 51000 transitions. Second operand 3 states. [2019-12-18 13:16:56,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:56,936 INFO L93 Difference]: Finished difference Result 24375 states and 72822 transitions. [2019-12-18 13:16:56,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:16:56,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:16:56,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:56,968 INFO L225 Difference]: With dead ends: 24375 [2019-12-18 13:16:56,968 INFO L226 Difference]: Without dead ends: 24375 [2019-12-18 13:16:56,968 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:16:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24375 states. [2019-12-18 13:16:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24375 to 18589. [2019-12-18 13:16:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18589 states. [2019-12-18 13:16:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 56096 transitions. [2019-12-18 13:16:57,271 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 56096 transitions. Word has length 27 [2019-12-18 13:16:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:57,272 INFO L462 AbstractCegarLoop]: Abstraction has 18589 states and 56096 transitions. [2019-12-18 13:16:57,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:16:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 56096 transitions. [2019-12-18 13:16:57,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:16:57,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:57,284 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:16:57,284 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:16:57,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:57,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-18 13:16:57,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:57,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177637205] [2019-12-18 13:16:57,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:57,403 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:16:57,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177637205] [2019-12-18 13:16:57,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:57,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:16:57,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536879288] [2019-12-18 13:16:57,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:16:57,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:57,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:16:57,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:16:57,405 INFO L87 Difference]: Start difference. First operand 18589 states and 56096 transitions. Second operand 6 states. [2019-12-18 13:16:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:58,019 INFO L93 Difference]: Finished difference Result 26038 states and 76681 transitions. [2019-12-18 13:16:58,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:16:58,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:16:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:58,056 INFO L225 Difference]: With dead ends: 26038 [2019-12-18 13:16:58,056 INFO L226 Difference]: Without dead ends: 26038 [2019-12-18 13:16:58,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:16:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26038 states. [2019-12-18 13:16:58,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26038 to 21331. [2019-12-18 13:16:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-18 13:16:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 64000 transitions. [2019-12-18 13:16:58,392 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 64000 transitions. Word has length 27 [2019-12-18 13:16:58,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:16:58,392 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 64000 transitions. [2019-12-18 13:16:58,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:16:58,392 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 64000 transitions. [2019-12-18 13:16:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:16:58,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:16:58,414 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:16:58,414 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:16:58,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:16:58,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-18 13:16:58,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:16:58,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803178606] [2019-12-18 13:16:58,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:16:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:16:58,505 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:16:58,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803178606] [2019-12-18 13:16:58,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:16:58,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:16:58,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909485515] [2019-12-18 13:16:58,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:16:58,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:16:58,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:16:58,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:16:58,507 INFO L87 Difference]: Start difference. First operand 21331 states and 64000 transitions. Second operand 7 states. [2019-12-18 13:16:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:16:59,729 INFO L93 Difference]: Finished difference Result 28794 states and 84449 transitions. [2019-12-18 13:16:59,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:16:59,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:16:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:16:59,769 INFO L225 Difference]: With dead ends: 28794 [2019-12-18 13:16:59,769 INFO L226 Difference]: Without dead ends: 28794 [2019-12-18 13:16:59,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:16:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2019-12-18 13:17:00,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 19492. [2019-12-18 13:17:00,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19492 states. [2019-12-18 13:17:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19492 states to 19492 states and 58703 transitions. [2019-12-18 13:17:00,105 INFO L78 Accepts]: Start accepts. Automaton has 19492 states and 58703 transitions. Word has length 33 [2019-12-18 13:17:00,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:00,105 INFO L462 AbstractCegarLoop]: Abstraction has 19492 states and 58703 transitions. [2019-12-18 13:17:00,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:17:00,106 INFO L276 IsEmpty]: Start isEmpty. Operand 19492 states and 58703 transitions. [2019-12-18 13:17:00,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:17:00,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:00,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:00,130 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:17:00,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:00,131 INFO L82 PathProgramCache]: Analyzing trace with hash 603828080, now seen corresponding path program 1 times [2019-12-18 13:17:00,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:00,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492032685] [2019-12-18 13:17:00,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:00,185 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:17:00,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492032685] [2019-12-18 13:17:00,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:00,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:00,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767812859] [2019-12-18 13:17:00,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:00,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:00,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:00,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:00,187 INFO L87 Difference]: Start difference. First operand 19492 states and 58703 transitions. Second operand 4 states. [2019-12-18 13:17:00,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:00,551 INFO L93 Difference]: Finished difference Result 33180 states and 100186 transitions. [2019-12-18 13:17:00,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:17:00,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-18 13:17:00,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:00,575 INFO L225 Difference]: With dead ends: 33180 [2019-12-18 13:17:00,575 INFO L226 Difference]: Without dead ends: 16657 [2019-12-18 13:17:00,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:17:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16657 states. [2019-12-18 13:17:00,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16657 to 16583. [2019-12-18 13:17:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16583 states. [2019-12-18 13:17:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16583 states to 16583 states and 49025 transitions. [2019-12-18 13:17:00,818 INFO L78 Accepts]: Start accepts. Automaton has 16583 states and 49025 transitions. Word has length 39 [2019-12-18 13:17:00,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:00,818 INFO L462 AbstractCegarLoop]: Abstraction has 16583 states and 49025 transitions. [2019-12-18 13:17:00,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:17:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 16583 states and 49025 transitions. [2019-12-18 13:17:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:17:00,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:00,838 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:17:00,838 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:17:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:00,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1247651138, now seen corresponding path program 2 times [2019-12-18 13:17:00,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:00,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933033316] [2019-12-18 13:17:00,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:00,903 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:17:00,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933033316] [2019-12-18 13:17:00,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:00,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:17:00,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801162461] [2019-12-18 13:17:00,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:00,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:00,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:00,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:00,905 INFO L87 Difference]: Start difference. First operand 16583 states and 49025 transitions. Second operand 3 states. [2019-12-18 13:17:00,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:00,967 INFO L93 Difference]: Finished difference Result 16582 states and 49023 transitions. [2019-12-18 13:17:00,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:00,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:17:00,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:00,995 INFO L225 Difference]: With dead ends: 16582 [2019-12-18 13:17:00,996 INFO L226 Difference]: Without dead ends: 16582 [2019-12-18 13:17:00,996 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:17:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16582 states. [2019-12-18 13:17:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16582 to 16582. [2019-12-18 13:17:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16582 states. [2019-12-18 13:17:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16582 states to 16582 states and 49023 transitions. [2019-12-18 13:17:01,336 INFO L78 Accepts]: Start accepts. Automaton has 16582 states and 49023 transitions. Word has length 39 [2019-12-18 13:17:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:01,337 INFO L462 AbstractCegarLoop]: Abstraction has 16582 states and 49023 transitions. [2019-12-18 13:17:01,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 16582 states and 49023 transitions. [2019-12-18 13:17:01,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:17:01,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:01,352 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:17:01,352 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:17:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2020108147, now seen corresponding path program 1 times [2019-12-18 13:17:01,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:01,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096852467] [2019-12-18 13:17:01,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:01,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:17:01,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096852467] [2019-12-18 13:17:01,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:01,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:01,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488280108] [2019-12-18 13:17:01,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:01,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:01,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:01,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:01,465 INFO L87 Difference]: Start difference. First operand 16582 states and 49023 transitions. Second operand 4 states. [2019-12-18 13:17:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:01,569 INFO L93 Difference]: Finished difference Result 26060 states and 77460 transitions. [2019-12-18 13:17:01,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:17:01,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 13:17:01,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:01,589 INFO L225 Difference]: With dead ends: 26060 [2019-12-18 13:17:01,589 INFO L226 Difference]: Without dead ends: 11670 [2019-12-18 13:17:01,590 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:17:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11670 states. [2019-12-18 13:17:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11670 to 11605. [2019-12-18 13:17:01,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11605 states. [2019-12-18 13:17:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 33387 transitions. [2019-12-18 13:17:01,759 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 33387 transitions. Word has length 40 [2019-12-18 13:17:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:01,760 INFO L462 AbstractCegarLoop]: Abstraction has 11605 states and 33387 transitions. [2019-12-18 13:17:01,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:17:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 33387 transitions. [2019-12-18 13:17:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:17:01,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:01,771 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:17:01,771 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:17:01,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:01,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1707989501, now seen corresponding path program 2 times [2019-12-18 13:17:01,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:01,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556246150] [2019-12-18 13:17:01,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:01,824 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:17:01,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556246150] [2019-12-18 13:17:01,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:01,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:17:01,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850220861] [2019-12-18 13:17:01,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:17:01,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:01,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:17:01,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:01,826 INFO L87 Difference]: Start difference. First operand 11605 states and 33387 transitions. Second operand 5 states. [2019-12-18 13:17:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:01,890 INFO L93 Difference]: Finished difference Result 10656 states and 31273 transitions. [2019-12-18 13:17:01,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:17:01,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:17:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:01,909 INFO L225 Difference]: With dead ends: 10656 [2019-12-18 13:17:01,909 INFO L226 Difference]: Without dead ends: 7573 [2019-12-18 13:17:01,910 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:17:02,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-18 13:17:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-18 13:17:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-18 13:17:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 24358 transitions. [2019-12-18 13:17:02,131 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 24358 transitions. Word has length 40 [2019-12-18 13:17:02,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:02,131 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 24358 transitions. [2019-12-18 13:17:02,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:17:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 24358 transitions. [2019-12-18 13:17:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:02,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:02,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:02,145 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:17:02,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:02,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1827713058, now seen corresponding path program 1 times [2019-12-18 13:17:02,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:02,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911483982] [2019-12-18 13:17:02,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:02,190 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:17:02,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911483982] [2019-12-18 13:17:02,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:02,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:02,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914682968] [2019-12-18 13:17:02,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:02,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:02,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:02,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:02,192 INFO L87 Difference]: Start difference. First operand 7573 states and 24358 transitions. Second operand 3 states. [2019-12-18 13:17:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:02,265 INFO L93 Difference]: Finished difference Result 10082 states and 31704 transitions. [2019-12-18 13:17:02,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:02,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:17:02,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:02,284 INFO L225 Difference]: With dead ends: 10082 [2019-12-18 13:17:02,284 INFO L226 Difference]: Without dead ends: 10082 [2019-12-18 13:17:02,285 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:17:02,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-12-18 13:17:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 7729. [2019-12-18 13:17:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7729 states. [2019-12-18 13:17:02,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 24514 transitions. [2019-12-18 13:17:02,472 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 24514 transitions. Word has length 64 [2019-12-18 13:17:02,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:02,472 INFO L462 AbstractCegarLoop]: Abstraction has 7729 states and 24514 transitions. [2019-12-18 13:17:02,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:02,473 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 24514 transitions. [2019-12-18 13:17:02,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:02,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:02,483 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:02,483 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:17:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:02,483 INFO L82 PathProgramCache]: Analyzing trace with hash 572197328, now seen corresponding path program 1 times [2019-12-18 13:17:02,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:02,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987267197] [2019-12-18 13:17:02,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:02,567 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:17:02,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987267197] [2019-12-18 13:17:02,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:02,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:17:02,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299519570] [2019-12-18 13:17:02,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:17:02,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:02,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:17:02,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:17:02,570 INFO L87 Difference]: Start difference. First operand 7729 states and 24514 transitions. Second operand 7 states. [2019-12-18 13:17:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:02,898 INFO L93 Difference]: Finished difference Result 15437 states and 48014 transitions. [2019-12-18 13:17:02,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:17:02,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:17:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:02,920 INFO L225 Difference]: With dead ends: 15437 [2019-12-18 13:17:02,920 INFO L226 Difference]: Without dead ends: 11573 [2019-12-18 13:17:02,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:17:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11573 states. [2019-12-18 13:17:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11573 to 9445. [2019-12-18 13:17:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-12-18 13:17:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 29808 transitions. [2019-12-18 13:17:03,137 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 29808 transitions. Word has length 64 [2019-12-18 13:17:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:03,137 INFO L462 AbstractCegarLoop]: Abstraction has 9445 states and 29808 transitions. [2019-12-18 13:17:03,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:17:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 29808 transitions. [2019-12-18 13:17:03,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:03,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:03,150 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:03,150 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:17:03,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:03,151 INFO L82 PathProgramCache]: Analyzing trace with hash -22937850, now seen corresponding path program 2 times [2019-12-18 13:17:03,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:03,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165995067] [2019-12-18 13:17:03,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:03,269 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:17:03,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165995067] [2019-12-18 13:17:03,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:03,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:17:03,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049412605] [2019-12-18 13:17:03,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:17:03,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:03,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:17:03,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:17:03,271 INFO L87 Difference]: Start difference. First operand 9445 states and 29808 transitions. Second operand 7 states. [2019-12-18 13:17:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:03,738 INFO L93 Difference]: Finished difference Result 17385 states and 53705 transitions. [2019-12-18 13:17:03,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:17:03,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:17:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:03,757 INFO L225 Difference]: With dead ends: 17385 [2019-12-18 13:17:03,758 INFO L226 Difference]: Without dead ends: 13105 [2019-12-18 13:17:03,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:17:03,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-12-18 13:17:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 10746. [2019-12-18 13:17:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10746 states. [2019-12-18 13:17:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10746 states to 10746 states and 33681 transitions. [2019-12-18 13:17:03,947 INFO L78 Accepts]: Start accepts. Automaton has 10746 states and 33681 transitions. Word has length 64 [2019-12-18 13:17:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:03,947 INFO L462 AbstractCegarLoop]: Abstraction has 10746 states and 33681 transitions. [2019-12-18 13:17:03,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:17:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 10746 states and 33681 transitions. [2019-12-18 13:17:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:03,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:03,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:03,960 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:17:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:03,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1388618928, now seen corresponding path program 3 times [2019-12-18 13:17:03,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:03,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625939490] [2019-12-18 13:17:03,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:04,075 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:17:04,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625939490] [2019-12-18 13:17:04,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:04,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:04,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759923260] [2019-12-18 13:17:04,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:17:04,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:17:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:17:04,078 INFO L87 Difference]: Start difference. First operand 10746 states and 33681 transitions. Second operand 9 states. [2019-12-18 13:17:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:05,207 INFO L93 Difference]: Finished difference Result 24832 states and 76056 transitions. [2019-12-18 13:17:05,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 13:17:05,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:17:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:05,246 INFO L225 Difference]: With dead ends: 24832 [2019-12-18 13:17:05,247 INFO L226 Difference]: Without dead ends: 22344 [2019-12-18 13:17:05,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:17:05,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22344 states. [2019-12-18 13:17:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22344 to 10578. [2019-12-18 13:17:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10578 states. [2019-12-18 13:17:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10578 states to 10578 states and 33121 transitions. [2019-12-18 13:17:05,551 INFO L78 Accepts]: Start accepts. Automaton has 10578 states and 33121 transitions. Word has length 64 [2019-12-18 13:17:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:05,552 INFO L462 AbstractCegarLoop]: Abstraction has 10578 states and 33121 transitions. [2019-12-18 13:17:05,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:17:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 10578 states and 33121 transitions. [2019-12-18 13:17:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:05,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:05,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:05,565 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:17:05,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:05,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1527941036, now seen corresponding path program 4 times [2019-12-18 13:17:05,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:05,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023553044] [2019-12-18 13:17:05,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:05,702 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:17:05,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023553044] [2019-12-18 13:17:05,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:05,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:05,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046400293] [2019-12-18 13:17:05,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:17:05,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:05,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:17:05,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:17:05,711 INFO L87 Difference]: Start difference. First operand 10578 states and 33121 transitions. Second operand 9 states. [2019-12-18 13:17:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:06,734 INFO L93 Difference]: Finished difference Result 28772 states and 88210 transitions. [2019-12-18 13:17:06,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:17:06,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 13:17:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:06,786 INFO L225 Difference]: With dead ends: 28772 [2019-12-18 13:17:06,786 INFO L226 Difference]: Without dead ends: 26348 [2019-12-18 13:17:06,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:17:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26348 states. [2019-12-18 13:17:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26348 to 10606. [2019-12-18 13:17:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10606 states. [2019-12-18 13:17:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10606 states to 10606 states and 33275 transitions. [2019-12-18 13:17:07,139 INFO L78 Accepts]: Start accepts. Automaton has 10606 states and 33275 transitions. Word has length 64 [2019-12-18 13:17:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:07,139 INFO L462 AbstractCegarLoop]: Abstraction has 10606 states and 33275 transitions. [2019-12-18 13:17:07,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:17:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 10606 states and 33275 transitions. [2019-12-18 13:17:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:17:07,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:07,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:07,156 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:17:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:07,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1911526292, now seen corresponding path program 5 times [2019-12-18 13:17:07,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:07,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479240873] [2019-12-18 13:17:07,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:07,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479240873] [2019-12-18 13:17:07,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:07,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:07,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963045341] [2019-12-18 13:17:07,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:07,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:07,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:07,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:07,217 INFO L87 Difference]: Start difference. First operand 10606 states and 33275 transitions. Second operand 3 states. [2019-12-18 13:17:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:07,316 INFO L93 Difference]: Finished difference Result 12322 states and 38579 transitions. [2019-12-18 13:17:07,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:07,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:17:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:07,336 INFO L225 Difference]: With dead ends: 12322 [2019-12-18 13:17:07,336 INFO L226 Difference]: Without dead ends: 12322 [2019-12-18 13:17:07,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12322 states. [2019-12-18 13:17:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12322 to 11074. [2019-12-18 13:17:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11074 states. [2019-12-18 13:17:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11074 states to 11074 states and 34835 transitions. [2019-12-18 13:17:07,516 INFO L78 Accepts]: Start accepts. Automaton has 11074 states and 34835 transitions. Word has length 64 [2019-12-18 13:17:07,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:07,517 INFO L462 AbstractCegarLoop]: Abstraction has 11074 states and 34835 transitions. [2019-12-18 13:17:07,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:07,517 INFO L276 IsEmpty]: Start isEmpty. Operand 11074 states and 34835 transitions. [2019-12-18 13:17:07,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:07,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:07,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:07,529 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:17:07,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:07,529 INFO L82 PathProgramCache]: Analyzing trace with hash -2140458066, now seen corresponding path program 1 times [2019-12-18 13:17:07,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:07,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693934898] [2019-12-18 13:17:07,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:07,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693934898] [2019-12-18 13:17:07,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:07,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:17:07,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401794468] [2019-12-18 13:17:07,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:17:07,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:07,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:17:07,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:17:07,640 INFO L87 Difference]: Start difference. First operand 11074 states and 34835 transitions. Second operand 8 states. [2019-12-18 13:17:08,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:08,633 INFO L93 Difference]: Finished difference Result 29477 states and 90578 transitions. [2019-12-18 13:17:08,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:17:08,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 13:17:08,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:08,669 INFO L225 Difference]: With dead ends: 29477 [2019-12-18 13:17:08,669 INFO L226 Difference]: Without dead ends: 26544 [2019-12-18 13:17:08,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:17:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26544 states. [2019-12-18 13:17:08,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26544 to 11347. [2019-12-18 13:17:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11347 states. [2019-12-18 13:17:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11347 states to 11347 states and 35865 transitions. [2019-12-18 13:17:08,952 INFO L78 Accepts]: Start accepts. Automaton has 11347 states and 35865 transitions. Word has length 65 [2019-12-18 13:17:08,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:08,952 INFO L462 AbstractCegarLoop]: Abstraction has 11347 states and 35865 transitions. [2019-12-18 13:17:08,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:17:08,952 INFO L276 IsEmpty]: Start isEmpty. Operand 11347 states and 35865 transitions. [2019-12-18 13:17:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:08,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:08,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:08,965 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:17:08,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:08,965 INFO L82 PathProgramCache]: Analyzing trace with hash -281745782, now seen corresponding path program 2 times [2019-12-18 13:17:08,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:08,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795190480] [2019-12-18 13:17:08,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:09,082 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:17:09,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795190480] [2019-12-18 13:17:09,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:09,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:09,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408625116] [2019-12-18 13:17:09,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:17:09,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:09,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:17:09,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:17:09,084 INFO L87 Difference]: Start difference. First operand 11347 states and 35865 transitions. Second operand 9 states. [2019-12-18 13:17:10,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:10,037 INFO L93 Difference]: Finished difference Result 32061 states and 97811 transitions. [2019-12-18 13:17:10,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:17:10,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:17:10,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:10,076 INFO L225 Difference]: With dead ends: 32061 [2019-12-18 13:17:10,076 INFO L226 Difference]: Without dead ends: 29128 [2019-12-18 13:17:10,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-18 13:17:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29128 states. [2019-12-18 13:17:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29128 to 11355. [2019-12-18 13:17:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11355 states. [2019-12-18 13:17:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11355 states to 11355 states and 35880 transitions. [2019-12-18 13:17:10,362 INFO L78 Accepts]: Start accepts. Automaton has 11355 states and 35880 transitions. Word has length 65 [2019-12-18 13:17:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:10,362 INFO L462 AbstractCegarLoop]: Abstraction has 11355 states and 35880 transitions. [2019-12-18 13:17:10,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:17:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 11355 states and 35880 transitions. [2019-12-18 13:17:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:10,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:10,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:10,380 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:17:10,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:10,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1813356122, now seen corresponding path program 3 times [2019-12-18 13:17:10,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:10,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759701876] [2019-12-18 13:17:10,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:10,484 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:17:10,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759701876] [2019-12-18 13:17:10,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:10,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:10,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796966490] [2019-12-18 13:17:10,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:17:10,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:10,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:17:10,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:17:10,488 INFO L87 Difference]: Start difference. First operand 11355 states and 35880 transitions. Second operand 9 states. [2019-12-18 13:17:11,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:11,698 INFO L93 Difference]: Finished difference Result 33909 states and 103392 transitions. [2019-12-18 13:17:11,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:17:11,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 13:17:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:11,738 INFO L225 Difference]: With dead ends: 33909 [2019-12-18 13:17:11,738 INFO L226 Difference]: Without dead ends: 30991 [2019-12-18 13:17:11,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:17:11,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30991 states. [2019-12-18 13:17:12,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30991 to 11298. [2019-12-18 13:17:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11298 states. [2019-12-18 13:17:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11298 states to 11298 states and 35607 transitions. [2019-12-18 13:17:12,038 INFO L78 Accepts]: Start accepts. Automaton has 11298 states and 35607 transitions. Word has length 65 [2019-12-18 13:17:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:12,038 INFO L462 AbstractCegarLoop]: Abstraction has 11298 states and 35607 transitions. [2019-12-18 13:17:12,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:17:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 11298 states and 35607 transitions. [2019-12-18 13:17:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:12,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:12,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:12,051 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:17:12,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:12,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1724524394, now seen corresponding path program 4 times [2019-12-18 13:17:12,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:12,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003370886] [2019-12-18 13:17:12,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:12,127 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:17:12,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003370886] [2019-12-18 13:17:12,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:12,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:17:12,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395318689] [2019-12-18 13:17:12,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:17:12,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:12,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:17:12,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:17:12,129 INFO L87 Difference]: Start difference. First operand 11298 states and 35607 transitions. Second operand 4 states. [2019-12-18 13:17:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:12,250 INFO L93 Difference]: Finished difference Result 11142 states and 34983 transitions. [2019-12-18 13:17:12,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:17:12,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:17:12,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:12,277 INFO L225 Difference]: With dead ends: 11142 [2019-12-18 13:17:12,277 INFO L226 Difference]: Without dead ends: 11142 [2019-12-18 13:17:12,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:17:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2019-12-18 13:17:12,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 10674. [2019-12-18 13:17:12,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10674 states. [2019-12-18 13:17:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10674 states to 10674 states and 33423 transitions. [2019-12-18 13:17:12,609 INFO L78 Accepts]: Start accepts. Automaton has 10674 states and 33423 transitions. Word has length 65 [2019-12-18 13:17:12,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:12,609 INFO L462 AbstractCegarLoop]: Abstraction has 10674 states and 33423 transitions. [2019-12-18 13:17:12,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:17:12,609 INFO L276 IsEmpty]: Start isEmpty. Operand 10674 states and 33423 transitions. [2019-12-18 13:17:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:12,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:12,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:12,627 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:17:12,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:12,627 INFO L82 PathProgramCache]: Analyzing trace with hash 837718325, now seen corresponding path program 1 times [2019-12-18 13:17:12,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:12,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546948820] [2019-12-18 13:17:12,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:12,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:17:12,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546948820] [2019-12-18 13:17:12,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:12,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:17:12,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013146293] [2019-12-18 13:17:12,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:17:12,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:12,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:17:12,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:17:12,947 INFO L87 Difference]: Start difference. First operand 10674 states and 33423 transitions. Second operand 12 states. [2019-12-18 13:17:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:15,729 INFO L93 Difference]: Finished difference Result 21945 states and 65666 transitions. [2019-12-18 13:17:15,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 13:17:15,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-18 13:17:15,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:15,759 INFO L225 Difference]: With dead ends: 21945 [2019-12-18 13:17:15,759 INFO L226 Difference]: Without dead ends: 21693 [2019-12-18 13:17:15,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2019-12-18 13:17:15,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21693 states. [2019-12-18 13:17:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21693 to 16899. [2019-12-18 13:17:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16899 states. [2019-12-18 13:17:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16899 states to 16899 states and 50854 transitions. [2019-12-18 13:17:16,037 INFO L78 Accepts]: Start accepts. Automaton has 16899 states and 50854 transitions. Word has length 65 [2019-12-18 13:17:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:16,038 INFO L462 AbstractCegarLoop]: Abstraction has 16899 states and 50854 transitions. [2019-12-18 13:17:16,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:17:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 16899 states and 50854 transitions. [2019-12-18 13:17:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:16,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:16,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:16,054 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:17:16,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:16,055 INFO L82 PathProgramCache]: Analyzing trace with hash -130492415, now seen corresponding path program 2 times [2019-12-18 13:17:16,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:16,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355232351] [2019-12-18 13:17:16,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:16,311 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:17:16,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355232351] [2019-12-18 13:17:16,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:16,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:17:16,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512058774] [2019-12-18 13:17:16,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:16,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:16,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:16,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:16,313 INFO L87 Difference]: Start difference. First operand 16899 states and 50854 transitions. Second operand 11 states. [2019-12-18 13:17:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:18,230 INFO L93 Difference]: Finished difference Result 29792 states and 86794 transitions. [2019-12-18 13:17:18,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:17:18,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 13:17:18,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:18,270 INFO L225 Difference]: With dead ends: 29792 [2019-12-18 13:17:18,271 INFO L226 Difference]: Without dead ends: 29572 [2019-12-18 13:17:18,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:17:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29572 states. [2019-12-18 13:17:18,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29572 to 19446. [2019-12-18 13:17:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19446 states. [2019-12-18 13:17:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19446 states to 19446 states and 57415 transitions. [2019-12-18 13:17:18,619 INFO L78 Accepts]: Start accepts. Automaton has 19446 states and 57415 transitions. Word has length 65 [2019-12-18 13:17:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:18,620 INFO L462 AbstractCegarLoop]: Abstraction has 19446 states and 57415 transitions. [2019-12-18 13:17:18,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 19446 states and 57415 transitions. [2019-12-18 13:17:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:17:18,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:18,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:17:18,641 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:17:18,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:18,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1979760167, now seen corresponding path program 3 times [2019-12-18 13:17:18,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:18,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450616689] [2019-12-18 13:17:18,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:18,708 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:17:18,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450616689] [2019-12-18 13:17:18,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:18,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:18,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264219088] [2019-12-18 13:17:18,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:18,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:18,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:18,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:18,710 INFO L87 Difference]: Start difference. First operand 19446 states and 57415 transitions. Second operand 3 states. [2019-12-18 13:17:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:18,785 INFO L93 Difference]: Finished difference Result 19445 states and 57413 transitions. [2019-12-18 13:17:18,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:18,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 13:17:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:18,816 INFO L225 Difference]: With dead ends: 19445 [2019-12-18 13:17:18,817 INFO L226 Difference]: Without dead ends: 19445 [2019-12-18 13:17:18,817 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:17:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19445 states. [2019-12-18 13:17:19,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19445 to 14319. [2019-12-18 13:17:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14319 states. [2019-12-18 13:17:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14319 states to 14319 states and 43139 transitions. [2019-12-18 13:17:19,470 INFO L78 Accepts]: Start accepts. Automaton has 14319 states and 43139 transitions. Word has length 65 [2019-12-18 13:17:19,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:19,470 INFO L462 AbstractCegarLoop]: Abstraction has 14319 states and 43139 transitions. [2019-12-18 13:17:19,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 14319 states and 43139 transitions. [2019-12-18 13:17:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:17:19,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:19,484 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:17:19,485 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:17:19,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:19,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1101261716, now seen corresponding path program 1 times [2019-12-18 13:17:19,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:19,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804085136] [2019-12-18 13:17:19,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:19,544 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:17:19,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804085136] [2019-12-18 13:17:19,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:19,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:17:19,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462233667] [2019-12-18 13:17:19,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:17:19,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:19,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:17:19,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:17:19,546 INFO L87 Difference]: Start difference. First operand 14319 states and 43139 transitions. Second operand 3 states. [2019-12-18 13:17:19,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:19,589 INFO L93 Difference]: Finished difference Result 10217 states and 30372 transitions. [2019-12-18 13:17:19,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:17:19,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:17:19,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:19,606 INFO L225 Difference]: With dead ends: 10217 [2019-12-18 13:17:19,606 INFO L226 Difference]: Without dead ends: 10217 [2019-12-18 13:17:19,606 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:17:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10217 states. [2019-12-18 13:17:19,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10217 to 9662. [2019-12-18 13:17:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9662 states. [2019-12-18 13:17:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9662 states to 9662 states and 28693 transitions. [2019-12-18 13:17:19,786 INFO L78 Accepts]: Start accepts. Automaton has 9662 states and 28693 transitions. Word has length 66 [2019-12-18 13:17:19,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:19,786 INFO L462 AbstractCegarLoop]: Abstraction has 9662 states and 28693 transitions. [2019-12-18 13:17:19,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:17:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 9662 states and 28693 transitions. [2019-12-18 13:17:19,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:19,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:19,795 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:17:19,796 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:17:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:19,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1000943315, now seen corresponding path program 1 times [2019-12-18 13:17:19,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:19,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510062801] [2019-12-18 13:17:19,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:19,968 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:17:19,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510062801] [2019-12-18 13:17:19,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:19,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:19,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545988312] [2019-12-18 13:17:19,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:17:19,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:19,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:17:19,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:17:19,970 INFO L87 Difference]: Start difference. First operand 9662 states and 28693 transitions. Second operand 10 states. [2019-12-18 13:17:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:21,160 INFO L93 Difference]: Finished difference Result 17243 states and 50581 transitions. [2019-12-18 13:17:21,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:17:21,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 13:17:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:21,178 INFO L225 Difference]: With dead ends: 17243 [2019-12-18 13:17:21,179 INFO L226 Difference]: Without dead ends: 12591 [2019-12-18 13:17:21,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-18 13:17:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12591 states. [2019-12-18 13:17:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12591 to 9980. [2019-12-18 13:17:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9980 states. [2019-12-18 13:17:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9980 states to 9980 states and 29455 transitions. [2019-12-18 13:17:21,342 INFO L78 Accepts]: Start accepts. Automaton has 9980 states and 29455 transitions. Word has length 67 [2019-12-18 13:17:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:21,342 INFO L462 AbstractCegarLoop]: Abstraction has 9980 states and 29455 transitions. [2019-12-18 13:17:21,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:17:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 9980 states and 29455 transitions. [2019-12-18 13:17:21,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:21,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:21,352 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:17:21,352 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:17:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:21,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1387520431, now seen corresponding path program 2 times [2019-12-18 13:17:21,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:21,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743168797] [2019-12-18 13:17:21,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:21,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743168797] [2019-12-18 13:17:21,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:21,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:17:21,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549609605] [2019-12-18 13:17:21,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:17:21,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:21,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:17:21,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:17:21,525 INFO L87 Difference]: Start difference. First operand 9980 states and 29455 transitions. Second operand 10 states. [2019-12-18 13:17:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:22,858 INFO L93 Difference]: Finished difference Result 16948 states and 49114 transitions. [2019-12-18 13:17:22,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:17:22,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 13:17:22,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:22,877 INFO L225 Difference]: With dead ends: 16948 [2019-12-18 13:17:22,877 INFO L226 Difference]: Without dead ends: 13718 [2019-12-18 13:17:22,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:17:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13718 states. [2019-12-18 13:17:23,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13718 to 10366. [2019-12-18 13:17:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10366 states. [2019-12-18 13:17:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10366 states to 10366 states and 30370 transitions. [2019-12-18 13:17:23,054 INFO L78 Accepts]: Start accepts. Automaton has 10366 states and 30370 transitions. Word has length 67 [2019-12-18 13:17:23,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:23,054 INFO L462 AbstractCegarLoop]: Abstraction has 10366 states and 30370 transitions. [2019-12-18 13:17:23,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:17:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 10366 states and 30370 transitions. [2019-12-18 13:17:23,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:23,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:23,064 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:17:23,064 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:17:23,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:23,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1156359029, now seen corresponding path program 3 times [2019-12-18 13:17:23,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:23,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531761929] [2019-12-18 13:17:23,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:23,240 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:17:23,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531761929] [2019-12-18 13:17:23,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:23,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:17:23,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070974214] [2019-12-18 13:17:23,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:23,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:23,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:23,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:23,242 INFO L87 Difference]: Start difference. First operand 10366 states and 30370 transitions. Second operand 11 states. [2019-12-18 13:17:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:24,679 INFO L93 Difference]: Finished difference Result 16213 states and 46857 transitions. [2019-12-18 13:17:24,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 13:17:24,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:17:24,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:24,698 INFO L225 Difference]: With dead ends: 16213 [2019-12-18 13:17:24,698 INFO L226 Difference]: Without dead ends: 13252 [2019-12-18 13:17:24,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:17:24,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13252 states. [2019-12-18 13:17:24,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13252 to 10027. [2019-12-18 13:17:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10027 states. [2019-12-18 13:17:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10027 states to 10027 states and 29406 transitions. [2019-12-18 13:17:24,869 INFO L78 Accepts]: Start accepts. Automaton has 10027 states and 29406 transitions. Word has length 67 [2019-12-18 13:17:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:24,870 INFO L462 AbstractCegarLoop]: Abstraction has 10027 states and 29406 transitions. [2019-12-18 13:17:24,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 10027 states and 29406 transitions. [2019-12-18 13:17:24,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:24,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:24,879 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:17:24,880 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:17:24,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:24,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1555205525, now seen corresponding path program 4 times [2019-12-18 13:17:24,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:24,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926266240] [2019-12-18 13:17:24,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:25,106 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:17:25,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926266240] [2019-12-18 13:17:25,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:25,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:17:25,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739330021] [2019-12-18 13:17:25,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:25,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:25,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:25,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:25,108 INFO L87 Difference]: Start difference. First operand 10027 states and 29406 transitions. Second operand 11 states. [2019-12-18 13:17:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:26,547 INFO L93 Difference]: Finished difference Result 11933 states and 34794 transitions. [2019-12-18 13:17:26,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:17:26,547 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:17:26,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:26,562 INFO L225 Difference]: With dead ends: 11933 [2019-12-18 13:17:26,562 INFO L226 Difference]: Without dead ends: 10770 [2019-12-18 13:17:26,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:17:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10770 states. [2019-12-18 13:17:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10770 to 10211. [2019-12-18 13:17:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10211 states. [2019-12-18 13:17:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10211 states to 10211 states and 29875 transitions. [2019-12-18 13:17:26,715 INFO L78 Accepts]: Start accepts. Automaton has 10211 states and 29875 transitions. Word has length 67 [2019-12-18 13:17:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:26,716 INFO L462 AbstractCegarLoop]: Abstraction has 10211 states and 29875 transitions. [2019-12-18 13:17:26,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 10211 states and 29875 transitions. [2019-12-18 13:17:26,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:26,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:26,725 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:17:26,725 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:17:26,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:26,726 INFO L82 PathProgramCache]: Analyzing trace with hash -2131583359, now seen corresponding path program 5 times [2019-12-18 13:17:26,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:26,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882683278] [2019-12-18 13:17:26,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:17:26,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882683278] [2019-12-18 13:17:26,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:26,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:17:26,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122253811] [2019-12-18 13:17:26,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:26,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:26,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:26,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:26,921 INFO L87 Difference]: Start difference. First operand 10211 states and 29875 transitions. Second operand 11 states. [2019-12-18 13:17:27,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:27,708 INFO L93 Difference]: Finished difference Result 14800 states and 43095 transitions. [2019-12-18 13:17:27,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:17:27,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:17:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:27,727 INFO L225 Difference]: With dead ends: 14800 [2019-12-18 13:17:27,727 INFO L226 Difference]: Without dead ends: 13781 [2019-12-18 13:17:27,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-18 13:17:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13781 states. [2019-12-18 13:17:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13781 to 11669. [2019-12-18 13:17:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11669 states. [2019-12-18 13:17:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11669 states to 11669 states and 34141 transitions. [2019-12-18 13:17:27,916 INFO L78 Accepts]: Start accepts. Automaton has 11669 states and 34141 transitions. Word has length 67 [2019-12-18 13:17:27,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:27,917 INFO L462 AbstractCegarLoop]: Abstraction has 11669 states and 34141 transitions. [2019-12-18 13:17:27,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 11669 states and 34141 transitions. [2019-12-18 13:17:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:27,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:27,929 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:17:27,930 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:17:27,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:27,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1250353067, now seen corresponding path program 6 times [2019-12-18 13:17:27,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:27,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394930127] [2019-12-18 13:17:27,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:28,115 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:17:28,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394930127] [2019-12-18 13:17:28,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:28,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:17:28,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864822326] [2019-12-18 13:17:28,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:28,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:28,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:28,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:28,117 INFO L87 Difference]: Start difference. First operand 11669 states and 34141 transitions. Second operand 11 states. [2019-12-18 13:17:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:28,866 INFO L93 Difference]: Finished difference Result 14075 states and 40611 transitions. [2019-12-18 13:17:28,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:17:28,866 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:17:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:28,881 INFO L225 Difference]: With dead ends: 14075 [2019-12-18 13:17:28,881 INFO L226 Difference]: Without dead ends: 11877 [2019-12-18 13:17:28,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:17:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11877 states. [2019-12-18 13:17:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11877 to 9629. [2019-12-18 13:17:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9629 states. [2019-12-18 13:17:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9629 states to 9629 states and 28225 transitions. [2019-12-18 13:17:29,044 INFO L78 Accepts]: Start accepts. Automaton has 9629 states and 28225 transitions. Word has length 67 [2019-12-18 13:17:29,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:29,045 INFO L462 AbstractCegarLoop]: Abstraction has 9629 states and 28225 transitions. [2019-12-18 13:17:29,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 9629 states and 28225 transitions. [2019-12-18 13:17:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:29,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:29,054 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:17:29,055 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:17:29,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:29,055 INFO L82 PathProgramCache]: Analyzing trace with hash -945042827, now seen corresponding path program 7 times [2019-12-18 13:17:29,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:29,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167144119] [2019-12-18 13:17:29,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:17:29,239 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:17:29,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167144119] [2019-12-18 13:17:29,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:17:29,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:17:29,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631635005] [2019-12-18 13:17:29,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:17:29,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:17:29,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:17:29,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:17:29,244 INFO L87 Difference]: Start difference. First operand 9629 states and 28225 transitions. Second operand 11 states. [2019-12-18 13:17:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:17:29,917 INFO L93 Difference]: Finished difference Result 11944 states and 34508 transitions. [2019-12-18 13:17:29,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:17:29,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:17:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:17:29,934 INFO L225 Difference]: With dead ends: 11944 [2019-12-18 13:17:29,934 INFO L226 Difference]: Without dead ends: 11733 [2019-12-18 13:17:29,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:17:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11733 states. [2019-12-18 13:17:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11733 to 9453. [2019-12-18 13:17:30,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9453 states. [2019-12-18 13:17:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9453 states to 9453 states and 27753 transitions. [2019-12-18 13:17:30,093 INFO L78 Accepts]: Start accepts. Automaton has 9453 states and 27753 transitions. Word has length 67 [2019-12-18 13:17:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:17:30,093 INFO L462 AbstractCegarLoop]: Abstraction has 9453 states and 27753 transitions. [2019-12-18 13:17:30,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:17:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 9453 states and 27753 transitions. [2019-12-18 13:17:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:17:30,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:17:30,102 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:17:30,102 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:17:30,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:17:30,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 8 times [2019-12-18 13:17:30,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:17:30,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31234930] [2019-12-18 13:17:30,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:17:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:17:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:17:30,209 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:17:30,209 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:17:30,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t855~0.base_25| 4)) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t855~0.base_25|) 0) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_ULTIMATE.start_main_~#t855~0.offset_17|) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t855~0.base_25|) (= |v_#NULL.offset_4| 0) (= 0 v_~b$w_buff0~0_250) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t855~0.base_25| 1)) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t855~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t855~0.base_25|) |v_ULTIMATE.start_main_~#t855~0.offset_17| 0)) |v_#memory_int_23|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start_main_~#t855~0.offset=|v_ULTIMATE.start_main_~#t855~0.offset_17|, ULTIMATE.start_main_~#t855~0.base=|v_ULTIMATE.start_main_~#t855~0.base_25|, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t856~0.offset=|v_ULTIMATE.start_main_~#t856~0.offset_17|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ULTIMATE.start_main_~#t857~0.offset=|v_ULTIMATE.start_main_~#t857~0.offset_17|, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t857~0.base=|v_ULTIMATE.start_main_~#t857~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t856~0.base=|v_ULTIMATE.start_main_~#t856~0.base_21|, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t855~0.offset, ULTIMATE.start_main_~#t855~0.base, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t856~0.offset, ~b$read_delayed~0, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t857~0.offset, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ~y~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t857~0.base, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ULTIMATE.start_main_~#t856~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-18 13:17:30,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t856~0.base_10|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t856~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t856~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t856~0.base_10|) |v_ULTIMATE.start_main_~#t856~0.offset_9| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t856~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t856~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t856~0.offset_9| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t856~0.base_10| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t856~0.base=|v_ULTIMATE.start_main_~#t856~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t856~0.offset=|v_ULTIMATE.start_main_~#t856~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t856~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t856~0.offset, #length] because there is no mapped edge [2019-12-18 13:17:30,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t857~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t857~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t857~0.offset_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t857~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t857~0.base_13|) |v_ULTIMATE.start_main_~#t857~0.offset_11| 2)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t857~0.base_13|)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t857~0.base_13|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t857~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t857~0.base=|v_ULTIMATE.start_main_~#t857~0.base_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t857~0.offset=|v_ULTIMATE.start_main_~#t857~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t857~0.base, #length, ULTIMATE.start_main_~#t857~0.offset] because there is no mapped edge [2019-12-18 13:17:30,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (= ~__unbuffered_p0_EAX~0_Out1578931593 ~x~0_In1578931593) (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1578931593)) (= ~b$r_buff0_thd2~0_In1578931593 ~b$r_buff1_thd2~0_Out1578931593) (= ~b$r_buff1_thd0~0_Out1578931593 ~b$r_buff0_thd0~0_In1578931593) (= ~b$r_buff1_thd3~0_Out1578931593 ~b$r_buff0_thd3~0_In1578931593) (= ~b$r_buff1_thd1~0_Out1578931593 ~b$r_buff0_thd1~0_In1578931593) (= ~b$r_buff0_thd1~0_Out1578931593 1)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1578931593, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1578931593, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1578931593, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1578931593, ~x~0=~x~0_In1578931593, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1578931593} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1578931593, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1578931593, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1578931593, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1578931593, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out1578931593, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out1578931593, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In1578931593, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out1578931593, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out1578931593, ~x~0=~x~0_In1578931593, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1578931593} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-18 13:17:30,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In-2100894437 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd2~0_In-2100894437 256) 0))) (or (and (or .cse0 .cse1) (= ~b~0_In-2100894437 |P1Thread1of1ForFork0_#t~ite9_Out-2100894437|)) (and (not .cse1) (not .cse0) (= ~b$w_buff1~0_In-2100894437 |P1Thread1of1ForFork0_#t~ite9_Out-2100894437|)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-2100894437, ~b~0=~b~0_In-2100894437, ~b$w_buff1~0=~b$w_buff1~0_In-2100894437, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-2100894437} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In-2100894437, ~b~0=~b~0_In-2100894437, ~b$w_buff1~0=~b$w_buff1~0_In-2100894437, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-2100894437|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-2100894437} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 13:17:30,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_34|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_34|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_53|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_33|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 13:17:30,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-1182735571 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In-1182735571 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-1182735571|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~b$w_buff0_used~0_In-1182735571 |P1Thread1of1ForFork0_#t~ite11_Out-1182735571|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1182735571, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1182735571} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1182735571, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1182735571, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-1182735571|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 13:17:30,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse3 (= (mod ~b$r_buff1_thd2~0_In-1815027394 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In-1815027394 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd2~0_In-1815027394 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1815027394 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite12_Out-1815027394| ~b$w_buff1_used~0_In-1815027394) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite12_Out-1815027394| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1815027394, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1815027394, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1815027394, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1815027394} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1815027394, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1815027394, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1815027394, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out-1815027394|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1815027394} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 13:17:30,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In1247269783 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In1247269783 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite13_Out1247269783|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~b$r_buff0_thd2~0_In1247269783 |P1Thread1of1ForFork0_#t~ite13_Out1247269783|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1247269783, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1247269783} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1247269783, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1247269783, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1247269783|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 13:17:30,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse3 (= (mod ~b$r_buff0_thd2~0_In-21147905 256) 0)) (.cse2 (= (mod ~b$w_buff0_used~0_In-21147905 256) 0)) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-21147905 256))) (.cse0 (= (mod ~b$r_buff1_thd2~0_In-21147905 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out-21147905| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~b$r_buff1_thd2~0_In-21147905 |P1Thread1of1ForFork0_#t~ite14_Out-21147905|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-21147905, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-21147905, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-21147905, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-21147905} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-21147905, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-21147905, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-21147905, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-21147905|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-21147905} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 13:17:30,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_32|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_31|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 13:17:30,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In163012963 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite20_Out163012963| ~b$w_buff0~0_In163012963) .cse0 (= |P2Thread1of1ForFork1_#t~ite21_Out163012963| |P2Thread1of1ForFork1_#t~ite20_Out163012963|) (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In163012963 256) 0))) (or (and (= (mod ~b$w_buff1_used~0_In163012963 256) 0) .cse1) (and .cse1 (= (mod ~b$r_buff1_thd3~0_In163012963 256) 0)) (= (mod ~b$w_buff0_used~0_In163012963 256) 0)))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite20_In163012963| |P2Thread1of1ForFork1_#t~ite20_Out163012963|) (= |P2Thread1of1ForFork1_#t~ite21_Out163012963| ~b$w_buff0~0_In163012963)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In163012963, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In163012963, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In163012963|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In163012963, ~b$w_buff0~0=~b$w_buff0~0_In163012963, ~weak$$choice2~0=~weak$$choice2~0_In163012963, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In163012963} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In163012963, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In163012963, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out163012963|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out163012963|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In163012963, ~b$w_buff0~0=~b$w_buff0~0_In163012963, ~weak$$choice2~0=~weak$$choice2~0_In163012963, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In163012963} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 13:17:30,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In754021626 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite27_Out754021626| |P2Thread1of1ForFork1_#t~ite26_Out754021626|) .cse0 (= ~b$w_buff0_used~0_In754021626 |P2Thread1of1ForFork1_#t~ite26_Out754021626|) (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In754021626 256) 0))) (or (and (= 0 (mod ~b$r_buff1_thd3~0_In754021626 256)) .cse1) (and (= (mod ~b$w_buff1_used~0_In754021626 256) 0) .cse1) (= (mod ~b$w_buff0_used~0_In754021626 256) 0)))) (and (not .cse0) (= ~b$w_buff0_used~0_In754021626 |P2Thread1of1ForFork1_#t~ite27_Out754021626|) (= |P2Thread1of1ForFork1_#t~ite26_In754021626| |P2Thread1of1ForFork1_#t~ite26_Out754021626|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In754021626, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In754021626, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In754021626|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In754021626, ~weak$$choice2~0=~weak$$choice2~0_In754021626, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In754021626} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In754021626, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out754021626|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In754021626, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out754021626|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In754021626, ~weak$$choice2~0=~weak$$choice2~0_In754021626, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In754021626} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-18 13:17:30,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 13:17:30,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-18 13:17:30,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd3~0_In-582260872 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-582260872 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite38_Out-582260872| ~b~0_In-582260872) (or .cse0 .cse1)) (and (= ~b$w_buff1~0_In-582260872 |P2Thread1of1ForFork1_#t~ite38_Out-582260872|) (not .cse1) (not .cse0)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-582260872, ~b~0=~b~0_In-582260872, ~b$w_buff1~0=~b$w_buff1~0_In-582260872, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-582260872} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-582260872|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-582260872, ~b~0=~b~0_In-582260872, ~b$w_buff1~0=~b$w_buff1~0_In-582260872, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-582260872} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-18 13:17:30,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-18 13:17:30,230 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~b$r_buff0_thd3~0_In1667916746 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In1667916746 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite40_Out1667916746| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In1667916746 |P2Thread1of1ForFork1_#t~ite40_Out1667916746|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1667916746, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1667916746} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1667916746, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1667916746, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out1667916746|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-18 13:17:30,233 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1946566614 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-1946566614 256))) (.cse2 (= (mod ~b$w_buff1_used~0_In-1946566614 256) 0)) (.cse3 (= 0 (mod ~b$r_buff1_thd3~0_In-1946566614 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite41_Out-1946566614|)) (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In-1946566614 |P2Thread1of1ForFork1_#t~ite41_Out-1946566614|) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1946566614, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1946566614, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1946566614, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1946566614} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1946566614, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1946566614, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1946566614, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-1946566614|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1946566614} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-18 13:17:30,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-1880181998 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In-1880181998 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out-1880181998| 0)) (and (or .cse1 .cse0) (= ~b$r_buff0_thd3~0_In-1880181998 |P2Thread1of1ForFork1_#t~ite42_Out-1880181998|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1880181998, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1880181998} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1880181998, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1880181998, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1880181998|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-18 13:17:30,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-668286844 256))) (.cse0 (= (mod ~b$r_buff0_thd3~0_In-668286844 256) 0)) (.cse2 (= 0 (mod ~b$r_buff1_thd3~0_In-668286844 256))) (.cse3 (= (mod ~b$w_buff1_used~0_In-668286844 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite43_Out-668286844|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite43_Out-668286844| ~b$r_buff1_thd3~0_In-668286844)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-668286844, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-668286844, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-668286844, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-668286844} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-668286844, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-668286844, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-668286844|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-668286844, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-668286844} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-18 13:17:30,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite43_44| v_~b$r_buff1_thd3~0_140) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 13:17:30,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In1387717711 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In1387717711 256)))) (or (and (= ~b$w_buff0_used~0_In1387717711 |P0Thread1of1ForFork2_#t~ite5_Out1387717711|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out1387717711|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1387717711, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1387717711} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1387717711, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1387717711, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out1387717711|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:17:30,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff1_thd1~0_In599285373 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In599285373 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In599285373 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd1~0_In599285373 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out599285373| ~b$w_buff1_used~0_In599285373) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork2_#t~ite6_Out599285373| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In599285373, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In599285373, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In599285373, ~b$w_buff1_used~0=~b$w_buff1_used~0_In599285373} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In599285373, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In599285373, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In599285373, ~b$w_buff1_used~0=~b$w_buff1_used~0_In599285373, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out599285373|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:17:30,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In621962127 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In621962127 256)))) (or (and (= ~b$r_buff0_thd1~0_In621962127 ~b$r_buff0_thd1~0_Out621962127) (or .cse0 .cse1)) (and (= 0 ~b$r_buff0_thd1~0_Out621962127) (not .cse0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In621962127, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In621962127} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In621962127, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out621962127, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out621962127|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:17:30,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse3 (= 0 (mod ~b$r_buff0_thd1~0_In-1838454408 256))) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In-1838454408 256))) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-1838454408 256))) (.cse1 (= (mod ~b$r_buff1_thd1~0_In-1838454408 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite8_Out-1838454408| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork2_#t~ite8_Out-1838454408| ~b$r_buff1_thd1~0_In-1838454408) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1838454408, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1838454408, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1838454408, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1838454408} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1838454408, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1838454408, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1838454408, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1838454408, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1838454408|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:17:30,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_36| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_35|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 13:17:30,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:17:30,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In-121764025 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd0~0_In-121764025 256) 0))) (or (and (= ~b$w_buff1~0_In-121764025 |ULTIMATE.start_main_#t~ite47_Out-121764025|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-121764025| ~b~0_In-121764025)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-121764025, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-121764025, ~b~0=~b~0_In-121764025, ~b$w_buff1~0=~b$w_buff1~0_In-121764025} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-121764025, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-121764025, ~b~0=~b~0_In-121764025, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-121764025|, ~b$w_buff1~0=~b$w_buff1~0_In-121764025} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 13:17:30,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:17:30,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In-554051298 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-554051298 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-554051298| ~b$w_buff0_used~0_In-554051298) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-554051298| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-554051298, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-554051298} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-554051298, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-554051298|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-554051298} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:17:30,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff0_thd0~0_In-1263982031 256))) (.cse3 (= (mod ~b$w_buff0_used~0_In-1263982031 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-1263982031 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd0~0_In-1263982031 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1263982031|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~b$w_buff1_used~0_In-1263982031 |ULTIMATE.start_main_#t~ite50_Out-1263982031|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1263982031, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1263982031, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1263982031, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1263982031} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1263982031|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-1263982031, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1263982031, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1263982031, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1263982031} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:17:30,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In1683783855 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In1683783855 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1683783855|) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1683783855| ~b$r_buff0_thd0~0_In1683783855)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1683783855, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1683783855} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1683783855, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1683783855|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1683783855} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:17:30,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-1595370670 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd0~0_In-1595370670 256) 0)) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In-1595370670 256))) (.cse3 (= (mod ~b$r_buff1_thd0~0_In-1595370670 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-1595370670|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~b$r_buff1_thd0~0_In-1595370670 |ULTIMATE.start_main_#t~ite52_Out-1595370670|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1595370670, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1595370670, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1595370670, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1595370670} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1595370670, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1595370670|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-1595370670, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1595370670, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1595370670} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:17:30,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:17:30,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:17:30 BasicIcfg [2019-12-18 13:17:30,364 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:17:30,366 INFO L168 Benchmark]: Toolchain (without parser) took 111356.25 ms. Allocated memory was 145.8 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.7 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 13:17:30,367 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:17:30,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 802.48 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.3 MB in the beginning and 157.1 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:30,372 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.70 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.4 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:17:30,372 INFO L168 Benchmark]: Boogie Preprocessor took 39.12 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 151.7 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:17:30,373 INFO L168 Benchmark]: RCFGBuilder took 871.05 ms. Allocated memory is still 203.9 MB. Free memory was 151.7 MB in the beginning and 101.0 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:17:30,373 INFO L168 Benchmark]: TraceAbstraction took 109570.39 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 13:17:30,380 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.24 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 802.48 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.3 MB in the beginning and 157.1 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.70 ms. Allocated memory is still 203.9 MB. Free memory was 157.1 MB in the beginning and 154.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.12 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 871.05 ms. Allocated memory is still 203.9 MB. Free memory was 151.7 MB in the beginning and 101.0 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109570.39 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t855, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t856, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t857, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 109.2s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 36.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7564 SDtfs, 12068 SDslu, 28041 SDs, 0 SdLazy, 15492 SolverSat, 512 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 489 GetRequests, 82 SyntacticMatches, 14 SemanticMatches, 393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1519 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171775occurred 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: 38.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 190255 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1776 NumberOfCodeBlocks, 1776 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1675 ConstructedInterpolants, 0 QuantifiedInterpolants, 365973 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...