/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:43:25,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:43:25,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:43:25,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:43:25,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:43:25,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:43:25,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:43:25,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:43:25,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:43:25,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:43:25,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:43:25,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:43:25,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:43:25,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:43:25,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:43:25,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:43:25,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:43:25,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:43:25,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:43:25,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:43:25,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:43:25,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:43:25,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:43:25,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:43:25,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:43:25,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:43:25,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:43:25,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:43:25,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:43:25,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:43:25,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:43:25,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:43:25,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:43:25,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:43:25,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:43:25,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:43:25,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:43:25,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:43:25,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:43:25,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:43:25,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:43:25,827 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:43:25,841 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:43:25,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:43:25,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:43:25,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:43:25,843 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:43:25,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:43:25,844 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:43:25,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:43:25,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:43:25,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:43:25,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:43:25,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:43:25,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:43:25,845 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:43:25,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:43:25,845 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:43:25,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:43:25,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:43:25,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:43:25,846 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:43:25,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:43:25,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:43:25,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:43:25,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:43:25,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:43:25,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:43:25,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:43:25,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:43:25,848 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:43:25,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:43:26,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:43:26,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:43:26,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:43:26,137 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:43:26,138 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:43:26,138 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_pso.oepc.i [2019-12-26 23:43:26,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837274561/3c5be97206f546129307f827cfc4cc7b/FLAG22128e17a [2019-12-26 23:43:26,763 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:43:26,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_pso.oepc.i [2019-12-26 23:43:26,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837274561/3c5be97206f546129307f827cfc4cc7b/FLAG22128e17a [2019-12-26 23:43:26,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837274561/3c5be97206f546129307f827cfc4cc7b [2019-12-26 23:43:27,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:43:27,007 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:43:27,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:43:27,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:43:27,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:43:27,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:43:26" (1/1) ... [2019-12-26 23:43:27,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e11d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:27, skipping insertion in model container [2019-12-26 23:43:27,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:43:26" (1/1) ... [2019-12-26 23:43:27,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:43:27,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:43:27,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:43:27,643 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:43:27,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:43:27,795 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:43:27,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:27 WrapperNode [2019-12-26 23:43:27,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:43:27,796 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:43:27,796 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:43:27,796 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:43:27,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:27" (1/1) ... [2019-12-26 23:43:27,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:27" (1/1) ... [2019-12-26 23:43:27,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:43:27,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:43:27,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:43:27,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:43:27,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:27" (1/1) ... [2019-12-26 23:43:27,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:27" (1/1) ... [2019-12-26 23:43:27,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:27" (1/1) ... [2019-12-26 23:43:27,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:27" (1/1) ... [2019-12-26 23:43:27,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:27" (1/1) ... [2019-12-26 23:43:27,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:27" (1/1) ... [2019-12-26 23:43:27,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:27" (1/1) ... [2019-12-26 23:43:27,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:43:27,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:43:27,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:43:27,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:43:27,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:27" (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-26 23:43:27,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:43:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:43:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:43:27,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:43:27,984 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:43:27,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:43:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:43:27,985 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:43:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:43:27,986 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:43:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:43:27,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:43:27,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:43:27,988 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:43:28,717 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:43:28,718 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:43:28,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:43:28 BoogieIcfgContainer [2019-12-26 23:43:28,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:43:28,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:43:28,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:43:28,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:43:28,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:43:26" (1/3) ... [2019-12-26 23:43:28,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f120c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:43:28, skipping insertion in model container [2019-12-26 23:43:28,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:27" (2/3) ... [2019-12-26 23:43:28,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f120c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:43:28, skipping insertion in model container [2019-12-26 23:43:28,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:43:28" (3/3) ... [2019-12-26 23:43:28,728 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_pso.oepc.i [2019-12-26 23:43:28,738 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:43:28,739 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:43:28,746 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:43:28,747 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:43:28,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,789 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,790 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,814 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,814 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,815 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,815 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,815 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,843 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,843 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,854 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,854 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,854 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,860 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,861 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,864 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,865 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:28,884 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:43:28,907 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:43:28,908 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:43:28,908 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:43:28,908 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:43:28,908 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:43:28,908 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:43:28,908 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:43:28,908 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:43:28,932 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-26 23:43:28,934 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-26 23:43:29,074 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-26 23:43:29,075 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:43:29,090 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:43:29,113 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-26 23:43:29,174 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-26 23:43:29,174 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:43:29,184 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:43:29,206 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-26 23:43:29,207 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:43:34,484 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 23:43:34,603 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 23:43:34,724 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-26 23:43:34,724 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 23:43:34,728 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-26 23:43:47,443 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-26 23:43:47,445 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-26 23:43:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:43:47,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:47,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:43:47,453 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:47,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:47,461 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-26 23:43:47,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:47,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344637866] [2019-12-26 23:43:47,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:47,691 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-26 23:43:47,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344637866] [2019-12-26 23:43:47,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:47,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:43:47,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211644621] [2019-12-26 23:43:47,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:43:47,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:47,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:43:47,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:43:47,718 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-26 23:43:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:50,356 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-26 23:43:50,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:43:50,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:43:50,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:50,969 INFO L225 Difference]: With dead ends: 85012 [2019-12-26 23:43:50,969 INFO L226 Difference]: Without dead ends: 80140 [2019-12-26 23:43:50,971 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-26 23:43:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-26 23:43:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-26 23:43:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-26 23:43:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-26 23:43:58,842 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-26 23:43:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:58,842 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-26 23:43:58,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:43:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-26 23:43:58,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:43:58,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:58,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:58,852 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:58,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:58,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-26 23:43:58,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:58,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765646223] [2019-12-26 23:43:58,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:58,946 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-26 23:43:58,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765646223] [2019-12-26 23:43:58,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:58,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:43:58,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731981332] [2019-12-26 23:43:58,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:43:58,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:58,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:43:58,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:43:58,950 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-26 23:44:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:03,260 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-26 23:44:03,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:44:03,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:44:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:03,906 INFO L225 Difference]: With dead ends: 123388 [2019-12-26 23:44:03,906 INFO L226 Difference]: Without dead ends: 123290 [2019-12-26 23:44:03,907 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-26 23:44:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-26 23:44:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-26 23:44:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-26 23:44:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-26 23:44:13,233 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-26 23:44:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:13,234 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-26 23:44:13,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-26 23:44:13,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:44:13,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:13,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:13,237 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:13,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-26 23:44:13,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:13,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87199678] [2019-12-26 23:44:13,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:13,357 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-26 23:44:13,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87199678] [2019-12-26 23:44:13,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:13,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:13,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541468774] [2019-12-26 23:44:13,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:13,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:13,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:13,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:13,361 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-26 23:44:18,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:18,290 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-26 23:44:18,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:44:18,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:44:18,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:18,805 INFO L225 Difference]: With dead ends: 159677 [2019-12-26 23:44:18,806 INFO L226 Difference]: Without dead ends: 159565 [2019-12-26 23:44:18,806 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-26 23:44:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-26 23:44:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-26 23:44:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-26 23:44:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-26 23:44:27,190 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-26 23:44:27,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:27,191 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-26 23:44:27,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-26 23:44:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:44:27,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:27,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:27,196 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:27,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:27,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-26 23:44:27,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:27,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202829472] [2019-12-26 23:44:27,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:27,257 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-26 23:44:27,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202829472] [2019-12-26 23:44:27,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:27,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:44:27,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871127358] [2019-12-26 23:44:27,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:44:27,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:44:27,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:44:27,264 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-26 23:44:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:34,044 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-26 23:44:34,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:44:34,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-26 23:44:34,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:34,595 INFO L225 Difference]: With dead ends: 181618 [2019-12-26 23:44:34,595 INFO L226 Difference]: Without dead ends: 181618 [2019-12-26 23:44:34,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:44:38,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-26 23:44:41,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-26 23:44:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-26 23:44:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-26 23:44:43,086 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-26 23:44:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:43,086 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-26 23:44:43,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:44:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-26 23:44:43,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:44:43,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:43,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:43,090 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:43,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:43,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-26 23:44:43,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:43,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227587866] [2019-12-26 23:44:43,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:43,143 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-26 23:44:43,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227587866] [2019-12-26 23:44:43,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:43,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:43,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992829927] [2019-12-26 23:44:43,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:43,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:43,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:43,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:43,145 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-26 23:44:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:44,201 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-26 23:44:44,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:44:44,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:44:44,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:46,362 INFO L225 Difference]: With dead ends: 179622 [2019-12-26 23:44:46,362 INFO L226 Difference]: Without dead ends: 179542 [2019-12-26 23:44:46,363 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-26 23:44:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-26 23:45:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-26 23:45:00,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-26 23:45:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-26 23:45:00,603 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-26 23:45:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:00,603 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-26 23:45:00,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-26 23:45:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:45:00,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:00,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:00,608 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:00,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:00,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-26 23:45:00,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:00,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564599514] [2019-12-26 23:45:00,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:00,675 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-26 23:45:00,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564599514] [2019-12-26 23:45:00,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:00,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:00,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655155003] [2019-12-26 23:45:00,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:00,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:00,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:00,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:00,678 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-26 23:45:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:06,732 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-26 23:45:06,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:45:06,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:45:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:07,280 INFO L225 Difference]: With dead ends: 189091 [2019-12-26 23:45:07,280 INFO L226 Difference]: Without dead ends: 188995 [2019-12-26 23:45:07,281 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-26 23:45:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-26 23:45:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-26 23:45:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-26 23:45:15,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-26 23:45:15,999 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-26 23:45:15,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:15,999 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-26 23:45:16,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:16,000 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-26 23:45:16,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 23:45:16,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:16,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:16,021 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:16,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:16,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-26 23:45:16,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:16,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040698250] [2019-12-26 23:45:16,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:16,094 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-26 23:45:16,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040698250] [2019-12-26 23:45:16,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:16,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:45:16,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536938299] [2019-12-26 23:45:16,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:16,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:16,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:16,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:16,096 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-26 23:45:22,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:22,793 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-26 23:45:22,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:22,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 23:45:22,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:23,277 INFO L225 Difference]: With dead ends: 160940 [2019-12-26 23:45:23,277 INFO L226 Difference]: Without dead ends: 160940 [2019-12-26 23:45:23,277 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-26 23:45:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-26 23:45:30,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-26 23:45:30,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-26 23:45:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-26 23:45:30,566 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-26 23:45:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:30,566 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-26 23:45:30,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-26 23:45:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:45:30,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:30,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:30,587 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:30,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:30,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1406595818, now seen corresponding path program 1 times [2019-12-26 23:45:30,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:30,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209543992] [2019-12-26 23:45:30,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:30,659 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-26 23:45:30,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209543992] [2019-12-26 23:45:30,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:30,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:30,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147196187] [2019-12-26 23:45:30,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:30,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:30,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:30,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:30,661 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-26 23:45:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:33,115 INFO L93 Difference]: Finished difference Result 255238 states and 1058186 transitions. [2019-12-26 23:45:33,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:45:33,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 23:45:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:40,949 INFO L225 Difference]: With dead ends: 255238 [2019-12-26 23:45:40,950 INFO L226 Difference]: Without dead ends: 128270 [2019-12-26 23:45:40,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:44,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128270 states. [2019-12-26 23:45:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128270 to 128270. [2019-12-26 23:45:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128270 states. [2019-12-26 23:45:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128270 states to 128270 states and 523459 transitions. [2019-12-26 23:45:46,614 INFO L78 Accepts]: Start accepts. Automaton has 128270 states and 523459 transitions. Word has length 19 [2019-12-26 23:45:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:46,614 INFO L462 AbstractCegarLoop]: Abstraction has 128270 states and 523459 transitions. [2019-12-26 23:45:46,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 128270 states and 523459 transitions. [2019-12-26 23:45:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:45:46,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:46,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:46,630 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:46,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:46,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2069277611, now seen corresponding path program 1 times [2019-12-26 23:45:46,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:46,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497708419] [2019-12-26 23:45:46,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:47,594 WARN L192 SmtUtils]: Spent 903.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-26 23:45:47,617 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-26 23:45:47,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497708419] [2019-12-26 23:45:47,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:47,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:47,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838595472] [2019-12-26 23:45:47,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:47,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:47,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:47,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:47,623 INFO L87 Difference]: Start difference. First operand 128270 states and 523459 transitions. Second operand 4 states. [2019-12-26 23:45:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:47,808 INFO L93 Difference]: Finished difference Result 36423 states and 125388 transitions. [2019-12-26 23:45:47,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:45:47,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 23:45:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:47,860 INFO L225 Difference]: With dead ends: 36423 [2019-12-26 23:45:47,860 INFO L226 Difference]: Without dead ends: 28545 [2019-12-26 23:45:47,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28545 states. [2019-12-26 23:45:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28545 to 28545. [2019-12-26 23:45:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28545 states. [2019-12-26 23:45:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28545 states to 28545 states and 94430 transitions. [2019-12-26 23:45:48,393 INFO L78 Accepts]: Start accepts. Automaton has 28545 states and 94430 transitions. Word has length 19 [2019-12-26 23:45:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:48,394 INFO L462 AbstractCegarLoop]: Abstraction has 28545 states and 94430 transitions. [2019-12-26 23:45:48,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:48,394 INFO L276 IsEmpty]: Start isEmpty. Operand 28545 states and 94430 transitions. [2019-12-26 23:45:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:45:48,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:48,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:48,400 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:48,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:48,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-26 23:45:48,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:48,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68702046] [2019-12-26 23:45:48,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:48,465 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-26 23:45:48,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68702046] [2019-12-26 23:45:48,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:48,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:48,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097139482] [2019-12-26 23:45:48,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:48,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:48,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:48,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:48,467 INFO L87 Difference]: Start difference. First operand 28545 states and 94430 transitions. Second operand 5 states. [2019-12-26 23:45:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:48,894 INFO L93 Difference]: Finished difference Result 37265 states and 121195 transitions. [2019-12-26 23:45:48,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:45:48,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 23:45:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:48,961 INFO L225 Difference]: With dead ends: 37265 [2019-12-26 23:45:48,962 INFO L226 Difference]: Without dead ends: 36963 [2019-12-26 23:45:48,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:45:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36963 states. [2019-12-26 23:45:51,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36963 to 29525. [2019-12-26 23:45:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29525 states. [2019-12-26 23:45:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29525 states to 29525 states and 97651 transitions. [2019-12-26 23:45:51,573 INFO L78 Accepts]: Start accepts. Automaton has 29525 states and 97651 transitions. Word has length 22 [2019-12-26 23:45:51,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:51,574 INFO L462 AbstractCegarLoop]: Abstraction has 29525 states and 97651 transitions. [2019-12-26 23:45:51,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand 29525 states and 97651 transitions. [2019-12-26 23:45:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:45:51,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:51,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:51,580 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:51,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:51,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-26 23:45:51,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:51,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698303214] [2019-12-26 23:45:51,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:51,641 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-26 23:45:51,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698303214] [2019-12-26 23:45:51,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:51,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:51,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092366706] [2019-12-26 23:45:51,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:51,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:51,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:51,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:51,643 INFO L87 Difference]: Start difference. First operand 29525 states and 97651 transitions. Second operand 5 states. [2019-12-26 23:45:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:52,067 INFO L93 Difference]: Finished difference Result 37362 states and 121787 transitions. [2019-12-26 23:45:52,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:45:52,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 23:45:52,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:52,123 INFO L225 Difference]: With dead ends: 37362 [2019-12-26 23:45:52,124 INFO L226 Difference]: Without dead ends: 36942 [2019-12-26 23:45:52,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:45:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36942 states. [2019-12-26 23:45:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36942 to 28461. [2019-12-26 23:45:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-26 23:45:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 94342 transitions. [2019-12-26 23:45:52,649 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 94342 transitions. Word has length 22 [2019-12-26 23:45:52,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:52,649 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 94342 transitions. [2019-12-26 23:45:52,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 94342 transitions. [2019-12-26 23:45:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:45:52,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:52,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, 1] [2019-12-26 23:45:52,658 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:52,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:52,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-26 23:45:52,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:52,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645115403] [2019-12-26 23:45:52,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:52,750 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-26 23:45:52,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645115403] [2019-12-26 23:45:52,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:52,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:52,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166381053] [2019-12-26 23:45:52,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:52,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:52,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:52,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:52,752 INFO L87 Difference]: Start difference. First operand 28461 states and 94342 transitions. Second operand 5 states. [2019-12-26 23:45:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:53,069 INFO L93 Difference]: Finished difference Result 28874 states and 95112 transitions. [2019-12-26 23:45:53,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:45:53,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-26 23:45:53,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:53,113 INFO L225 Difference]: With dead ends: 28874 [2019-12-26 23:45:53,113 INFO L226 Difference]: Without dead ends: 28434 [2019-12-26 23:45:53,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:45:53,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28434 states. [2019-12-26 23:45:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28434 to 28291. [2019-12-26 23:45:53,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28291 states. [2019-12-26 23:45:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28291 states to 28291 states and 93821 transitions. [2019-12-26 23:45:53,884 INFO L78 Accepts]: Start accepts. Automaton has 28291 states and 93821 transitions. Word has length 25 [2019-12-26 23:45:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:53,884 INFO L462 AbstractCegarLoop]: Abstraction has 28291 states and 93821 transitions. [2019-12-26 23:45:53,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 28291 states and 93821 transitions. [2019-12-26 23:45:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:45:53,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:53,897 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-26 23:45:53,897 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:53,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash -126544367, now seen corresponding path program 1 times [2019-12-26 23:45:53,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:53,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643707982] [2019-12-26 23:45:53,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:53,961 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-26 23:45:53,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643707982] [2019-12-26 23:45:53,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:53,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:53,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323927861] [2019-12-26 23:45:53,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:53,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:53,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:53,964 INFO L87 Difference]: Start difference. First operand 28291 states and 93821 transitions. Second operand 5 states. [2019-12-26 23:45:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:54,441 INFO L93 Difference]: Finished difference Result 37145 states and 121294 transitions. [2019-12-26 23:45:54,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:45:54,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 23:45:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:54,524 INFO L225 Difference]: With dead ends: 37145 [2019-12-26 23:45:54,524 INFO L226 Difference]: Without dead ends: 36771 [2019-12-26 23:45:54,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:45:54,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36771 states. [2019-12-26 23:45:55,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36771 to 29755. [2019-12-26 23:45:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29755 states. [2019-12-26 23:45:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29755 states to 29755 states and 98514 transitions. [2019-12-26 23:45:55,108 INFO L78 Accepts]: Start accepts. Automaton has 29755 states and 98514 transitions. Word has length 28 [2019-12-26 23:45:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:55,108 INFO L462 AbstractCegarLoop]: Abstraction has 29755 states and 98514 transitions. [2019-12-26 23:45:55,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 29755 states and 98514 transitions. [2019-12-26 23:45:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:45:55,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:55,121 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-26 23:45:55,121 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:55,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:55,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1319845053, now seen corresponding path program 1 times [2019-12-26 23:45:55,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:55,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242643279] [2019-12-26 23:45:55,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:55,158 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-26 23:45:55,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242643279] [2019-12-26 23:45:55,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:55,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:55,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814129973] [2019-12-26 23:45:55,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:55,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:55,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:55,160 INFO L87 Difference]: Start difference. First operand 29755 states and 98514 transitions. Second operand 3 states. [2019-12-26 23:45:55,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:55,316 INFO L93 Difference]: Finished difference Result 38320 states and 126138 transitions. [2019-12-26 23:45:55,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:55,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-26 23:45:55,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:55,677 INFO L225 Difference]: With dead ends: 38320 [2019-12-26 23:45:55,677 INFO L226 Difference]: Without dead ends: 38320 [2019-12-26 23:45:55,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38320 states. [2019-12-26 23:45:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38320 to 30661. [2019-12-26 23:45:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30661 states. [2019-12-26 23:45:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30661 states to 30661 states and 100227 transitions. [2019-12-26 23:45:56,211 INFO L78 Accepts]: Start accepts. Automaton has 30661 states and 100227 transitions. Word has length 28 [2019-12-26 23:45:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:56,211 INFO L462 AbstractCegarLoop]: Abstraction has 30661 states and 100227 transitions. [2019-12-26 23:45:56,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 30661 states and 100227 transitions. [2019-12-26 23:45:56,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 23:45:56,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:56,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:56,228 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:56,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:56,228 INFO L82 PathProgramCache]: Analyzing trace with hash 234862090, now seen corresponding path program 1 times [2019-12-26 23:45:56,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:56,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860718273] [2019-12-26 23:45:56,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:56,294 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-26 23:45:56,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860718273] [2019-12-26 23:45:56,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:56,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:56,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830326645] [2019-12-26 23:45:56,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:56,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:56,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:56,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:56,296 INFO L87 Difference]: Start difference. First operand 30661 states and 100227 transitions. Second operand 5 states. [2019-12-26 23:45:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:56,777 INFO L93 Difference]: Finished difference Result 39205 states and 126499 transitions. [2019-12-26 23:45:56,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:45:56,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-26 23:45:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:56,851 INFO L225 Difference]: With dead ends: 39205 [2019-12-26 23:45:56,851 INFO L226 Difference]: Without dead ends: 38811 [2019-12-26 23:45:56,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:45:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38811 states. [2019-12-26 23:45:57,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38811 to 30894. [2019-12-26 23:45:57,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30894 states. [2019-12-26 23:45:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30894 states to 30894 states and 100767 transitions. [2019-12-26 23:45:57,723 INFO L78 Accepts]: Start accepts. Automaton has 30894 states and 100767 transitions. Word has length 29 [2019-12-26 23:45:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:57,724 INFO L462 AbstractCegarLoop]: Abstraction has 30894 states and 100767 transitions. [2019-12-26 23:45:57,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:57,724 INFO L276 IsEmpty]: Start isEmpty. Operand 30894 states and 100767 transitions. [2019-12-26 23:45:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 23:45:57,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:57,737 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:57,737 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash 805904020, now seen corresponding path program 1 times [2019-12-26 23:45:57,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:57,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294767299] [2019-12-26 23:45:57,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:57,769 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-26 23:45:57,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294767299] [2019-12-26 23:45:57,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:57,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:57,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775508051] [2019-12-26 23:45:57,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:57,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:57,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:57,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:57,771 INFO L87 Difference]: Start difference. First operand 30894 states and 100767 transitions. Second operand 3 states. [2019-12-26 23:45:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:57,938 INFO L93 Difference]: Finished difference Result 49254 states and 162311 transitions. [2019-12-26 23:45:57,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:57,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-26 23:45:57,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:57,972 INFO L225 Difference]: With dead ends: 49254 [2019-12-26 23:45:57,972 INFO L226 Difference]: Without dead ends: 21429 [2019-12-26 23:45:57,972 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-26 23:45:58,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21429 states. [2019-12-26 23:45:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21429 to 20333. [2019-12-26 23:45:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20333 states. [2019-12-26 23:45:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20333 states to 20333 states and 67715 transitions. [2019-12-26 23:45:58,359 INFO L78 Accepts]: Start accepts. Automaton has 20333 states and 67715 transitions. Word has length 29 [2019-12-26 23:45:58,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:58,360 INFO L462 AbstractCegarLoop]: Abstraction has 20333 states and 67715 transitions. [2019-12-26 23:45:58,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 20333 states and 67715 transitions. [2019-12-26 23:45:58,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 23:45:58,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:58,368 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:58,369 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:58,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:58,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1673459084, now seen corresponding path program 1 times [2019-12-26 23:45:58,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:58,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884204370] [2019-12-26 23:45:58,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:58,441 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-26 23:45:58,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884204370] [2019-12-26 23:45:58,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:58,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:45:58,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422086358] [2019-12-26 23:45:58,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:58,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:58,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:58,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:58,443 INFO L87 Difference]: Start difference. First operand 20333 states and 67715 transitions. Second operand 5 states. [2019-12-26 23:45:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:59,077 INFO L93 Difference]: Finished difference Result 34767 states and 112990 transitions. [2019-12-26 23:45:59,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:45:59,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-26 23:45:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:59,161 INFO L225 Difference]: With dead ends: 34767 [2019-12-26 23:45:59,161 INFO L226 Difference]: Without dead ends: 34767 [2019-12-26 23:45:59,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:59,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34767 states. [2019-12-26 23:45:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34767 to 29090. [2019-12-26 23:45:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29090 states. [2019-12-26 23:46:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29090 states to 29090 states and 95089 transitions. [2019-12-26 23:46:00,020 INFO L78 Accepts]: Start accepts. Automaton has 29090 states and 95089 transitions. Word has length 30 [2019-12-26 23:46:00,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:00,020 INFO L462 AbstractCegarLoop]: Abstraction has 29090 states and 95089 transitions. [2019-12-26 23:46:00,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:46:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 29090 states and 95089 transitions. [2019-12-26 23:46:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 23:46:00,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:00,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:00,034 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:00,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:00,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1413309470, now seen corresponding path program 1 times [2019-12-26 23:46:00,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:00,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610470294] [2019-12-26 23:46:00,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:00,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610470294] [2019-12-26 23:46:00,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:00,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:46:00,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624297635] [2019-12-26 23:46:00,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:46:00,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:00,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:46:00,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:46:00,101 INFO L87 Difference]: Start difference. First operand 29090 states and 95089 transitions. Second operand 5 states. [2019-12-26 23:46:00,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:00,209 INFO L93 Difference]: Finished difference Result 13178 states and 39760 transitions. [2019-12-26 23:46:00,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:46:00,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-26 23:46:00,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:00,235 INFO L225 Difference]: With dead ends: 13178 [2019-12-26 23:46:00,236 INFO L226 Difference]: Without dead ends: 11110 [2019-12-26 23:46:00,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:46:00,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-12-26 23:46:00,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 10943. [2019-12-26 23:46:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10943 states. [2019-12-26 23:46:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10943 states to 10943 states and 32777 transitions. [2019-12-26 23:46:00,539 INFO L78 Accepts]: Start accepts. Automaton has 10943 states and 32777 transitions. Word has length 31 [2019-12-26 23:46:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:00,539 INFO L462 AbstractCegarLoop]: Abstraction has 10943 states and 32777 transitions. [2019-12-26 23:46:00,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:46:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 10943 states and 32777 transitions. [2019-12-26 23:46:00,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:46:00,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:00,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:00,559 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:00,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:00,559 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-26 23:46:00,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:00,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419841295] [2019-12-26 23:46:00,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:00,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419841295] [2019-12-26 23:46:00,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:00,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:46:00,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096207215] [2019-12-26 23:46:00,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:46:00,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:00,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:46:00,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:46:00,672 INFO L87 Difference]: Start difference. First operand 10943 states and 32777 transitions. Second operand 6 states. [2019-12-26 23:46:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:00,903 INFO L93 Difference]: Finished difference Result 11069 states and 33011 transitions. [2019-12-26 23:46:00,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:46:00,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 23:46:00,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:00,925 INFO L225 Difference]: With dead ends: 11069 [2019-12-26 23:46:00,926 INFO L226 Difference]: Without dead ends: 10842 [2019-12-26 23:46:00,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:46:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-12-26 23:46:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 10842. [2019-12-26 23:46:01,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10842 states. [2019-12-26 23:46:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10842 states to 10842 states and 32566 transitions. [2019-12-26 23:46:01,173 INFO L78 Accepts]: Start accepts. Automaton has 10842 states and 32566 transitions. Word has length 40 [2019-12-26 23:46:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:01,174 INFO L462 AbstractCegarLoop]: Abstraction has 10842 states and 32566 transitions. [2019-12-26 23:46:01,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:46:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 10842 states and 32566 transitions. [2019-12-26 23:46:01,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:46:01,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:01,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:01,191 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:01,191 INFO L82 PathProgramCache]: Analyzing trace with hash -891252526, now seen corresponding path program 1 times [2019-12-26 23:46:01,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:01,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665796251] [2019-12-26 23:46:01,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:01,302 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-26 23:46:01,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665796251] [2019-12-26 23:46:01,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:01,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:46:01,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47747018] [2019-12-26 23:46:01,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:46:01,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:01,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:46:01,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:46:01,304 INFO L87 Difference]: Start difference. First operand 10842 states and 32566 transitions. Second operand 6 states. [2019-12-26 23:46:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:02,048 INFO L93 Difference]: Finished difference Result 20964 states and 62804 transitions. [2019-12-26 23:46:02,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:46:02,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 23:46:02,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:02,078 INFO L225 Difference]: With dead ends: 20964 [2019-12-26 23:46:02,078 INFO L226 Difference]: Without dead ends: 20964 [2019-12-26 23:46:02,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:46:02,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20964 states. [2019-12-26 23:46:02,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20964 to 13761. [2019-12-26 23:46:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2019-12-26 23:46:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 41473 transitions. [2019-12-26 23:46:02,332 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 41473 transitions. Word has length 40 [2019-12-26 23:46:02,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:02,332 INFO L462 AbstractCegarLoop]: Abstraction has 13761 states and 41473 transitions. [2019-12-26 23:46:02,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:46:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 41473 transitions. [2019-12-26 23:46:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:46:02,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:02,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:02,351 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:02,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:02,351 INFO L82 PathProgramCache]: Analyzing trace with hash 820794198, now seen corresponding path program 2 times [2019-12-26 23:46:02,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:02,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887680363] [2019-12-26 23:46:02,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:02,427 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-26 23:46:02,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887680363] [2019-12-26 23:46:02,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:02,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:46:02,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793776331] [2019-12-26 23:46:02,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:46:02,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:02,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:46:02,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:02,429 INFO L87 Difference]: Start difference. First operand 13761 states and 41473 transitions. Second operand 3 states. [2019-12-26 23:46:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:02,491 INFO L93 Difference]: Finished difference Result 13681 states and 41186 transitions. [2019-12-26 23:46:02,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:46:02,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 23:46:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:02,516 INFO L225 Difference]: With dead ends: 13681 [2019-12-26 23:46:02,516 INFO L226 Difference]: Without dead ends: 13681 [2019-12-26 23:46:02,516 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-26 23:46:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13681 states. [2019-12-26 23:46:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13681 to 11316. [2019-12-26 23:46:02,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11316 states. [2019-12-26 23:46:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11316 states to 11316 states and 34446 transitions. [2019-12-26 23:46:02,703 INFO L78 Accepts]: Start accepts. Automaton has 11316 states and 34446 transitions. Word has length 40 [2019-12-26 23:46:02,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:02,704 INFO L462 AbstractCegarLoop]: Abstraction has 11316 states and 34446 transitions. [2019-12-26 23:46:02,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:46:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 11316 states and 34446 transitions. [2019-12-26 23:46:02,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:46:02,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:02,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:02,837 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:02,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:02,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1848652026, now seen corresponding path program 1 times [2019-12-26 23:46:02,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:02,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002941482] [2019-12-26 23:46:02,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:02,914 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-26 23:46:02,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002941482] [2019-12-26 23:46:02,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:02,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:46:02,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351609788] [2019-12-26 23:46:02,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:46:02,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:02,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:46:02,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:46:02,916 INFO L87 Difference]: Start difference. First operand 11316 states and 34446 transitions. Second operand 6 states. [2019-12-26 23:46:03,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:03,120 INFO L93 Difference]: Finished difference Result 11302 states and 34413 transitions. [2019-12-26 23:46:03,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:46:03,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 23:46:03,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:03,137 INFO L225 Difference]: With dead ends: 11302 [2019-12-26 23:46:03,137 INFO L226 Difference]: Without dead ends: 10961 [2019-12-26 23:46:03,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:46:03,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10961 states. [2019-12-26 23:46:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10961 to 10961. [2019-12-26 23:46:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10961 states. [2019-12-26 23:46:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10961 states to 10961 states and 33758 transitions. [2019-12-26 23:46:03,299 INFO L78 Accepts]: Start accepts. Automaton has 10961 states and 33758 transitions. Word has length 41 [2019-12-26 23:46:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:03,299 INFO L462 AbstractCegarLoop]: Abstraction has 10961 states and 33758 transitions. [2019-12-26 23:46:03,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:46:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 10961 states and 33758 transitions. [2019-12-26 23:46:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:46:03,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:03,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:03,310 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:03,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:03,310 INFO L82 PathProgramCache]: Analyzing trace with hash 685009244, now seen corresponding path program 1 times [2019-12-26 23:46:03,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:03,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075130] [2019-12-26 23:46:03,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:03,398 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-26 23:46:03,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075130] [2019-12-26 23:46:03,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:03,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:46:03,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288630492] [2019-12-26 23:46:03,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:46:03,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:03,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:46:03,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:46:03,400 INFO L87 Difference]: Start difference. First operand 10961 states and 33758 transitions. Second operand 6 states. [2019-12-26 23:46:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:03,508 INFO L93 Difference]: Finished difference Result 10006 states and 31412 transitions. [2019-12-26 23:46:03,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:46:03,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 23:46:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:03,526 INFO L225 Difference]: With dead ends: 10006 [2019-12-26 23:46:03,526 INFO L226 Difference]: Without dead ends: 9901 [2019-12-26 23:46:03,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:46:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9901 states. [2019-12-26 23:46:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9901 to 9846. [2019-12-26 23:46:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9846 states. [2019-12-26 23:46:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 31016 transitions. [2019-12-26 23:46:03,710 INFO L78 Accepts]: Start accepts. Automaton has 9846 states and 31016 transitions. Word has length 41 [2019-12-26 23:46:03,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:03,710 INFO L462 AbstractCegarLoop]: Abstraction has 9846 states and 31016 transitions. [2019-12-26 23:46:03,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:46:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand 9846 states and 31016 transitions. [2019-12-26 23:46:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:46:03,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:03,723 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] [2019-12-26 23:46:03,723 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:03,723 INFO L82 PathProgramCache]: Analyzing trace with hash 92371973, now seen corresponding path program 1 times [2019-12-26 23:46:03,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:03,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273554432] [2019-12-26 23:46:03,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:03,809 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-26 23:46:03,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273554432] [2019-12-26 23:46:03,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:03,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:46:03,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637429635] [2019-12-26 23:46:03,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:46:03,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:03,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:46:03,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:46:03,813 INFO L87 Difference]: Start difference. First operand 9846 states and 31016 transitions. Second operand 8 states. [2019-12-26 23:46:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:04,489 INFO L93 Difference]: Finished difference Result 18711 states and 57563 transitions. [2019-12-26 23:46:04,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:46:04,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-26 23:46:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:04,513 INFO L225 Difference]: With dead ends: 18711 [2019-12-26 23:46:04,513 INFO L226 Difference]: Without dead ends: 13830 [2019-12-26 23:46:04,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:46:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13830 states. [2019-12-26 23:46:04,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13830 to 11317. [2019-12-26 23:46:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11317 states. [2019-12-26 23:46:04,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11317 states to 11317 states and 35333 transitions. [2019-12-26 23:46:04,700 INFO L78 Accepts]: Start accepts. Automaton has 11317 states and 35333 transitions. Word has length 55 [2019-12-26 23:46:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:04,700 INFO L462 AbstractCegarLoop]: Abstraction has 11317 states and 35333 transitions. [2019-12-26 23:46:04,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:46:04,700 INFO L276 IsEmpty]: Start isEmpty. Operand 11317 states and 35333 transitions. [2019-12-26 23:46:04,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:46:04,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:04,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] [2019-12-26 23:46:04,713 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:04,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:04,714 INFO L82 PathProgramCache]: Analyzing trace with hash 62198309, now seen corresponding path program 2 times [2019-12-26 23:46:04,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:04,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620156078] [2019-12-26 23:46:04,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:04,828 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-26 23:46:04,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620156078] [2019-12-26 23:46:04,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:04,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:46:04,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178113308] [2019-12-26 23:46:04,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:46:04,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:04,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:46:04,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:46:04,830 INFO L87 Difference]: Start difference. First operand 11317 states and 35333 transitions. Second operand 7 states. [2019-12-26 23:46:05,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:05,068 INFO L93 Difference]: Finished difference Result 19372 states and 59250 transitions. [2019-12-26 23:46:05,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:46:05,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-26 23:46:05,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:05,090 INFO L225 Difference]: With dead ends: 19372 [2019-12-26 23:46:05,090 INFO L226 Difference]: Without dead ends: 14143 [2019-12-26 23:46:05,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:46:05,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14143 states. [2019-12-26 23:46:05,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14143 to 13246. [2019-12-26 23:46:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13246 states. [2019-12-26 23:46:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13246 states to 13246 states and 40719 transitions. [2019-12-26 23:46:05,293 INFO L78 Accepts]: Start accepts. Automaton has 13246 states and 40719 transitions. Word has length 55 [2019-12-26 23:46:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:05,293 INFO L462 AbstractCegarLoop]: Abstraction has 13246 states and 40719 transitions. [2019-12-26 23:46:05,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:46:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 13246 states and 40719 transitions. [2019-12-26 23:46:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:46:05,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:05,312 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] [2019-12-26 23:46:05,313 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:05,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:05,313 INFO L82 PathProgramCache]: Analyzing trace with hash -435713207, now seen corresponding path program 3 times [2019-12-26 23:46:05,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:05,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243027006] [2019-12-26 23:46:05,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:05,373 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-26 23:46:05,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243027006] [2019-12-26 23:46:05,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:05,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:46:05,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643379104] [2019-12-26 23:46:05,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:46:05,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:05,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:46:05,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:46:05,375 INFO L87 Difference]: Start difference. First operand 13246 states and 40719 transitions. Second operand 7 states. [2019-12-26 23:46:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:05,637 INFO L93 Difference]: Finished difference Result 20485 states and 61956 transitions. [2019-12-26 23:46:05,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:46:05,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-26 23:46:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:05,759 INFO L225 Difference]: With dead ends: 20485 [2019-12-26 23:46:05,759 INFO L226 Difference]: Without dead ends: 15613 [2019-12-26 23:46:05,760 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-26 23:46:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15613 states. [2019-12-26 23:46:05,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15613 to 13283. [2019-12-26 23:46:05,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13283 states. [2019-12-26 23:46:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13283 states to 13283 states and 40785 transitions. [2019-12-26 23:46:05,966 INFO L78 Accepts]: Start accepts. Automaton has 13283 states and 40785 transitions. Word has length 55 [2019-12-26 23:46:05,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:05,966 INFO L462 AbstractCegarLoop]: Abstraction has 13283 states and 40785 transitions. [2019-12-26 23:46:05,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:46:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 13283 states and 40785 transitions. [2019-12-26 23:46:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:46:05,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:05,981 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] [2019-12-26 23:46:05,982 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:05,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:05,982 INFO L82 PathProgramCache]: Analyzing trace with hash -808118167, now seen corresponding path program 4 times [2019-12-26 23:46:05,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:05,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568976390] [2019-12-26 23:46:05,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:46:06,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568976390] [2019-12-26 23:46:06,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:06,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:46:06,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346138650] [2019-12-26 23:46:06,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:46:06,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:06,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:46:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:46:06,074 INFO L87 Difference]: Start difference. First operand 13283 states and 40785 transitions. Second operand 9 states. [2019-12-26 23:46:06,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:06,977 INFO L93 Difference]: Finished difference Result 23536 states and 71056 transitions. [2019-12-26 23:46:06,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 23:46:06,978 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-26 23:46:06,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:07,022 INFO L225 Difference]: With dead ends: 23536 [2019-12-26 23:46:07,022 INFO L226 Difference]: Without dead ends: 22230 [2019-12-26 23:46:07,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2019-12-26 23:46:07,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22230 states. [2019-12-26 23:46:07,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22230 to 13143. [2019-12-26 23:46:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13143 states. [2019-12-26 23:46:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13143 states to 13143 states and 40364 transitions. [2019-12-26 23:46:07,314 INFO L78 Accepts]: Start accepts. Automaton has 13143 states and 40364 transitions. Word has length 55 [2019-12-26 23:46:07,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:07,314 INFO L462 AbstractCegarLoop]: Abstraction has 13143 states and 40364 transitions. [2019-12-26 23:46:07,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:46:07,315 INFO L276 IsEmpty]: Start isEmpty. Operand 13143 states and 40364 transitions. [2019-12-26 23:46:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:46:07,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:07,331 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] [2019-12-26 23:46:07,331 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:07,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:07,331 INFO L82 PathProgramCache]: Analyzing trace with hash 2126472303, now seen corresponding path program 5 times [2019-12-26 23:46:07,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:07,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760235435] [2019-12-26 23:46:07,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:07,449 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-26 23:46:07,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760235435] [2019-12-26 23:46:07,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:07,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:46:07,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731278704] [2019-12-26 23:46:07,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:46:07,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:07,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:46:07,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:46:07,451 INFO L87 Difference]: Start difference. First operand 13143 states and 40364 transitions. Second operand 9 states. [2019-12-26 23:46:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:08,352 INFO L93 Difference]: Finished difference Result 31376 states and 94703 transitions. [2019-12-26 23:46:08,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:46:08,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-26 23:46:08,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:08,397 INFO L225 Difference]: With dead ends: 31376 [2019-12-26 23:46:08,397 INFO L226 Difference]: Without dead ends: 30134 [2019-12-26 23:46:08,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-26 23:46:08,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30134 states. [2019-12-26 23:46:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30134 to 13164. [2019-12-26 23:46:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13164 states. [2019-12-26 23:46:08,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 40462 transitions. [2019-12-26 23:46:08,724 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 40462 transitions. Word has length 55 [2019-12-26 23:46:08,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:08,724 INFO L462 AbstractCegarLoop]: Abstraction has 13164 states and 40462 transitions. [2019-12-26 23:46:08,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:46:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 40462 transitions. [2019-12-26 23:46:08,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:46:08,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:08,739 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] [2019-12-26 23:46:08,739 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:08,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:08,739 INFO L82 PathProgramCache]: Analyzing trace with hash -655607069, now seen corresponding path program 6 times [2019-12-26 23:46:08,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:08,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206885551] [2019-12-26 23:46:08,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:08,794 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-26 23:46:08,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206885551] [2019-12-26 23:46:08,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:08,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:46:08,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306279135] [2019-12-26 23:46:08,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:46:08,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:08,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:46:08,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:08,796 INFO L87 Difference]: Start difference. First operand 13164 states and 40462 transitions. Second operand 3 states. [2019-12-26 23:46:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:08,839 INFO L93 Difference]: Finished difference Result 8642 states and 26236 transitions. [2019-12-26 23:46:08,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:46:08,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 23:46:08,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:08,855 INFO L225 Difference]: With dead ends: 8642 [2019-12-26 23:46:08,855 INFO L226 Difference]: Without dead ends: 8642 [2019-12-26 23:46:08,855 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-26 23:46:08,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8642 states. [2019-12-26 23:46:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8642 to 8482. [2019-12-26 23:46:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8482 states. [2019-12-26 23:46:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8482 states to 8482 states and 25789 transitions. [2019-12-26 23:46:09,129 INFO L78 Accepts]: Start accepts. Automaton has 8482 states and 25789 transitions. Word has length 55 [2019-12-26 23:46:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:09,129 INFO L462 AbstractCegarLoop]: Abstraction has 8482 states and 25789 transitions. [2019-12-26 23:46:09,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:46:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 8482 states and 25789 transitions. [2019-12-26 23:46:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:09,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:09,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:46:09,146 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:09,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:09,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1033271685, now seen corresponding path program 1 times [2019-12-26 23:46:09,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:09,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962560359] [2019-12-26 23:46:09,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:09,705 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-26 23:46:09,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962560359] [2019-12-26 23:46:09,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:09,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:46:09,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612873855] [2019-12-26 23:46:09,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:46:09,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:09,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:46:09,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:46:09,708 INFO L87 Difference]: Start difference. First operand 8482 states and 25789 transitions. Second operand 14 states. [2019-12-26 23:46:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:12,784 INFO L93 Difference]: Finished difference Result 14591 states and 43804 transitions. [2019-12-26 23:46:12,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-26 23:46:12,787 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-26 23:46:12,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:12,801 INFO L225 Difference]: With dead ends: 14591 [2019-12-26 23:46:12,801 INFO L226 Difference]: Without dead ends: 9887 [2019-12-26 23:46:12,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=348, Invalid=1374, Unknown=0, NotChecked=0, Total=1722 [2019-12-26 23:46:12,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9887 states. [2019-12-26 23:46:12,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9887 to 8674. [2019-12-26 23:46:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-26 23:46:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 25947 transitions. [2019-12-26 23:46:12,937 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 25947 transitions. Word has length 56 [2019-12-26 23:46:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:12,938 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 25947 transitions. [2019-12-26 23:46:12,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:46:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 25947 transitions. [2019-12-26 23:46:12,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:12,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:12,946 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] [2019-12-26 23:46:12,947 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:12,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:12,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1822247207, now seen corresponding path program 2 times [2019-12-26 23:46:12,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:12,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692161759] [2019-12-26 23:46:12,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:13,398 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-26 23:46:13,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692161759] [2019-12-26 23:46:13,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:13,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 23:46:13,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002422739] [2019-12-26 23:46:13,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 23:46:13,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:13,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 23:46:13,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:46:13,402 INFO L87 Difference]: Start difference. First operand 8674 states and 25947 transitions. Second operand 15 states. [2019-12-26 23:46:15,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:15,846 INFO L93 Difference]: Finished difference Result 10289 states and 30211 transitions. [2019-12-26 23:46:15,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 23:46:15,846 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-26 23:46:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:15,860 INFO L225 Difference]: With dead ends: 10289 [2019-12-26 23:46:15,860 INFO L226 Difference]: Without dead ends: 9691 [2019-12-26 23:46:15,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 23:46:15,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9691 states. [2019-12-26 23:46:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9691 to 8356. [2019-12-26 23:46:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8356 states. [2019-12-26 23:46:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8356 states to 8356 states and 25083 transitions. [2019-12-26 23:46:16,042 INFO L78 Accepts]: Start accepts. Automaton has 8356 states and 25083 transitions. Word has length 56 [2019-12-26 23:46:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:16,042 INFO L462 AbstractCegarLoop]: Abstraction has 8356 states and 25083 transitions. [2019-12-26 23:46:16,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 23:46:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 8356 states and 25083 transitions. [2019-12-26 23:46:16,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:16,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:16,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:16,051 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:46:16,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:16,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 3 times [2019-12-26 23:46:16,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:16,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453947737] [2019-12-26 23:46:16,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:46:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:46:16,199 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:46:16,200 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:46:16,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_30| 1)) (= |v_ULTIMATE.start_main_~#t2079~0.offset_22| 0) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2079~0.base_30|) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2079~0.base_30|) |v_ULTIMATE.start_main_~#t2079~0.offset_22| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd1~0_362 0) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2079~0.base_30|)) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_267) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2079~0.base_30| 4) |v_#length_23|) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ULTIMATE.start_main_~#t2079~0.offset=|v_ULTIMATE.start_main_~#t2079~0.offset_22|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_328, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_31|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2079~0.base=|v_ULTIMATE.start_main_~#t2079~0.base_30|, ~y~0=v_~y~0_226, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_22|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2081~0.base, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ULTIMATE.start_main_~#t2081~0.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2079~0.offset, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2079~0.base, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t2080~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_~#t2080~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:46:16,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2080~0.base_10|) |v_ULTIMATE.start_main_~#t2080~0.offset_9| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t2080~0.base_10|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2080~0.base_10| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2080~0.base_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2080~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t2080~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2080~0.base=|v_ULTIMATE.start_main_~#t2080~0.base_10|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2080~0.offset=|v_ULTIMATE.start_main_~#t2080~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2080~0.base, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2080~0.offset] because there is no mapped edge [2019-12-26 23:46:16,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= 0 (mod v_~x$w_buff1_used~0_52 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 23:46:16,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2081~0.base_11| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2081~0.base_11|) |v_ULTIMATE.start_main_~#t2081~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2081~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2081~0.base_11|) (= |v_ULTIMATE.start_main_~#t2081~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2081~0.base=|v_ULTIMATE.start_main_~#t2081~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2081~0.offset=|v_ULTIMATE.start_main_~#t2081~0.offset_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2081~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2081~0.offset, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 23:46:16,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1852135299 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1852135299 256)))) (or (and (= ~x$w_buff1~0_In1852135299 |P2Thread1of1ForFork1_#t~ite32_Out1852135299|) (not .cse0) (not .cse1)) (and (= ~x~0_In1852135299 |P2Thread1of1ForFork1_#t~ite32_Out1852135299|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1852135299, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1852135299, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1852135299, ~x~0=~x~0_In1852135299} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1852135299|, ~x$w_buff1~0=~x$w_buff1~0_In1852135299, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1852135299, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1852135299, ~x~0=~x~0_In1852135299} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:46:16,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-26 23:46:16,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In399693804 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In399693804 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite34_Out399693804|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In399693804 |P2Thread1of1ForFork1_#t~ite34_Out399693804|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In399693804, ~x$w_buff0_used~0=~x$w_buff0_used~0_In399693804} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out399693804|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In399693804, ~x$w_buff0_used~0=~x$w_buff0_used~0_In399693804} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:46:16,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1855764544 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1855764544 256)))) (or (and (= ~x$w_buff0_used~0_In1855764544 |P1Thread1of1ForFork0_#t~ite28_Out1855764544|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1855764544|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1855764544, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1855764544} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1855764544, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1855764544|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1855764544} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 23:46:16,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In472027451 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In472027451 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In472027451 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In472027451 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out472027451| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out472027451| ~x$w_buff1_used~0_In472027451) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In472027451, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In472027451, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In472027451, ~x$w_buff0_used~0=~x$w_buff0_used~0_In472027451} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In472027451, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In472027451, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In472027451, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out472027451|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In472027451} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 23:46:16,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-503931968 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-503931968 256)))) (or (and (= ~x$r_buff0_thd2~0_In-503931968 ~x$r_buff0_thd2~0_Out-503931968) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out-503931968) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-503931968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-503931968} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-503931968|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-503931968, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-503931968} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:46:16,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In13791385 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In13791385 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In13791385 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In13791385 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out13791385| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out13791385| ~x$r_buff1_thd2~0_In13791385)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In13791385, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In13791385, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In13791385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In13791385} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out13791385|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In13791385, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In13791385, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In13791385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In13791385} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 23:46:16,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 23:46:16,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In5476760 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out5476760| |P0Thread1of1ForFork2_#t~ite9_Out5476760|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In5476760 256)))) (or (= (mod ~x$w_buff0_used~0_In5476760 256) 0) (and (= 0 (mod ~x$w_buff1_used~0_In5476760 256)) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In5476760 256)) .cse0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite8_Out5476760| ~x$w_buff0~0_In5476760)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out5476760| ~x$w_buff0~0_In5476760) (= |P0Thread1of1ForFork2_#t~ite8_In5476760| |P0Thread1of1ForFork2_#t~ite8_Out5476760|) (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In5476760, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In5476760, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In5476760|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In5476760, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In5476760, ~weak$$choice2~0=~weak$$choice2~0_In5476760, ~x$w_buff0_used~0=~x$w_buff0_used~0_In5476760} OutVars{~x$w_buff0~0=~x$w_buff0~0_In5476760, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In5476760, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out5476760|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In5476760, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out5476760|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In5476760, ~weak$$choice2~0=~weak$$choice2~0_In5476760, ~x$w_buff0_used~0=~x$w_buff0_used~0_In5476760} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 23:46:16,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-590278304 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-590278304 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-590278304 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-590278304 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-590278304|)) (and (= ~x$w_buff1_used~0_In-590278304 |P2Thread1of1ForFork1_#t~ite35_Out-590278304|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-590278304, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-590278304, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-590278304, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-590278304} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-590278304|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-590278304, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-590278304, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-590278304, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-590278304} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:46:16,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1667952923 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1667952923 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out1667952923| ~x$r_buff0_thd3~0_In1667952923)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out1667952923|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1667952923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1667952923} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1667952923|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1667952923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1667952923} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:46:16,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1731900509 256))) (.cse3 (= (mod ~x$r_buff1_thd3~0_In1731900509 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1731900509 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1731900509 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1731900509| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out1731900509| ~x$r_buff1_thd3~0_In1731900509) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1731900509, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1731900509, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1731900509, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1731900509} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1731900509|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1731900509, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1731900509, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1731900509, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1731900509} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:46:16,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 23:46:16,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1263462063 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite18_Out1263462063| ~x$w_buff1_used~0_In1263462063) (= |P0Thread1of1ForFork2_#t~ite17_In1263462063| |P0Thread1of1ForFork2_#t~ite17_Out1263462063|)) (and .cse0 (= ~x$w_buff1_used~0_In1263462063 |P0Thread1of1ForFork2_#t~ite17_Out1263462063|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1263462063 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In1263462063 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In1263462063 256)) (and (= (mod ~x$w_buff1_used~0_In1263462063 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite18_Out1263462063| |P0Thread1of1ForFork2_#t~ite17_Out1263462063|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1263462063, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1263462063|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1263462063, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1263462063, ~weak$$choice2~0=~weak$$choice2~0_In1263462063, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1263462063} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1263462063, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1263462063|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1263462063|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1263462063, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1263462063, ~weak$$choice2~0=~weak$$choice2~0_In1263462063, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1263462063} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:46:16,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 23:46:16,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1546350024 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In-1546350024| |P0Thread1of1ForFork2_#t~ite23_Out-1546350024|) (= |P0Thread1of1ForFork2_#t~ite24_Out-1546350024| ~x$r_buff1_thd1~0_In-1546350024)) (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1546350024 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1546350024 256)) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In-1546350024 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-1546350024 256) 0))) (= |P0Thread1of1ForFork2_#t~ite24_Out-1546350024| |P0Thread1of1ForFork2_#t~ite23_Out-1546350024|) (= |P0Thread1of1ForFork2_#t~ite23_Out-1546350024| ~x$r_buff1_thd1~0_In-1546350024)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1546350024, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1546350024, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1546350024, ~weak$$choice2~0=~weak$$choice2~0_In-1546350024, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1546350024|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1546350024} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1546350024, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1546350024, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1546350024, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1546350024|, ~weak$$choice2~0=~weak$$choice2~0_In-1546350024, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1546350024|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1546350024} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-26 23:46:16,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-26 23:46:16,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:46:16,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In599821215 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In599821215 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out599821215| ~x$w_buff1~0_In599821215) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In599821215 |ULTIMATE.start_main_#t~ite41_Out599821215|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In599821215, ~x$w_buff1_used~0=~x$w_buff1_used~0_In599821215, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In599821215, ~x~0=~x~0_In599821215} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out599821215|, ~x$w_buff1~0=~x$w_buff1~0_In599821215, ~x$w_buff1_used~0=~x$w_buff1_used~0_In599821215, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In599821215, ~x~0=~x~0_In599821215} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 23:46:16,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-26 23:46:16,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-649290389 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-649290389 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-649290389| ~x$w_buff0_used~0_In-649290389)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-649290389| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-649290389, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-649290389} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-649290389, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-649290389|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-649290389} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:46:16,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1279462671 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1279462671 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1279462671 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1279462671 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1279462671 |ULTIMATE.start_main_#t~ite44_Out-1279462671|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1279462671|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1279462671, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1279462671, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1279462671, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1279462671} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1279462671, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1279462671, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1279462671, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1279462671|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1279462671} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:46:16,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-966033253 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-966033253 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-966033253| ~x$r_buff0_thd0~0_In-966033253)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-966033253|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-966033253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-966033253} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-966033253, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-966033253|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-966033253} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:46:16,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-111710863 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-111710863 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-111710863 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-111710863 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-111710863|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In-111710863 |ULTIMATE.start_main_#t~ite46_Out-111710863|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-111710863, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-111710863, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-111710863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111710863} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-111710863, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-111710863|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-111710863, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-111710863, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111710863} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 23:46:16,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_60 2) (= v_~main$tmp_guard1~0_25 0) (= 1 v_~__unbuffered_p2_EAX~0_35) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= 0 v_~__unbuffered_p0_EAX~0_54) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:46:16,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:46:16 BasicIcfg [2019-12-26 23:46:16,333 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:46:16,337 INFO L168 Benchmark]: Toolchain (without parser) took 169328.57 ms. Allocated memory was 138.4 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 100.0 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 568.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:16,338 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 23:46:16,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.57 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 99.7 MB in the beginning and 157.4 MB in the end (delta: -57.6 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:16,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.29 ms. Allocated memory is still 203.4 MB. Free memory was 157.4 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:16,339 INFO L168 Benchmark]: Boogie Preprocessor took 45.14 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:16,339 INFO L168 Benchmark]: RCFGBuilder took 815.27 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 105.5 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:16,341 INFO L168 Benchmark]: TraceAbstraction took 167612.81 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 105.5 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 508.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:16,346 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.22 ms. Allocated memory is still 138.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.57 ms. Allocated memory was 138.4 MB in the beginning and 203.4 MB in the end (delta: 65.0 MB). Free memory was 99.7 MB in the beginning and 157.4 MB in the end (delta: -57.6 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.29 ms. Allocated memory is still 203.4 MB. Free memory was 157.4 MB in the beginning and 154.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.14 ms. Allocated memory is still 203.4 MB. Free memory was 154.7 MB in the beginning and 152.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 815.27 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 105.5 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 167612.81 ms. Allocated memory was 203.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 105.5 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 508.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2079, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2080, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2081, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 167.2s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 62.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4764 SDtfs, 7063 SDslu, 12234 SDs, 0 SdLazy, 8439 SolverSat, 386 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 313 GetRequests, 47 SyntacticMatches, 15 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161868occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 80.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 200743 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1073 NumberOfCodeBlocks, 1073 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 986 ConstructedInterpolants, 0 QuantifiedInterpolants, 152244 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...