/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:15:23,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:15:23,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:15:23,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:15:23,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:15:23,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:15:23,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:15:23,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:15:23,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:15:23,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:15:23,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:15:23,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:15:23,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:15:23,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:15:23,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:15:23,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:15:23,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:15:23,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:15:23,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:15:23,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:15:23,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:15:23,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:15:23,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:15:23,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:15:23,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:15:23,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:15:23,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:15:23,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:15:23,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:15:23,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:15:23,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:15:23,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:15:23,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:15:23,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:15:23,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:15:23,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:15:23,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:15:23,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:15:23,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:15:23,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:15:23,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:15:23,749 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:15:23,779 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:15:23,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:15:23,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:15:23,781 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:15:23,781 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:15:23,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:15:23,782 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:15:23,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:15:23,782 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:15:23,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:15:23,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:15:23,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:15:23,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:15:23,784 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:15:23,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:15:23,784 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:15:23,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:15:23,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:15:23,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:15:23,785 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:15:23,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:15:23,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:15:23,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:15:23,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:15:23,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:15:23,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:15:23,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:15:23,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:15:23,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:15:24,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:15:24,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:15:24,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:15:24,090 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:15:24,091 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:15:24,092 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i [2019-12-18 17:15:24,155 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d731f4af/50d44b68781d4692978740b6b5965f68/FLAG1bb0b3fef [2019-12-18 17:15:24,737 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:15:24,737 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i [2019-12-18 17:15:24,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d731f4af/50d44b68781d4692978740b6b5965f68/FLAG1bb0b3fef [2019-12-18 17:15:24,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d731f4af/50d44b68781d4692978740b6b5965f68 [2019-12-18 17:15:25,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:15:25,006 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:15:25,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:15:25,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:15:25,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:15:25,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:15:24" (1/1) ... [2019-12-18 17:15:25,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:25, skipping insertion in model container [2019-12-18 17:15:25,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:15:24" (1/1) ... [2019-12-18 17:15:25,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:15:25,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:15:25,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:15:25,601 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:15:25,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:15:25,767 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:15:25,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:25 WrapperNode [2019-12-18 17:15:25,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:15:25,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:15:25,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:15:25,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:15:25,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:25" (1/1) ... [2019-12-18 17:15:25,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:25" (1/1) ... [2019-12-18 17:15:25,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:15:25,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:15:25,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:15:25,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:15:25,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:25" (1/1) ... [2019-12-18 17:15:25,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:25" (1/1) ... [2019-12-18 17:15:25,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:25" (1/1) ... [2019-12-18 17:15:25,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:25" (1/1) ... [2019-12-18 17:15:25,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:25" (1/1) ... [2019-12-18 17:15:25,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:25" (1/1) ... [2019-12-18 17:15:25,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:25" (1/1) ... [2019-12-18 17:15:25,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:15:25,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:15:25,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:15:25,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:15:25,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:25" (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 17:15:25,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:15:25,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:15:25,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:15:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:15:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:15:25,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:15:25,992 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:15:25,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:15:25,993 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:15:25,993 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:15:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:15:25,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:15:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:15:25,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:15:25,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:15:25,999 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 17:15:26,823 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:15:26,824 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:15:26,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:15:26 BoogieIcfgContainer [2019-12-18 17:15:26,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:15:26,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:15:26,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:15:26,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:15:26,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:15:24" (1/3) ... [2019-12-18 17:15:26,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445c0f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:15:26, skipping insertion in model container [2019-12-18 17:15:26,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:15:25" (2/3) ... [2019-12-18 17:15:26,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445c0f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:15:26, skipping insertion in model container [2019-12-18 17:15:26,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:15:26" (3/3) ... [2019-12-18 17:15:26,839 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_rmo.opt.i [2019-12-18 17:15:26,850 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:15:26,851 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:15:26,864 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:15:26,865 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:15:26,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,931 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,931 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,973 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,973 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,974 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,974 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,974 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,980 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,981 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,981 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,981 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,982 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,983 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,984 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,985 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,986 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,989 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,990 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,990 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,990 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,990 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,990 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,991 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,991 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,991 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,991 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,995 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,995 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:26,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,002 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,006 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,006 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,006 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:15:27,023 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:15:27,044 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:15:27,044 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:15:27,044 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:15:27,044 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:15:27,044 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:15:27,045 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:15:27,045 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:15:27,045 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:15:27,062 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 211 transitions [2019-12-18 17:15:27,065 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-18 17:15:27,158 INFO L126 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-18 17:15:27,158 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:15:27,177 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 12/176 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:15:27,211 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-18 17:15:27,261 INFO L126 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-18 17:15:27,262 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:15:27,275 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 12/176 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:15:27,306 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 17:15:27,307 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:15:33,054 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 17:15:33,176 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 17:15:33,598 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-18 17:15:33,772 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-18 17:15:33,796 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74129 [2019-12-18 17:15:33,797 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-18 17:15:33,801 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 95 transitions [2019-12-18 17:16:07,093 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160086 states. [2019-12-18 17:16:07,094 INFO L276 IsEmpty]: Start isEmpty. Operand 160086 states. [2019-12-18 17:16:07,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 17:16:07,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:07,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:07,101 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:07,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:07,106 INFO L82 PathProgramCache]: Analyzing trace with hash -74872892, now seen corresponding path program 1 times [2019-12-18 17:16:07,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:07,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714272696] [2019-12-18 17:16:07,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:07,339 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 17:16:07,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714272696] [2019-12-18 17:16:07,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:07,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:16:07,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376166983] [2019-12-18 17:16:07,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:16:07,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:07,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:16:07,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:16:07,365 INFO L87 Difference]: Start difference. First operand 160086 states. Second operand 3 states. [2019-12-18 17:16:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:12,657 INFO L93 Difference]: Finished difference Result 158186 states and 763682 transitions. [2019-12-18 17:16:12,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:16:12,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 17:16:12,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:13,716 INFO L225 Difference]: With dead ends: 158186 [2019-12-18 17:16:13,717 INFO L226 Difference]: Without dead ends: 149138 [2019-12-18 17:16:13,718 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 17:16:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149138 states. [2019-12-18 17:16:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149138 to 149138. [2019-12-18 17:16:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149138 states. [2019-12-18 17:16:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149138 states to 149138 states and 719092 transitions. [2019-12-18 17:16:31,591 INFO L78 Accepts]: Start accepts. Automaton has 149138 states and 719092 transitions. Word has length 7 [2019-12-18 17:16:31,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:31,593 INFO L462 AbstractCegarLoop]: Abstraction has 149138 states and 719092 transitions. [2019-12-18 17:16:31,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:16:31,593 INFO L276 IsEmpty]: Start isEmpty. Operand 149138 states and 719092 transitions. [2019-12-18 17:16:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:16:31,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:31,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:31,608 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:31,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:31,609 INFO L82 PathProgramCache]: Analyzing trace with hash 117436716, now seen corresponding path program 1 times [2019-12-18 17:16:31,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:31,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710556286] [2019-12-18 17:16:31,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:31,703 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 17:16:31,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710556286] [2019-12-18 17:16:31,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:31,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:16:31,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794557556] [2019-12-18 17:16:31,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:16:31,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:31,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:16:31,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:16:31,706 INFO L87 Difference]: Start difference. First operand 149138 states and 719092 transitions. Second operand 3 states. [2019-12-18 17:16:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:32,304 INFO L93 Difference]: Finished difference Result 94514 states and 411493 transitions. [2019-12-18 17:16:32,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:16:32,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 17:16:32,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:32,642 INFO L225 Difference]: With dead ends: 94514 [2019-12-18 17:16:32,643 INFO L226 Difference]: Without dead ends: 94514 [2019-12-18 17:16:32,643 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 17:16:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94514 states. [2019-12-18 17:16:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94514 to 94514. [2019-12-18 17:16:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94514 states. [2019-12-18 17:16:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94514 states to 94514 states and 411493 transitions. [2019-12-18 17:16:42,060 INFO L78 Accepts]: Start accepts. Automaton has 94514 states and 411493 transitions. Word has length 15 [2019-12-18 17:16:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:42,060 INFO L462 AbstractCegarLoop]: Abstraction has 94514 states and 411493 transitions. [2019-12-18 17:16:42,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:16:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 94514 states and 411493 transitions. [2019-12-18 17:16:42,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:16:42,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:42,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:42,065 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:42,065 INFO L82 PathProgramCache]: Analyzing trace with hash 860387736, now seen corresponding path program 1 times [2019-12-18 17:16:42,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:42,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042441277] [2019-12-18 17:16:42,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:42,167 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 17:16:42,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042441277] [2019-12-18 17:16:42,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:42,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:16:42,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665318723] [2019-12-18 17:16:42,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:16:42,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:42,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:16:42,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:16:42,170 INFO L87 Difference]: Start difference. First operand 94514 states and 411493 transitions. Second operand 4 states. [2019-12-18 17:16:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:44,122 INFO L93 Difference]: Finished difference Result 147815 states and 617388 transitions. [2019-12-18 17:16:44,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:16:44,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:16:44,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:44,665 INFO L225 Difference]: With dead ends: 147815 [2019-12-18 17:16:44,665 INFO L226 Difference]: Without dead ends: 147703 [2019-12-18 17:16:44,666 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 17:16:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147703 states. [2019-12-18 17:16:56,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147703 to 135599. [2019-12-18 17:16:56,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135599 states. [2019-12-18 17:16:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135599 states to 135599 states and 571971 transitions. [2019-12-18 17:16:57,753 INFO L78 Accepts]: Start accepts. Automaton has 135599 states and 571971 transitions. Word has length 15 [2019-12-18 17:16:57,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:57,753 INFO L462 AbstractCegarLoop]: Abstraction has 135599 states and 571971 transitions. [2019-12-18 17:16:57,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:16:57,753 INFO L276 IsEmpty]: Start isEmpty. Operand 135599 states and 571971 transitions. [2019-12-18 17:16:57,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:16:57,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:57,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:57,759 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:57,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:57,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1758547198, now seen corresponding path program 1 times [2019-12-18 17:16:57,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:57,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916238944] [2019-12-18 17:16:57,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:57,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:57,826 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 17:16:57,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916238944] [2019-12-18 17:16:57,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:57,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:16:57,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465742891] [2019-12-18 17:16:57,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:16:57,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:57,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:16:57,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:16:57,829 INFO L87 Difference]: Start difference. First operand 135599 states and 571971 transitions. Second operand 4 states. [2019-12-18 17:16:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:58,038 INFO L93 Difference]: Finished difference Result 37047 states and 132608 transitions. [2019-12-18 17:16:58,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:16:58,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:16:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:58,110 INFO L225 Difference]: With dead ends: 37047 [2019-12-18 17:16:58,111 INFO L226 Difference]: Without dead ends: 37047 [2019-12-18 17:16:58,111 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 17:16:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37047 states. [2019-12-18 17:16:58,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37047 to 37047. [2019-12-18 17:16:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37047 states. [2019-12-18 17:16:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37047 states to 37047 states and 132608 transitions. [2019-12-18 17:16:58,820 INFO L78 Accepts]: Start accepts. Automaton has 37047 states and 132608 transitions. Word has length 16 [2019-12-18 17:16:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:16:58,820 INFO L462 AbstractCegarLoop]: Abstraction has 37047 states and 132608 transitions. [2019-12-18 17:16:58,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:16:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 37047 states and 132608 transitions. [2019-12-18 17:16:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:16:58,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:16:58,823 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:16:58,824 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:16:58,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:16:58,824 INFO L82 PathProgramCache]: Analyzing trace with hash -293201311, now seen corresponding path program 1 times [2019-12-18 17:16:58,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:16:58,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438458634] [2019-12-18 17:16:58,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:16:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:16:58,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 17:16:58,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438458634] [2019-12-18 17:16:58,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:16:58,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:16:58,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923256266] [2019-12-18 17:16:58,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:16:58,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:16:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:16:58,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:16:58,905 INFO L87 Difference]: Start difference. First operand 37047 states and 132608 transitions. Second operand 4 states. [2019-12-18 17:16:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:16:59,302 INFO L93 Difference]: Finished difference Result 48238 states and 170644 transitions. [2019-12-18 17:16:59,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:16:59,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:16:59,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:16:59,399 INFO L225 Difference]: With dead ends: 48238 [2019-12-18 17:16:59,399 INFO L226 Difference]: Without dead ends: 48227 [2019-12-18 17:16:59,399 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 17:17:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48227 states. [2019-12-18 17:17:01,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48227 to 42563. [2019-12-18 17:17:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42563 states. [2019-12-18 17:17:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42563 states to 42563 states and 151744 transitions. [2019-12-18 17:17:01,346 INFO L78 Accepts]: Start accepts. Automaton has 42563 states and 151744 transitions. Word has length 16 [2019-12-18 17:17:01,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:01,346 INFO L462 AbstractCegarLoop]: Abstraction has 42563 states and 151744 transitions. [2019-12-18 17:17:01,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:17:01,346 INFO L276 IsEmpty]: Start isEmpty. Operand 42563 states and 151744 transitions. [2019-12-18 17:17:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:17:01,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:01,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:01,349 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash -293081279, now seen corresponding path program 1 times [2019-12-18 17:17:01,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:01,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893547446] [2019-12-18 17:17:01,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:01,412 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 17:17:01,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893547446] [2019-12-18 17:17:01,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:01,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:17:01,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522984717] [2019-12-18 17:17:01,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:17:01,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:01,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:17:01,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:17:01,417 INFO L87 Difference]: Start difference. First operand 42563 states and 151744 transitions. Second operand 4 states. [2019-12-18 17:17:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:01,815 INFO L93 Difference]: Finished difference Result 52709 states and 186086 transitions. [2019-12-18 17:17:01,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:17:01,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:17:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:01,925 INFO L225 Difference]: With dead ends: 52709 [2019-12-18 17:17:01,926 INFO L226 Difference]: Without dead ends: 52698 [2019-12-18 17:17:01,926 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 17:17:02,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52698 states. [2019-12-18 17:17:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52698 to 42470. [2019-12-18 17:17:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42470 states. [2019-12-18 17:17:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42470 states to 42470 states and 151203 transitions. [2019-12-18 17:17:05,641 INFO L78 Accepts]: Start accepts. Automaton has 42470 states and 151203 transitions. Word has length 16 [2019-12-18 17:17:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:05,641 INFO L462 AbstractCegarLoop]: Abstraction has 42470 states and 151203 transitions. [2019-12-18 17:17:05,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:17:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 42470 states and 151203 transitions. [2019-12-18 17:17:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 17:17:05,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:05,658 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] [2019-12-18 17:17:05,658 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:05,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:05,659 INFO L82 PathProgramCache]: Analyzing trace with hash 127408811, now seen corresponding path program 1 times [2019-12-18 17:17:05,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:05,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288636620] [2019-12-18 17:17:05,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:05,762 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 17:17:05,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288636620] [2019-12-18 17:17:05,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:05,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:17:05,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121960468] [2019-12-18 17:17:05,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:17:05,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:05,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:17:05,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:17:05,764 INFO L87 Difference]: Start difference. First operand 42470 states and 151203 transitions. Second operand 5 states. [2019-12-18 17:17:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:06,458 INFO L93 Difference]: Finished difference Result 61996 states and 217115 transitions. [2019-12-18 17:17:06,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:17:06,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 17:17:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:06,586 INFO L225 Difference]: With dead ends: 61996 [2019-12-18 17:17:06,587 INFO L226 Difference]: Without dead ends: 61973 [2019-12-18 17:17:06,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:17:06,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61973 states. [2019-12-18 17:17:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61973 to 45286. [2019-12-18 17:17:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45286 states. [2019-12-18 17:17:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45286 states to 45286 states and 161233 transitions. [2019-12-18 17:17:07,936 INFO L78 Accepts]: Start accepts. Automaton has 45286 states and 161233 transitions. Word has length 24 [2019-12-18 17:17:07,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:07,936 INFO L462 AbstractCegarLoop]: Abstraction has 45286 states and 161233 transitions. [2019-12-18 17:17:07,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:17:07,936 INFO L276 IsEmpty]: Start isEmpty. Operand 45286 states and 161233 transitions. [2019-12-18 17:17:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 17:17:07,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:07,949 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] [2019-12-18 17:17:07,949 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:07,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:07,949 INFO L82 PathProgramCache]: Analyzing trace with hash 127528843, now seen corresponding path program 1 times [2019-12-18 17:17:07,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:07,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853472825] [2019-12-18 17:17:07,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:08,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 17:17:08,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853472825] [2019-12-18 17:17:08,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:08,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:17:08,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095556927] [2019-12-18 17:17:08,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:17:08,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:08,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:17:08,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:17:08,085 INFO L87 Difference]: Start difference. First operand 45286 states and 161233 transitions. Second operand 5 states. [2019-12-18 17:17:08,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:08,806 INFO L93 Difference]: Finished difference Result 63893 states and 223312 transitions. [2019-12-18 17:17:08,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:17:08,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 17:17:08,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:08,938 INFO L225 Difference]: With dead ends: 63893 [2019-12-18 17:17:08,938 INFO L226 Difference]: Without dead ends: 63870 [2019-12-18 17:17:08,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:17:09,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63870 states. [2019-12-18 17:17:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63870 to 41796. [2019-12-18 17:17:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41796 states. [2019-12-18 17:17:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41796 states to 41796 states and 148592 transitions. [2019-12-18 17:17:10,386 INFO L78 Accepts]: Start accepts. Automaton has 41796 states and 148592 transitions. Word has length 24 [2019-12-18 17:17:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:10,386 INFO L462 AbstractCegarLoop]: Abstraction has 41796 states and 148592 transitions. [2019-12-18 17:17:10,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:17:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 41796 states and 148592 transitions. [2019-12-18 17:17:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 17:17:10,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:10,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:10,407 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:10,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:10,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2134071175, now seen corresponding path program 1 times [2019-12-18 17:17:10,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:10,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358990790] [2019-12-18 17:17:10,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:10,463 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 17:17:10,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358990790] [2019-12-18 17:17:10,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:10,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:17:10,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035710512] [2019-12-18 17:17:10,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:17:10,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:10,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:17:10,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:17:10,466 INFO L87 Difference]: Start difference. First operand 41796 states and 148592 transitions. Second operand 5 states. [2019-12-18 17:17:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:10,584 INFO L93 Difference]: Finished difference Result 21524 states and 77465 transitions. [2019-12-18 17:17:10,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:17:10,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 17:17:10,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:10,625 INFO L225 Difference]: With dead ends: 21524 [2019-12-18 17:17:10,625 INFO L226 Difference]: Without dead ends: 21524 [2019-12-18 17:17:10,625 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 17:17:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21524 states. [2019-12-18 17:17:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21524 to 21220. [2019-12-18 17:17:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21220 states. [2019-12-18 17:17:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21220 states to 21220 states and 76433 transitions. [2019-12-18 17:17:11,009 INFO L78 Accepts]: Start accepts. Automaton has 21220 states and 76433 transitions. Word has length 28 [2019-12-18 17:17:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:11,009 INFO L462 AbstractCegarLoop]: Abstraction has 21220 states and 76433 transitions. [2019-12-18 17:17:11,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:17:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 21220 states and 76433 transitions. [2019-12-18 17:17:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 17:17:11,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:11,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:11,048 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:11,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:11,048 INFO L82 PathProgramCache]: Analyzing trace with hash -16126003, now seen corresponding path program 1 times [2019-12-18 17:17:11,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:11,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640141004] [2019-12-18 17:17:11,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:11,116 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 17:17:11,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640141004] [2019-12-18 17:17:11,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:11,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:17:11,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381135812] [2019-12-18 17:17:11,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:17:11,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:11,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:17:11,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:17:11,119 INFO L87 Difference]: Start difference. First operand 21220 states and 76433 transitions. Second operand 4 states. [2019-12-18 17:17:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:11,598 INFO L93 Difference]: Finished difference Result 34004 states and 122814 transitions. [2019-12-18 17:17:11,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:17:11,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 17:17:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:11,635 INFO L225 Difference]: With dead ends: 34004 [2019-12-18 17:17:11,635 INFO L226 Difference]: Without dead ends: 18095 [2019-12-18 17:17:11,636 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 17:17:11,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18095 states. [2019-12-18 17:17:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18095 to 17989. [2019-12-18 17:17:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17989 states. [2019-12-18 17:17:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17989 states to 17989 states and 64168 transitions. [2019-12-18 17:17:11,953 INFO L78 Accepts]: Start accepts. Automaton has 17989 states and 64168 transitions. Word has length 42 [2019-12-18 17:17:11,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:11,954 INFO L462 AbstractCegarLoop]: Abstraction has 17989 states and 64168 transitions. [2019-12-18 17:17:11,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:17:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 17989 states and 64168 transitions. [2019-12-18 17:17:11,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 17:17:11,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:11,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:11,984 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:11,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:11,984 INFO L82 PathProgramCache]: Analyzing trace with hash 932410289, now seen corresponding path program 2 times [2019-12-18 17:17:11,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:11,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472413799] [2019-12-18 17:17:11,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:12,046 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 17:17:12,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472413799] [2019-12-18 17:17:12,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:12,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:17:12,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927995577] [2019-12-18 17:17:12,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:17:12,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:12,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:17:12,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:17:12,048 INFO L87 Difference]: Start difference. First operand 17989 states and 64168 transitions. Second operand 4 states. [2019-12-18 17:17:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:12,168 INFO L93 Difference]: Finished difference Result 25858 states and 88081 transitions. [2019-12-18 17:17:12,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:17:12,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 17:17:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:12,202 INFO L225 Difference]: With dead ends: 25858 [2019-12-18 17:17:12,202 INFO L226 Difference]: Without dead ends: 18303 [2019-12-18 17:17:12,202 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 17:17:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18303 states. [2019-12-18 17:17:12,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18303 to 18207. [2019-12-18 17:17:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18207 states. [2019-12-18 17:17:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18207 states to 18207 states and 64042 transitions. [2019-12-18 17:17:12,510 INFO L78 Accepts]: Start accepts. Automaton has 18207 states and 64042 transitions. Word has length 42 [2019-12-18 17:17:12,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:12,510 INFO L462 AbstractCegarLoop]: Abstraction has 18207 states and 64042 transitions. [2019-12-18 17:17:12,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:17:12,510 INFO L276 IsEmpty]: Start isEmpty. Operand 18207 states and 64042 transitions. [2019-12-18 17:17:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 17:17:12,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:12,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:12,536 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:12,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:12,536 INFO L82 PathProgramCache]: Analyzing trace with hash 10474927, now seen corresponding path program 3 times [2019-12-18 17:17:12,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:12,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283006820] [2019-12-18 17:17:12,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:12,620 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 17:17:12,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283006820] [2019-12-18 17:17:12,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:12,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:17:12,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164999172] [2019-12-18 17:17:12,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:17:12,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:12,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:17:12,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:17:12,623 INFO L87 Difference]: Start difference. First operand 18207 states and 64042 transitions. Second operand 6 states. [2019-12-18 17:17:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:12,756 INFO L93 Difference]: Finished difference Result 16970 states and 60901 transitions. [2019-12-18 17:17:12,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:17:12,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 17:17:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:12,784 INFO L225 Difference]: With dead ends: 16970 [2019-12-18 17:17:12,784 INFO L226 Difference]: Without dead ends: 13359 [2019-12-18 17:17:12,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:17:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13359 states. [2019-12-18 17:17:12,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13359 to 12959. [2019-12-18 17:17:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12959 states. [2019-12-18 17:17:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12959 states to 12959 states and 47493 transitions. [2019-12-18 17:17:13,022 INFO L78 Accepts]: Start accepts. Automaton has 12959 states and 47493 transitions. Word has length 42 [2019-12-18 17:17:13,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:13,022 INFO L462 AbstractCegarLoop]: Abstraction has 12959 states and 47493 transitions. [2019-12-18 17:17:13,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:17:13,022 INFO L276 IsEmpty]: Start isEmpty. Operand 12959 states and 47493 transitions. [2019-12-18 17:17:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:17:13,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:13,040 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] [2019-12-18 17:17:13,041 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:13,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:13,041 INFO L82 PathProgramCache]: Analyzing trace with hash -888538317, now seen corresponding path program 1 times [2019-12-18 17:17:13,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:13,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053333634] [2019-12-18 17:17:13,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:17:13,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053333634] [2019-12-18 17:17:13,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:13,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:17:13,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614855479] [2019-12-18 17:17:13,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:17:13,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:13,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:17:13,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:17:13,116 INFO L87 Difference]: Start difference. First operand 12959 states and 47493 transitions. Second operand 4 states. [2019-12-18 17:17:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:13,482 INFO L93 Difference]: Finished difference Result 16679 states and 59939 transitions. [2019-12-18 17:17:13,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:17:13,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 17:17:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:13,491 INFO L225 Difference]: With dead ends: 16679 [2019-12-18 17:17:13,491 INFO L226 Difference]: Without dead ends: 4031 [2019-12-18 17:17:13,492 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 17:17:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4031 states. [2019-12-18 17:17:13,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4031 to 4031. [2019-12-18 17:17:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-12-18 17:17:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 13323 transitions. [2019-12-18 17:17:13,563 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 13323 transitions. Word has length 57 [2019-12-18 17:17:13,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:13,564 INFO L462 AbstractCegarLoop]: Abstraction has 4031 states and 13323 transitions. [2019-12-18 17:17:13,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:17:13,564 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 13323 transitions. [2019-12-18 17:17:13,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:17:13,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:13,569 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] [2019-12-18 17:17:13,569 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:13,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:13,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1824422047, now seen corresponding path program 2 times [2019-12-18 17:17:13,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:13,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810780174] [2019-12-18 17:17:13,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:13,684 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 17:17:13,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810780174] [2019-12-18 17:17:13,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:13,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:17:13,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698427647] [2019-12-18 17:17:13,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:17:13,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:13,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:17:13,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:17:13,688 INFO L87 Difference]: Start difference. First operand 4031 states and 13323 transitions. Second operand 7 states. [2019-12-18 17:17:13,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:13,986 INFO L93 Difference]: Finished difference Result 8074 states and 26146 transitions. [2019-12-18 17:17:13,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:17:13,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:17:13,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:14,001 INFO L225 Difference]: With dead ends: 8074 [2019-12-18 17:17:14,001 INFO L226 Difference]: Without dead ends: 5854 [2019-12-18 17:17:14,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:17:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-12-18 17:17:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 5208. [2019-12-18 17:17:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5208 states. [2019-12-18 17:17:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5208 states to 5208 states and 17102 transitions. [2019-12-18 17:17:14,161 INFO L78 Accepts]: Start accepts. Automaton has 5208 states and 17102 transitions. Word has length 57 [2019-12-18 17:17:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:14,161 INFO L462 AbstractCegarLoop]: Abstraction has 5208 states and 17102 transitions. [2019-12-18 17:17:14,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:17:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 5208 states and 17102 transitions. [2019-12-18 17:17:14,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:17:14,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:14,171 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] [2019-12-18 17:17:14,171 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:14,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:14,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1398547123, now seen corresponding path program 3 times [2019-12-18 17:17:14,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:14,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951223674] [2019-12-18 17:17:14,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:14,293 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 17:17:14,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951223674] [2019-12-18 17:17:14,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:14,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:17:14,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912243035] [2019-12-18 17:17:14,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:17:14,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:14,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:17:14,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:17:14,295 INFO L87 Difference]: Start difference. First operand 5208 states and 17102 transitions. Second operand 7 states. [2019-12-18 17:17:14,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:14,554 INFO L93 Difference]: Finished difference Result 9670 states and 31030 transitions. [2019-12-18 17:17:14,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:17:14,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 17:17:14,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:14,569 INFO L225 Difference]: With dead ends: 9670 [2019-12-18 17:17:14,569 INFO L226 Difference]: Without dead ends: 7088 [2019-12-18 17:17:14,571 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 17:17:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-18 17:17:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 6224. [2019-12-18 17:17:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2019-12-18 17:17:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 20237 transitions. [2019-12-18 17:17:14,704 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 20237 transitions. Word has length 57 [2019-12-18 17:17:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:14,704 INFO L462 AbstractCegarLoop]: Abstraction has 6224 states and 20237 transitions. [2019-12-18 17:17:14,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:17:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 20237 transitions. [2019-12-18 17:17:14,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:17:14,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:14,713 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] [2019-12-18 17:17:14,713 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:14,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:14,713 INFO L82 PathProgramCache]: Analyzing trace with hash -182184551, now seen corresponding path program 4 times [2019-12-18 17:17:14,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:14,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517969903] [2019-12-18 17:17:14,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:14,862 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 17:17:14,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517969903] [2019-12-18 17:17:14,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:14,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:17:14,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822060353] [2019-12-18 17:17:14,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:17:14,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:14,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:17:14,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:17:14,867 INFO L87 Difference]: Start difference. First operand 6224 states and 20237 transitions. Second operand 9 states. [2019-12-18 17:17:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:16,800 INFO L93 Difference]: Finished difference Result 45824 states and 151598 transitions. [2019-12-18 17:17:16,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 17:17:16,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 17:17:16,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:16,882 INFO L225 Difference]: With dead ends: 45824 [2019-12-18 17:17:16,882 INFO L226 Difference]: Without dead ends: 36272 [2019-12-18 17:17:16,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 17:17:16,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36272 states. [2019-12-18 17:17:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36272 to 8997. [2019-12-18 17:17:17,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8997 states. [2019-12-18 17:17:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8997 states to 8997 states and 29720 transitions. [2019-12-18 17:17:17,231 INFO L78 Accepts]: Start accepts. Automaton has 8997 states and 29720 transitions. Word has length 57 [2019-12-18 17:17:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:17,231 INFO L462 AbstractCegarLoop]: Abstraction has 8997 states and 29720 transitions. [2019-12-18 17:17:17,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:17:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 8997 states and 29720 transitions. [2019-12-18 17:17:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:17:17,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:17,243 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] [2019-12-18 17:17:17,243 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:17,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:17,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1662360063, now seen corresponding path program 5 times [2019-12-18 17:17:17,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:17,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894745168] [2019-12-18 17:17:17,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:17,342 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 17:17:17,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894745168] [2019-12-18 17:17:17,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:17,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:17:17,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383375178] [2019-12-18 17:17:17,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:17:17,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:17,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:17:17,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:17:17,344 INFO L87 Difference]: Start difference. First operand 8997 states and 29720 transitions. Second operand 9 states. [2019-12-18 17:17:19,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:19,144 INFO L93 Difference]: Finished difference Result 41251 states and 134371 transitions. [2019-12-18 17:17:19,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 17:17:19,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 17:17:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:19,201 INFO L225 Difference]: With dead ends: 41251 [2019-12-18 17:17:19,202 INFO L226 Difference]: Without dead ends: 33787 [2019-12-18 17:17:19,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 17:17:19,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33787 states. [2019-12-18 17:17:19,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33787 to 9093. [2019-12-18 17:17:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9093 states. [2019-12-18 17:17:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9093 states to 9093 states and 30186 transitions. [2019-12-18 17:17:19,528 INFO L78 Accepts]: Start accepts. Automaton has 9093 states and 30186 transitions. Word has length 57 [2019-12-18 17:17:19,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:19,528 INFO L462 AbstractCegarLoop]: Abstraction has 9093 states and 30186 transitions. [2019-12-18 17:17:19,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:17:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 9093 states and 30186 transitions. [2019-12-18 17:17:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 17:17:19,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:19,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:19,539 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:19,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:19,539 INFO L82 PathProgramCache]: Analyzing trace with hash 955367681, now seen corresponding path program 6 times [2019-12-18 17:17:19,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:19,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23952217] [2019-12-18 17:17:19,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:19,688 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 17:17:19,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23952217] [2019-12-18 17:17:19,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:19,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:17:19,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85403489] [2019-12-18 17:17:19,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:17:19,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:19,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:17:19,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:17:19,695 INFO L87 Difference]: Start difference. First operand 9093 states and 30186 transitions. Second operand 3 states. [2019-12-18 17:17:19,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:19,743 INFO L93 Difference]: Finished difference Result 9091 states and 30181 transitions. [2019-12-18 17:17:19,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:17:19,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 17:17:19,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:19,764 INFO L225 Difference]: With dead ends: 9091 [2019-12-18 17:17:19,764 INFO L226 Difference]: Without dead ends: 9091 [2019-12-18 17:17:19,764 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 17:17:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9091 states. [2019-12-18 17:17:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9091 to 9091. [2019-12-18 17:17:19,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9091 states. [2019-12-18 17:17:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9091 states to 9091 states and 30181 transitions. [2019-12-18 17:17:19,906 INFO L78 Accepts]: Start accepts. Automaton has 9091 states and 30181 transitions. Word has length 57 [2019-12-18 17:17:19,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:19,907 INFO L462 AbstractCegarLoop]: Abstraction has 9091 states and 30181 transitions. [2019-12-18 17:17:19,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:17:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 9091 states and 30181 transitions. [2019-12-18 17:17:19,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:17:19,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:19,917 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] [2019-12-18 17:17:19,918 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:19,918 INFO L82 PathProgramCache]: Analyzing trace with hash 2044839876, now seen corresponding path program 1 times [2019-12-18 17:17:19,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:19,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700175689] [2019-12-18 17:17:19,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:19,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:17:19,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700175689] [2019-12-18 17:17:19,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:19,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:17:19,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294226235] [2019-12-18 17:17:19,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:17:19,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:19,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:17:19,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:17:19,987 INFO L87 Difference]: Start difference. First operand 9091 states and 30181 transitions. Second operand 3 states. [2019-12-18 17:17:20,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:20,032 INFO L93 Difference]: Finished difference Result 8322 states and 26789 transitions. [2019-12-18 17:17:20,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:17:20,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:17:20,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:20,049 INFO L225 Difference]: With dead ends: 8322 [2019-12-18 17:17:20,049 INFO L226 Difference]: Without dead ends: 8322 [2019-12-18 17:17:20,049 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 17:17:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8322 states. [2019-12-18 17:17:20,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8322 to 7922. [2019-12-18 17:17:20,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7922 states. [2019-12-18 17:17:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7922 states to 7922 states and 25358 transitions. [2019-12-18 17:17:20,189 INFO L78 Accepts]: Start accepts. Automaton has 7922 states and 25358 transitions. Word has length 58 [2019-12-18 17:17:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:20,189 INFO L462 AbstractCegarLoop]: Abstraction has 7922 states and 25358 transitions. [2019-12-18 17:17:20,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:17:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 7922 states and 25358 transitions. [2019-12-18 17:17:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:20,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:20,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:20,198 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:20,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:20,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1949196794, now seen corresponding path program 1 times [2019-12-18 17:17:20,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:20,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756178773] [2019-12-18 17:17:20,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:20,374 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 17:17:20,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756178773] [2019-12-18 17:17:20,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:20,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:17:20,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329169507] [2019-12-18 17:17:20,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:17:20,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:20,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:17:20,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:17:20,377 INFO L87 Difference]: Start difference. First operand 7922 states and 25358 transitions. Second operand 10 states. [2019-12-18 17:17:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:21,740 INFO L93 Difference]: Finished difference Result 13172 states and 41555 transitions. [2019-12-18 17:17:21,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:17:21,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 17:17:21,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:21,767 INFO L225 Difference]: With dead ends: 13172 [2019-12-18 17:17:21,767 INFO L226 Difference]: Without dead ends: 9622 [2019-12-18 17:17:21,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 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 17:17:21,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9622 states. [2019-12-18 17:17:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9622 to 8338. [2019-12-18 17:17:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8338 states. [2019-12-18 17:17:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8338 states to 8338 states and 26488 transitions. [2019-12-18 17:17:22,438 INFO L78 Accepts]: Start accepts. Automaton has 8338 states and 26488 transitions. Word has length 59 [2019-12-18 17:17:22,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:22,438 INFO L462 AbstractCegarLoop]: Abstraction has 8338 states and 26488 transitions. [2019-12-18 17:17:22,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:17:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 8338 states and 26488 transitions. [2019-12-18 17:17:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:22,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:22,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:22,452 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:22,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:22,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1854145516, now seen corresponding path program 2 times [2019-12-18 17:17:22,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:22,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860252680] [2019-12-18 17:17:22,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:22,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 17:17:22,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860252680] [2019-12-18 17:17:22,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:22,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:17:22,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678888591] [2019-12-18 17:17:22,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:17:22,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:22,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:17:22,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:17:22,606 INFO L87 Difference]: Start difference. First operand 8338 states and 26488 transitions. Second operand 10 states. [2019-12-18 17:17:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:23,729 INFO L93 Difference]: Finished difference Result 13004 states and 40435 transitions. [2019-12-18 17:17:23,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:17:23,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 17:17:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:23,747 INFO L225 Difference]: With dead ends: 13004 [2019-12-18 17:17:23,747 INFO L226 Difference]: Without dead ends: 10294 [2019-12-18 17:17:23,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 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 17:17:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10294 states. [2019-12-18 17:17:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10294 to 8538. [2019-12-18 17:17:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8538 states. [2019-12-18 17:17:23,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8538 states to 8538 states and 27032 transitions. [2019-12-18 17:17:23,904 INFO L78 Accepts]: Start accepts. Automaton has 8538 states and 27032 transitions. Word has length 59 [2019-12-18 17:17:23,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:23,904 INFO L462 AbstractCegarLoop]: Abstraction has 8538 states and 27032 transitions. [2019-12-18 17:17:23,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:17:23,904 INFO L276 IsEmpty]: Start isEmpty. Operand 8538 states and 27032 transitions. [2019-12-18 17:17:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:23,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:23,915 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] [2019-12-18 17:17:23,915 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:23,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:23,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1277650624, now seen corresponding path program 3 times [2019-12-18 17:17:23,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:23,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559049455] [2019-12-18 17:17:23,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:17:24,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559049455] [2019-12-18 17:17:24,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:24,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:17:24,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666552258] [2019-12-18 17:17:24,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:17:24,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:24,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:17:24,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:17:24,075 INFO L87 Difference]: Start difference. First operand 8538 states and 27032 transitions. Second operand 11 states. [2019-12-18 17:17:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:25,434 INFO L93 Difference]: Finished difference Result 12388 states and 38418 transitions. [2019-12-18 17:17:25,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 17:17:25,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 17:17:25,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:25,453 INFO L225 Difference]: With dead ends: 12388 [2019-12-18 17:17:25,453 INFO L226 Difference]: Without dead ends: 9914 [2019-12-18 17:17:25,454 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 17:17:25,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9914 states. [2019-12-18 17:17:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9914 to 8234. [2019-12-18 17:17:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8234 states. [2019-12-18 17:17:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8234 states to 8234 states and 26156 transitions. [2019-12-18 17:17:25,593 INFO L78 Accepts]: Start accepts. Automaton has 8234 states and 26156 transitions. Word has length 59 [2019-12-18 17:17:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:25,593 INFO L462 AbstractCegarLoop]: Abstraction has 8234 states and 26156 transitions. [2019-12-18 17:17:25,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:17:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 8234 states and 26156 transitions. [2019-12-18 17:17:25,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:25,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:25,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:25,602 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:25,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:25,603 INFO L82 PathProgramCache]: Analyzing trace with hash -794252350, now seen corresponding path program 4 times [2019-12-18 17:17:25,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:25,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163580042] [2019-12-18 17:17:25,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:26,070 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 17:17:26,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163580042] [2019-12-18 17:17:26,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:26,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 17:17:26,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519746107] [2019-12-18 17:17:26,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 17:17:26,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:26,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 17:17:26,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-18 17:17:26,072 INFO L87 Difference]: Start difference. First operand 8234 states and 26156 transitions. Second operand 15 states. [2019-12-18 17:17:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:29,443 INFO L93 Difference]: Finished difference Result 13971 states and 42466 transitions. [2019-12-18 17:17:29,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 17:17:29,444 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-18 17:17:29,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:29,462 INFO L225 Difference]: With dead ends: 13971 [2019-12-18 17:17:29,462 INFO L226 Difference]: Without dead ends: 11806 [2019-12-18 17:17:29,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=1081, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 17:17:29,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11806 states. [2019-12-18 17:17:29,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11806 to 9729. [2019-12-18 17:17:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9729 states. [2019-12-18 17:17:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9729 states to 9729 states and 30341 transitions. [2019-12-18 17:17:29,619 INFO L78 Accepts]: Start accepts. Automaton has 9729 states and 30341 transitions. Word has length 59 [2019-12-18 17:17:29,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:29,620 INFO L462 AbstractCegarLoop]: Abstraction has 9729 states and 30341 transitions. [2019-12-18 17:17:29,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 17:17:29,620 INFO L276 IsEmpty]: Start isEmpty. Operand 9729 states and 30341 transitions. [2019-12-18 17:17:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:29,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:29,630 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] [2019-12-18 17:17:29,630 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:29,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:29,630 INFO L82 PathProgramCache]: Analyzing trace with hash 611854610, now seen corresponding path program 5 times [2019-12-18 17:17:29,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:29,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10522922] [2019-12-18 17:17:29,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:30,207 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 17:17:30,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10522922] [2019-12-18 17:17:30,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:30,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 17:17:30,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578885643] [2019-12-18 17:17:30,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 17:17:30,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:30,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 17:17:30,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-18 17:17:30,212 INFO L87 Difference]: Start difference. First operand 9729 states and 30341 transitions. Second operand 16 states. [2019-12-18 17:17:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:33,108 INFO L93 Difference]: Finished difference Result 13292 states and 40516 transitions. [2019-12-18 17:17:33,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 17:17:33,109 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-18 17:17:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:33,128 INFO L225 Difference]: With dead ends: 13292 [2019-12-18 17:17:33,128 INFO L226 Difference]: Without dead ends: 12226 [2019-12-18 17:17:33,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=281, Invalid=1201, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 17:17:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12226 states. [2019-12-18 17:17:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12226 to 9789. [2019-12-18 17:17:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9789 states. [2019-12-18 17:17:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9789 states to 9789 states and 30494 transitions. [2019-12-18 17:17:33,292 INFO L78 Accepts]: Start accepts. Automaton has 9789 states and 30494 transitions. Word has length 59 [2019-12-18 17:17:33,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:33,293 INFO L462 AbstractCegarLoop]: Abstraction has 9789 states and 30494 transitions. [2019-12-18 17:17:33,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 17:17:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 9789 states and 30494 transitions. [2019-12-18 17:17:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:33,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:33,304 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] [2019-12-18 17:17:33,304 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:33,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1655179634, now seen corresponding path program 6 times [2019-12-18 17:17:33,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:33,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865656315] [2019-12-18 17:17:33,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:33,471 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 17:17:33,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865656315] [2019-12-18 17:17:33,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:33,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:17:33,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705737459] [2019-12-18 17:17:33,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:17:33,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:33,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:17:33,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:17:33,473 INFO L87 Difference]: Start difference. First operand 9789 states and 30494 transitions. Second operand 10 states. [2019-12-18 17:17:34,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:34,045 INFO L93 Difference]: Finished difference Result 12135 states and 37468 transitions. [2019-12-18 17:17:34,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 17:17:34,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 17:17:34,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:34,066 INFO L225 Difference]: With dead ends: 12135 [2019-12-18 17:17:34,066 INFO L226 Difference]: Without dead ends: 11825 [2019-12-18 17:17:34,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-18 17:17:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11825 states. [2019-12-18 17:17:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11825 to 10775. [2019-12-18 17:17:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10775 states. [2019-12-18 17:17:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10775 states to 10775 states and 33518 transitions. [2019-12-18 17:17:34,534 INFO L78 Accepts]: Start accepts. Automaton has 10775 states and 33518 transitions. Word has length 59 [2019-12-18 17:17:34,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:34,535 INFO L462 AbstractCegarLoop]: Abstraction has 10775 states and 33518 transitions. [2019-12-18 17:17:34,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:17:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 10775 states and 33518 transitions. [2019-12-18 17:17:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:34,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:34,546 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] [2019-12-18 17:17:34,546 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:34,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:34,547 INFO L82 PathProgramCache]: Analyzing trace with hash -838073842, now seen corresponding path program 7 times [2019-12-18 17:17:34,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:34,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125334571] [2019-12-18 17:17:34,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:34,680 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 17:17:34,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125334571] [2019-12-18 17:17:34,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:34,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:17:34,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253921958] [2019-12-18 17:17:34,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:17:34,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:34,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:17:34,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:17:34,681 INFO L87 Difference]: Start difference. First operand 10775 states and 33518 transitions. Second operand 10 states. [2019-12-18 17:17:35,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:35,204 INFO L93 Difference]: Finished difference Result 12045 states and 36950 transitions. [2019-12-18 17:17:35,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 17:17:35,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-18 17:17:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:35,221 INFO L225 Difference]: With dead ends: 12045 [2019-12-18 17:17:35,222 INFO L226 Difference]: Without dead ends: 10511 [2019-12-18 17:17:35,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-18 17:17:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10511 states. [2019-12-18 17:17:35,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10511 to 9339. [2019-12-18 17:17:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9339 states. [2019-12-18 17:17:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9339 states to 9339 states and 29230 transitions. [2019-12-18 17:17:35,374 INFO L78 Accepts]: Start accepts. Automaton has 9339 states and 29230 transitions. Word has length 59 [2019-12-18 17:17:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:35,375 INFO L462 AbstractCegarLoop]: Abstraction has 9339 states and 29230 transitions. [2019-12-18 17:17:35,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:17:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 9339 states and 29230 transitions. [2019-12-18 17:17:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:35,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:35,385 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] [2019-12-18 17:17:35,385 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:35,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:35,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1656101628, now seen corresponding path program 8 times [2019-12-18 17:17:35,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:35,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357537346] [2019-12-18 17:17:35,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:35,969 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 17:17:35,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357537346] [2019-12-18 17:17:35,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:35,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 17:17:35,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022905932] [2019-12-18 17:17:35,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 17:17:35,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:35,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 17:17:35,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:17:35,971 INFO L87 Difference]: Start difference. First operand 9339 states and 29230 transitions. Second operand 17 states. [2019-12-18 17:17:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:38,385 INFO L93 Difference]: Finished difference Result 12264 states and 37718 transitions. [2019-12-18 17:17:38,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 17:17:38,385 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-18 17:17:38,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:38,401 INFO L225 Difference]: With dead ends: 12264 [2019-12-18 17:17:38,402 INFO L226 Difference]: Without dead ends: 10842 [2019-12-18 17:17:38,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=220, Invalid=970, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 17:17:38,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-12-18 17:17:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 9439. [2019-12-18 17:17:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9439 states. [2019-12-18 17:17:38,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9439 states to 9439 states and 29480 transitions. [2019-12-18 17:17:38,553 INFO L78 Accepts]: Start accepts. Automaton has 9439 states and 29480 transitions. Word has length 59 [2019-12-18 17:17:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:38,553 INFO L462 AbstractCegarLoop]: Abstraction has 9439 states and 29480 transitions. [2019-12-18 17:17:38,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 17:17:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 9439 states and 29480 transitions. [2019-12-18 17:17:38,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:38,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:38,563 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] [2019-12-18 17:17:38,563 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:38,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:38,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1232758708, now seen corresponding path program 9 times [2019-12-18 17:17:38,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:38,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201203943] [2019-12-18 17:17:38,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:38,974 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 17:17:38,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201203943] [2019-12-18 17:17:38,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:38,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 17:17:38,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892073525] [2019-12-18 17:17:38,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 17:17:38,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:38,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 17:17:38,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:17:38,976 INFO L87 Difference]: Start difference. First operand 9439 states and 29480 transitions. Second operand 17 states. [2019-12-18 17:17:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:42,459 INFO L93 Difference]: Finished difference Result 12943 states and 39681 transitions. [2019-12-18 17:17:42,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 17:17:42,460 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-18 17:17:42,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:42,481 INFO L225 Difference]: With dead ends: 12943 [2019-12-18 17:17:42,481 INFO L226 Difference]: Without dead ends: 12705 [2019-12-18 17:17:42,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=416, Invalid=2446, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 17:17:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12705 states. [2019-12-18 17:17:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12705 to 10944. [2019-12-18 17:17:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10944 states. [2019-12-18 17:17:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10944 states to 10944 states and 34037 transitions. [2019-12-18 17:17:42,671 INFO L78 Accepts]: Start accepts. Automaton has 10944 states and 34037 transitions. Word has length 59 [2019-12-18 17:17:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:42,672 INFO L462 AbstractCegarLoop]: Abstraction has 10944 states and 34037 transitions. [2019-12-18 17:17:42,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 17:17:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 10944 states and 34037 transitions. [2019-12-18 17:17:42,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:42,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:42,685 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] [2019-12-18 17:17:42,685 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:42,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:42,686 INFO L82 PathProgramCache]: Analyzing trace with hash -415652916, now seen corresponding path program 10 times [2019-12-18 17:17:42,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:42,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492353039] [2019-12-18 17:17:42,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:43,394 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 17:17:43,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492353039] [2019-12-18 17:17:43,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:43,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 17:17:43,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126234709] [2019-12-18 17:17:43,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 17:17:43,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:43,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 17:17:43,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:17:43,396 INFO L87 Difference]: Start difference. First operand 10944 states and 34037 transitions. Second operand 18 states. [2019-12-18 17:17:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:46,440 INFO L93 Difference]: Finished difference Result 13653 states and 41730 transitions. [2019-12-18 17:17:46,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 17:17:46,441 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2019-12-18 17:17:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:46,460 INFO L225 Difference]: With dead ends: 13653 [2019-12-18 17:17:46,460 INFO L226 Difference]: Without dead ends: 12807 [2019-12-18 17:17:46,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=255, Invalid=1227, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 17:17:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12807 states. [2019-12-18 17:17:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12807 to 10988. [2019-12-18 17:17:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10988 states. [2019-12-18 17:17:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10988 states to 10988 states and 34150 transitions. [2019-12-18 17:17:46,639 INFO L78 Accepts]: Start accepts. Automaton has 10988 states and 34150 transitions. Word has length 59 [2019-12-18 17:17:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:46,639 INFO L462 AbstractCegarLoop]: Abstraction has 10988 states and 34150 transitions. [2019-12-18 17:17:46,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 17:17:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 10988 states and 34150 transitions. [2019-12-18 17:17:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:46,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:46,650 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] [2019-12-18 17:17:46,650 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:46,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:46,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1612280136, now seen corresponding path program 11 times [2019-12-18 17:17:46,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:46,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232646967] [2019-12-18 17:17:46,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:47,335 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 17:17:47,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232646967] [2019-12-18 17:17:47,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:47,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 17:17:47,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376469743] [2019-12-18 17:17:47,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 17:17:47,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:47,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 17:17:47,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:17:47,340 INFO L87 Difference]: Start difference. First operand 10988 states and 34150 transitions. Second operand 18 states. [2019-12-18 17:17:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:50,740 INFO L93 Difference]: Finished difference Result 13205 states and 40251 transitions. [2019-12-18 17:17:50,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 17:17:50,741 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2019-12-18 17:17:50,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:50,762 INFO L225 Difference]: With dead ends: 13205 [2019-12-18 17:17:50,763 INFO L226 Difference]: Without dead ends: 12839 [2019-12-18 17:17:50,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=1374, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 17:17:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12839 states. [2019-12-18 17:17:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12839 to 10952. [2019-12-18 17:17:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10952 states. [2019-12-18 17:17:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10952 states to 10952 states and 34055 transitions. [2019-12-18 17:17:50,964 INFO L78 Accepts]: Start accepts. Automaton has 10952 states and 34055 transitions. Word has length 59 [2019-12-18 17:17:50,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:50,965 INFO L462 AbstractCegarLoop]: Abstraction has 10952 states and 34055 transitions. [2019-12-18 17:17:50,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 17:17:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 10952 states and 34055 transitions. [2019-12-18 17:17:50,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:50,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:50,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:50,979 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:50,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:50,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2033440416, now seen corresponding path program 12 times [2019-12-18 17:17:50,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:50,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386797602] [2019-12-18 17:17:50,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:51,140 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 17:17:51,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386797602] [2019-12-18 17:17:51,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:51,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:17:51,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046306966] [2019-12-18 17:17:51,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:17:51,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:51,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:17:51,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:17:51,143 INFO L87 Difference]: Start difference. First operand 10952 states and 34055 transitions. Second operand 11 states. [2019-12-18 17:17:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:51,914 INFO L93 Difference]: Finished difference Result 14028 states and 43093 transitions. [2019-12-18 17:17:51,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 17:17:51,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 17:17:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:51,930 INFO L225 Difference]: With dead ends: 14028 [2019-12-18 17:17:51,930 INFO L226 Difference]: Without dead ends: 10160 [2019-12-18 17:17:51,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-18 17:17:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10160 states. [2019-12-18 17:17:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10160 to 9250. [2019-12-18 17:17:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9250 states. [2019-12-18 17:17:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9250 states to 9250 states and 28915 transitions. [2019-12-18 17:17:52,078 INFO L78 Accepts]: Start accepts. Automaton has 9250 states and 28915 transitions. Word has length 59 [2019-12-18 17:17:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:52,079 INFO L462 AbstractCegarLoop]: Abstraction has 9250 states and 28915 transitions. [2019-12-18 17:17:52,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:17:52,079 INFO L276 IsEmpty]: Start isEmpty. Operand 9250 states and 28915 transitions. [2019-12-18 17:17:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:52,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:52,088 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] [2019-12-18 17:17:52,088 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:52,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:52,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1556260520, now seen corresponding path program 13 times [2019-12-18 17:17:52,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:52,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604325259] [2019-12-18 17:17:52,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:52,759 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 17:17:52,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604325259] [2019-12-18 17:17:52,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:52,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 17:17:52,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717925899] [2019-12-18 17:17:52,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 17:17:52,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:52,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 17:17:52,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:17:52,761 INFO L87 Difference]: Start difference. First operand 9250 states and 28915 transitions. Second operand 17 states. [2019-12-18 17:17:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:56,528 INFO L93 Difference]: Finished difference Result 14313 states and 44165 transitions. [2019-12-18 17:17:56,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 17:17:56,528 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-18 17:17:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:56,550 INFO L225 Difference]: With dead ends: 14313 [2019-12-18 17:17:56,550 INFO L226 Difference]: Without dead ends: 14183 [2019-12-18 17:17:56,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=333, Invalid=2019, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 17:17:56,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14183 states. [2019-12-18 17:17:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14183 to 9350. [2019-12-18 17:17:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9350 states. [2019-12-18 17:17:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9350 states to 9350 states and 29160 transitions. [2019-12-18 17:17:56,727 INFO L78 Accepts]: Start accepts. Automaton has 9350 states and 29160 transitions. Word has length 59 [2019-12-18 17:17:56,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:56,727 INFO L462 AbstractCegarLoop]: Abstraction has 9350 states and 29160 transitions. [2019-12-18 17:17:56,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 17:17:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 9350 states and 29160 transitions. [2019-12-18 17:17:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:56,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:56,738 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] [2019-12-18 17:17:56,738 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:56,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:56,738 INFO L82 PathProgramCache]: Analyzing trace with hash -41509046, now seen corresponding path program 14 times [2019-12-18 17:17:56,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:56,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783394596] [2019-12-18 17:17:56,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:17:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:17:56,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783394596] [2019-12-18 17:17:56,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:17:56,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:17:56,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038202471] [2019-12-18 17:17:56,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:17:56,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:17:56,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:17:56,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:17:56,906 INFO L87 Difference]: Start difference. First operand 9350 states and 29160 transitions. Second operand 12 states. [2019-12-18 17:17:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:17:57,596 INFO L93 Difference]: Finished difference Result 10410 states and 31986 transitions. [2019-12-18 17:17:57,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:17:57,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 17:17:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:17:57,613 INFO L225 Difference]: With dead ends: 10410 [2019-12-18 17:17:57,613 INFO L226 Difference]: Without dead ends: 10184 [2019-12-18 17:17:57,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 17:17:57,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10184 states. [2019-12-18 17:17:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10184 to 9110. [2019-12-18 17:17:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9110 states. [2019-12-18 17:17:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9110 states to 9110 states and 28542 transitions. [2019-12-18 17:17:57,760 INFO L78 Accepts]: Start accepts. Automaton has 9110 states and 28542 transitions. Word has length 59 [2019-12-18 17:17:57,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:17:57,760 INFO L462 AbstractCegarLoop]: Abstraction has 9110 states and 28542 transitions. [2019-12-18 17:17:57,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:17:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 9110 states and 28542 transitions. [2019-12-18 17:17:57,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:17:57,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:17:57,770 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:17:57,770 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:17:57,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:17:57,771 INFO L82 PathProgramCache]: Analyzing trace with hash -765256248, now seen corresponding path program 15 times [2019-12-18 17:17:57,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:17:57,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235484093] [2019-12-18 17:17:57,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:17:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:17:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:17:57,890 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:17:57,890 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:17:57,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] ULTIMATE.startENTRY-->L850: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= 0 v_~y$r_buff1_thd4~0_204) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~main$tmp_guard1~0_50 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t957~0.base_26| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t957~0.base_26|) |v_ULTIMATE.start_main_~#t957~0.offset_17| 0)) |v_#memory_int_27|) (= v_~a~0_15 0) (= 0 v_~y$w_buff0~0_524) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t957~0.base_26|) (= 0 v_~y$r_buff0_thd3~0_184) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff0_thd4~0_132) (= v_~y$w_buff0_used~0_906 0) (= |v_#NULL.offset_3| 0) (= v_~weak$$choice2~0_152 0) (= v_~y$r_buff1_thd0~0_180 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t957~0.base_26|)) (= 0 v_~__unbuffered_p0_EAX~0_69) (= 0 v_~y$r_buff0_thd2~0_313) (= v_~y~0_171 0) (= v_~x~0_48 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t957~0.base_26| 4)) (= v_~y$mem_tmp~0_33 0) (= 0 v_~__unbuffered_p1_EAX~0_59) (= 0 v_~__unbuffered_p3_EAX~0_47) (= 0 v_~__unbuffered_p3_EBX~0_47) (= 0 v_~weak$$choice0~0_21) (= |v_ULTIMATE.start_main_~#t957~0.offset_17| 0) (= 0 v_~__unbuffered_p2_EAX~0_124) (= 0 v_~y$flush_delayed~0_62) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t957~0.base_26| 1)) (= 0 v_~y$r_buff1_thd1~0_92) (< 0 |v_#StackHeapBarrier_20|) (= v_~y$w_buff1~0_331 0) (= v_~z~0_40 0) (= 0 |v_#NULL.base_3|) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~y$r_buff1_thd2~0_274) (= v_~__unbuffered_cnt~0_218 0) (= v_~y$r_buff0_thd1~0_33 0) (= v_~b~0_43 0) (= 0 v_~y$r_buff1_thd3~0_153) (= v_~y$w_buff1_used~0_620 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_97|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_200|, ULTIMATE.start_main_~#t959~0.base=|v_ULTIMATE.start_main_~#t959~0.base_26|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_15, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_69, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_153, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_59, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_62, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_47, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_124, ULTIMATE.start_main_~#t959~0.offset=|v_ULTIMATE.start_main_~#t959~0.offset_19|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_28|, ULTIMATE.start_main_~#t960~0.base=|v_ULTIMATE.start_main_~#t960~0.base_24|, ULTIMATE.start_main_~#t960~0.offset=|v_ULTIMATE.start_main_~#t960~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_204, ~y$w_buff1~0=v_~y$w_buff1~0_331, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_313, ULTIMATE.start_main_~#t957~0.offset=|v_ULTIMATE.start_main_~#t957~0.offset_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_218, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_180, ~x~0=v_~x~0_48, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_906, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_40|, ULTIMATE.start_main_~#t958~0.offset=|v_ULTIMATE.start_main_~#t958~0.offset_19|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_524, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_184, ULTIMATE.start_main_~#t958~0.base=|v_ULTIMATE.start_main_~#t958~0.base_25|, ~y~0=v_~y~0_171, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_47, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_274, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_132, ~b~0=v_~b~0_43, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_34|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_40, ~weak$$choice2~0=v_~weak$$choice2~0_152, ULTIMATE.start_main_~#t957~0.base=|v_ULTIMATE.start_main_~#t957~0.base_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t959~0.base, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t959~0.offset, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t960~0.base, ULTIMATE.start_main_~#t960~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t957~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t958~0.offset, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t958~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ~b~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t957~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:17:57,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L850-1-->L852: Formula: (and (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t958~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t958~0.base_12| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t958~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t958~0.offset_11|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t958~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t958~0.base_12|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t958~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t958~0.base_12|) |v_ULTIMATE.start_main_~#t958~0.offset_11| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t958~0.base=|v_ULTIMATE.start_main_~#t958~0.base_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t958~0.offset=|v_ULTIMATE.start_main_~#t958~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t958~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t958~0.offset] because there is no mapped edge [2019-12-18 17:17:57,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L852-1-->L854: Formula: (and (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t959~0.base_13| 1) |v_#valid_40|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t959~0.base_13| 4) |v_#length_19|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t959~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t959~0.offset_11|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t959~0.base_13|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t959~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t959~0.base_13|) |v_ULTIMATE.start_main_~#t959~0.offset_11| 2)) |v_#memory_int_17|) (not (= |v_ULTIMATE.start_main_~#t959~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t959~0.offset=|v_ULTIMATE.start_main_~#t959~0.offset_11|, ULTIMATE.start_main_~#t959~0.base=|v_ULTIMATE.start_main_~#t959~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t959~0.offset, ULTIMATE.start_main_~#t959~0.base] because there is no mapped edge [2019-12-18 17:17:57,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L854-1-->L856: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t960~0.base_12|) (= |v_ULTIMATE.start_main_~#t960~0.offset_10| 0) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t960~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t960~0.base_12|) 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t960~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t960~0.base_12|) |v_ULTIMATE.start_main_~#t960~0.offset_10| 3))) (not (= 0 |v_ULTIMATE.start_main_~#t960~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t960~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t960~0.base=|v_ULTIMATE.start_main_~#t960~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t960~0.offset=|v_ULTIMATE.start_main_~#t960~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t960~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t960~0.offset] because there is no mapped edge [2019-12-18 17:17:57,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L4-->L801: Formula: (and (= v_~z~0_12 v_~__unbuffered_p2_EAX~0_13) (= v_~y$r_buff0_thd0~0_41 v_~y$r_buff1_thd0~0_36) (= v_~y$r_buff0_thd3~0_35 v_~y$r_buff1_thd3~0_31) (= v_~y$r_buff0_thd4~0_32 v_~y$r_buff1_thd4~0_28) (= v_~y$r_buff1_thd1~0_9 v_~y$r_buff0_thd1~0_9) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48 0)) (= v_~y$r_buff0_thd2~0_103 v_~y$r_buff1_thd2~0_52) (= v_~y$r_buff0_thd3~0_34 1)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_35, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48, ~z~0=v_~z~0_12} OutVars{P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_34, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~z~0=v_~z~0_12, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_36} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 17:17:57,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_20 1) (= v_~x~0_26 v_~__unbuffered_p0_EAX~0_24) (= |v_P0Thread1of1ForFork1_#in~arg.base_18| v_P0Thread1of1ForFork1_~arg.base_18) (= v_P0Thread1of1ForFork1_~arg.offset_18 |v_P0Thread1of1ForFork1_#in~arg.offset_18|) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_18|, ~x~0=v_~x~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_18|, ~b~0=v_~b~0_20, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_18|, ~x~0=v_~x~0_26, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_18} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 17:17:57,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L827-2-->L827-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In929551231 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In929551231 256) 0)) (.cse1 (= |P3Thread1of1ForFork0_#t~ite33_Out929551231| |P3Thread1of1ForFork0_#t~ite32_Out929551231|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In929551231 |P3Thread1of1ForFork0_#t~ite32_Out929551231|)) (and (or .cse0 .cse2) .cse1 (= ~y~0_In929551231 |P3Thread1of1ForFork0_#t~ite32_Out929551231|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In929551231, ~y$w_buff1~0=~y$w_buff1~0_In929551231, ~y~0=~y~0_In929551231, ~y$w_buff1_used~0=~y$w_buff1_used~0_In929551231} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In929551231, ~y$w_buff1~0=~y$w_buff1~0_In929551231, ~y~0=~y~0_In929551231, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out929551231|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out929551231|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In929551231} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 17:17:57,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd4~0_In-1766808581 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1766808581 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out-1766808581| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite34_Out-1766808581| ~y$w_buff0_used~0_In-1766808581)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1766808581, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1766808581} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1766808581, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1766808581, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-1766808581|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 17:17:57,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1416305987 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1416305987 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-1416305987| ~y$w_buff0_used~0_In-1416305987)) (and (not .cse0) (= |P2Thread1of1ForFork3_#t~ite28_Out-1416305987| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1416305987, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1416305987} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1416305987, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1416305987, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1416305987|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 17:17:57,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In632902507 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In632902507 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd4~0_In632902507 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In632902507 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out632902507|)) (and (= ~y$w_buff1_used~0_In632902507 |P3Thread1of1ForFork0_#t~ite35_Out632902507|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In632902507, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In632902507, ~y$w_buff0_used~0=~y$w_buff0_used~0_In632902507, ~y$w_buff1_used~0=~y$w_buff1_used~0_In632902507} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In632902507, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In632902507, ~y$w_buff0_used~0=~y$w_buff0_used~0_In632902507, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out632902507|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In632902507} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 17:17:57,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In-955105016 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-955105016 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-955105016 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-955105016 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-955105016|)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-955105016 |P2Thread1of1ForFork3_#t~ite29_Out-955105016|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-955105016, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-955105016, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-955105016, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-955105016} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-955105016, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-955105016, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-955105016, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-955105016|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-955105016} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 17:17:57,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L804-->L805: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1163546909 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1163546909 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out1163546909 ~y$r_buff0_thd3~0_In1163546909) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd3~0_Out1163546909 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1163546909, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1163546909} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out1163546909|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1163546909, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1163546909} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:17:57,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L805-->L805-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In1218784044 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1218784044 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1218784044 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1218784044 256) 0))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out1218784044|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1218784044 |P2Thread1of1ForFork3_#t~ite31_Out1218784044|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1218784044, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1218784044, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1218784044, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1218784044} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1218784044, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1218784044, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1218784044, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out1218784044|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1218784044} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 17:17:57,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L805-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_36| v_~y$r_buff1_thd3~0_46) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_46, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 17:17:57,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2039642118 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out2039642118| ~y$w_buff0~0_In2039642118) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite8_In2039642118| |P1Thread1of1ForFork2_#t~ite8_Out2039642118|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2039642118 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In2039642118 256) 0)) (and (= 0 (mod ~y$r_buff1_thd2~0_In2039642118 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In2039642118 256)))) (= ~y$w_buff0~0_In2039642118 |P1Thread1of1ForFork2_#t~ite8_Out2039642118|) .cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out2039642118| |P1Thread1of1ForFork2_#t~ite8_Out2039642118|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2039642118, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2039642118, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In2039642118|, ~y$w_buff0~0=~y$w_buff0~0_In2039642118, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2039642118, ~weak$$choice2~0=~weak$$choice2~0_In2039642118, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2039642118} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2039642118, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out2039642118|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2039642118, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out2039642118|, ~y$w_buff0~0=~y$w_buff0~0_In2039642118, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2039642118, ~weak$$choice2~0=~weak$$choice2~0_In2039642118, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2039642118} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 17:17:57,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1995433315 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1995433315| |P1Thread1of1ForFork2_#t~ite11_Out-1995433315|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1995433315 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1995433315 256))) (= (mod ~y$w_buff0_used~0_In-1995433315 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1995433315 256)) .cse1))) (= |P1Thread1of1ForFork2_#t~ite11_Out-1995433315| ~y$w_buff1~0_In-1995433315)) (and (= |P1Thread1of1ForFork2_#t~ite11_In-1995433315| |P1Thread1of1ForFork2_#t~ite11_Out-1995433315|) (= |P1Thread1of1ForFork2_#t~ite12_Out-1995433315| ~y$w_buff1~0_In-1995433315) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1995433315, ~y$w_buff1~0=~y$w_buff1~0_In-1995433315, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1995433315, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1995433315, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-1995433315|, ~weak$$choice2~0=~weak$$choice2~0_In-1995433315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1995433315} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1995433315, ~y$w_buff1~0=~y$w_buff1~0_In-1995433315, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1995433315, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1995433315, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1995433315|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1995433315|, ~weak$$choice2~0=~weak$$choice2~0_In-1995433315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1995433315} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 17:17:57,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L769-->L770: Formula: (and (= v_~y$r_buff0_thd2~0_106 v_~y$r_buff0_thd2~0_105) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_105, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_11|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 17:17:57,914 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1572689172 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite23_In-1572689172| |P1Thread1of1ForFork2_#t~ite23_Out-1572689172|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite24_Out-1572689172| ~y$r_buff1_thd2~0_In-1572689172)) (and (= ~y$r_buff1_thd2~0_In-1572689172 |P1Thread1of1ForFork2_#t~ite23_Out-1572689172|) (= |P1Thread1of1ForFork2_#t~ite24_Out-1572689172| |P1Thread1of1ForFork2_#t~ite23_Out-1572689172|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1572689172 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1572689172 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1572689172 256))) (= (mod ~y$w_buff0_used~0_In-1572689172 256) 0))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1572689172, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1572689172, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1572689172, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-1572689172|, ~weak$$choice2~0=~weak$$choice2~0_In-1572689172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1572689172} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1572689172, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1572689172, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1572689172, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-1572689172|, ~weak$$choice2~0=~weak$$choice2~0_In-1572689172, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-1572689172|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1572689172} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 17:17:57,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L772-->L780: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (not (= 0 (mod v_~y$flush_delayed~0_10 256))) (= v_~y~0_26 v_~y$mem_tmp~0_7) (= 0 v_~y$flush_delayed~0_9)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y~0=v_~y~0_26, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 17:17:57,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1111767624 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In1111767624 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out1111767624| 0) (not .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite36_Out1111767624| ~y$r_buff0_thd4~0_In1111767624) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1111767624, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1111767624} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1111767624, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1111767624, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out1111767624|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 17:17:57,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L831-->L831-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1509568253 256))) (.cse3 (= (mod ~y$r_buff1_thd4~0_In-1509568253 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-1509568253 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1509568253 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite37_Out-1509568253| ~y$r_buff1_thd4~0_In-1509568253) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-1509568253|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1509568253, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1509568253, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1509568253, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1509568253} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1509568253, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1509568253, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1509568253, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-1509568253|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1509568253} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 17:17:57,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L831-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_146 (+ v_~__unbuffered_cnt~0_147 1)) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_66| v_~y$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_66|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_141, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_65|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:17:57,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L856-1-->L862: Formula: (and (= v_~main$tmp_guard0~0_12 1) (= 4 v_~__unbuffered_cnt~0_38)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:17:57,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L862-2-->L862-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In694193363 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In694193363 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out694193363| ~y~0_In694193363)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out694193363| ~y$w_buff1~0_In694193363) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In694193363, ~y~0=~y~0_In694193363, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In694193363, ~y$w_buff1_used~0=~y$w_buff1_used~0_In694193363} OutVars{~y$w_buff1~0=~y$w_buff1~0_In694193363, ~y~0=~y~0_In694193363, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out694193363|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In694193363, ~y$w_buff1_used~0=~y$w_buff1_used~0_In694193363} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:17:57,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L862-4-->L863: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite42_7|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_6|, ~y~0=v_~y~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:17:57,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L863-->L863-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In750967914 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In750967914 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out750967914| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out750967914| ~y$w_buff0_used~0_In750967914)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In750967914, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In750967914} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In750967914, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In750967914, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out750967914|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 17:17:57,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L864-->L864-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-17917689 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-17917689 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-17917689 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-17917689 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-17917689| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite45_Out-17917689| ~y$w_buff1_used~0_In-17917689) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-17917689, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-17917689, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-17917689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-17917689} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-17917689, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-17917689, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-17917689, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-17917689|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-17917689} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:17:57,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L865-->L865-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In107519076 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In107519076 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In107519076 |ULTIMATE.start_main_#t~ite46_Out107519076|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite46_Out107519076|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In107519076, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In107519076} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In107519076, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In107519076, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out107519076|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 17:17:57,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L866-->L866-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In2077753315 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In2077753315 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In2077753315 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2077753315 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite47_Out2077753315|)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In2077753315 |ULTIMATE.start_main_#t~ite47_Out2077753315|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2077753315, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2077753315, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2077753315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2077753315} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2077753315, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2077753315, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2077753315|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2077753315, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2077753315} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 17:17:57,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L866-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p3_EBX~0_23) (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~y$r_buff1_thd0~0_137 |v_ULTIMATE.start_main_#t~ite47_48|) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p2_EAX~0_92) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 1 v_~__unbuffered_p3_EAX~0_23) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_137, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:17:58,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:17:58 BasicIcfg [2019-12-18 17:17:58,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:17:58,035 INFO L168 Benchmark]: Toolchain (without parser) took 153030.13 ms. Allocated memory was 138.9 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 101.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 17:17:58,036 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 17:17:58,036 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.23 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 156.3 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:17:58,037 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.37 ms. Allocated memory is still 203.4 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:17:58,037 INFO L168 Benchmark]: Boogie Preprocessor took 40.48 ms. Allocated memory is still 203.4 MB. Free memory was 153.6 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:17:58,037 INFO L168 Benchmark]: RCFGBuilder took 916.39 ms. Allocated memory is still 203.4 MB. Free memory was 151.0 MB in the beginning and 101.8 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:17:58,038 INFO L168 Benchmark]: TraceAbstraction took 151205.53 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-18 17:17:58,039 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 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 761.23 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 156.3 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 99.37 ms. Allocated memory is still 203.4 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.48 ms. Allocated memory is still 203.4 MB. Free memory was 153.6 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 916.39 ms. Allocated memory is still 203.4 MB. Free memory was 151.0 MB in the beginning and 101.8 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 151205.53 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 101.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.7s, 183 ProgramPointsBefore, 88 ProgramPointsAfterwards, 211 TransitionsBefore, 95 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 7374 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 74129 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L850] FCALL, FORK 0 pthread_create(&t957, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] FCALL, FORK 0 pthread_create(&t958, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t959, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t960, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 1 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 [L818] 4 a = 1 [L821] 4 __unbuffered_p3_EAX = a [L824] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L828] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L757] 2 x = 1 [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L829] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L862] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 150.8s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 47.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6453 SDtfs, 12804 SDslu, 28556 SDs, 0 SdLazy, 25371 SolverSat, 904 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 639 GetRequests, 37 SyntacticMatches, 29 SemanticMatches, 573 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4497 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160086occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 55.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 146685 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1572 NumberOfCodeBlocks, 1572 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1480 ConstructedInterpolants, 0 QuantifiedInterpolants, 451864 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...