/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_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:43:19,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:43:19,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:43:19,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:43:19,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:43:19,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:43:19,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:43:19,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:43:19,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:43:19,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:43:19,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:43:19,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:43:19,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:43:19,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:43:19,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:43:19,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:43:19,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:43:19,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:43:19,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:43:19,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:43:19,762 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:43:19,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:43:19,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:43:19,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:43:19,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:43:19,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:43:19,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:43:19,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:43:19,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:43:19,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:43:19,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:43:19,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:43:19,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:43:19,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:43:19,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:43:19,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:43:19,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:43:19,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:43:19,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:43:19,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:43:19,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:43:19,777 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:19,793 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:43:19,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:43:19,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:43:19,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:43:19,795 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:43:19,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:43:19,795 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:43:19,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:43:19,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:43:19,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:43:19,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:43:19,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:43:19,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:43:19,797 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:43:19,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:43:19,797 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:43:19,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:43:19,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:43:19,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:43:19,798 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:43:19,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:43:19,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:43:19,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:43:19,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:43:19,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:43:19,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:43:19,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:43:19,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:43:19,800 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:43:19,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:43:20,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:43:20,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:43:20,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:43:20,144 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:43:20,145 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:43:20,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i [2019-12-26 23:43:20,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020df534a/85226564d60947a09929705ecb35a731/FLAG230a72f50 [2019-12-26 23:43:20,807 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:43:20,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i [2019-12-26 23:43:20,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020df534a/85226564d60947a09929705ecb35a731/FLAG230a72f50 [2019-12-26 23:43:21,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/020df534a/85226564d60947a09929705ecb35a731 [2019-12-26 23:43:21,070 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:43:21,072 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:43:21,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:43:21,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:43:21,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:43:21,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:43:21" (1/1) ... [2019-12-26 23:43:21,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347cd7c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:21, skipping insertion in model container [2019-12-26 23:43:21,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:43:21" (1/1) ... [2019-12-26 23:43:21,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:43:21,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:43:21,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:43:21,651 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:43:21,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:43:21,799 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:43:21,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:21 WrapperNode [2019-12-26 23:43:21,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:43:21,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:43:21,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:43:21,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:43:21,807 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:21" (1/1) ... [2019-12-26 23:43:21,829 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:21" (1/1) ... [2019-12-26 23:43:21,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:43:21,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:43:21,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:43:21,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:43:21,866 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:21" (1/1) ... [2019-12-26 23:43:21,866 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:21" (1/1) ... [2019-12-26 23:43:21,871 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:21" (1/1) ... [2019-12-26 23:43:21,871 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:21" (1/1) ... [2019-12-26 23:43:21,881 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:21" (1/1) ... [2019-12-26 23:43:21,886 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:21" (1/1) ... [2019-12-26 23:43:21,889 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:21" (1/1) ... [2019-12-26 23:43:21,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:43:21,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:43:21,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:43:21,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:43:21,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:21" (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:21,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:43:21,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:43:21,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:43:21,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:43:21,965 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:43:21,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:43:21,965 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:43:21,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:43:21,965 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:43:21,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:43:21,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:43:21,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:43:21,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:43:21,968 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:22,683 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:43:22,684 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:43:22,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:43:22 BoogieIcfgContainer [2019-12-26 23:43:22,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:43:22,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:43:22,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:43:22,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:43:22,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:43:21" (1/3) ... [2019-12-26 23:43:22,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738851b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:43:22, skipping insertion in model container [2019-12-26 23:43:22,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:21" (2/3) ... [2019-12-26 23:43:22,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@738851b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:43:22, skipping insertion in model container [2019-12-26 23:43:22,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:43:22" (3/3) ... [2019-12-26 23:43:22,694 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc.i [2019-12-26 23:43:22,705 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:43:22,706 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:43:22,714 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:43:22,715 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:43:22,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,757 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,757 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,781 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,782 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,782 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:22,782 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,782 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,783 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,790 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,790 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,816 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,817 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,817 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,817 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:22,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,821 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,822 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,822 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,826 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,826 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:22,846 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:43:22,866 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:43:22,866 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:43:22,866 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:43:22,866 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:43:22,866 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:43:22,867 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:43:22,867 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:43:22,867 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:43:22,883 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-26 23:43:22,885 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-26 23:43:22,992 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-26 23:43:22,992 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:43:23,009 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:23,032 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-26 23:43:23,081 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-26 23:43:23,082 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:43:23,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:23,114 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-26 23:43:23,118 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:43:28,517 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 23:43:28,622 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 23:43:28,738 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-26 23:43:28,738 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 23:43:28,742 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-26 23:43:39,827 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-26 23:43:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-26 23:43:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:43:39,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:39,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:43:39,836 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:39,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:39,842 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-26 23:43:39,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:39,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927106809] [2019-12-26 23:43:39,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:40,077 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:40,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927106809] [2019-12-26 23:43:40,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:40,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:43:40,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741587411] [2019-12-26 23:43:40,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:43:40,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:40,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:43:40,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:43:40,102 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-26 23:43:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:42,487 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-26 23:43:42,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:43:42,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:43:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:43,136 INFO L225 Difference]: With dead ends: 85012 [2019-12-26 23:43:43,137 INFO L226 Difference]: Without dead ends: 80140 [2019-12-26 23:43:43,139 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:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-26 23:43:49,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-26 23:43:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-26 23:43:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-26 23:43:53,269 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-26 23:43:53,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:53,272 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-26 23:43:53,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:43:53,272 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-26 23:43:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:43:53,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:53,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:53,283 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:53,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:53,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-26 23:43:53,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:53,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047998651] [2019-12-26 23:43:53,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:53,396 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:53,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047998651] [2019-12-26 23:43:53,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:53,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:43:53,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076872511] [2019-12-26 23:43:53,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:43:53,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:53,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:43:53,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:43:53,401 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-26 23:43:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:54,332 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-26 23:43:54,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:43:54,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:43:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:58,668 INFO L225 Difference]: With dead ends: 123388 [2019-12-26 23:43:58,668 INFO L226 Difference]: Without dead ends: 123290 [2019-12-26 23:43:58,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-26 23:44:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-26 23:44:04,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-26 23:44:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-26 23:44:04,809 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-26 23:44:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:04,810 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-26 23:44:04,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-26 23:44:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:44:04,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:04,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:04,813 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:04,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:04,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-26 23:44:04,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:04,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162569193] [2019-12-26 23:44:04,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:04,923 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:04,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162569193] [2019-12-26 23:44:04,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:04,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:04,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058529936] [2019-12-26 23:44:04,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:04,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:04,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:04,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:04,925 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-26 23:44:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:06,686 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-26 23:44:06,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:44:06,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:44:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:12,777 INFO L225 Difference]: With dead ends: 159677 [2019-12-26 23:44:12,777 INFO L226 Difference]: Without dead ends: 159565 [2019-12-26 23:44:12,778 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:16,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-26 23:44:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-26 23:44:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-26 23:44:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-26 23:44:20,031 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-26 23:44:20,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:20,032 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-26 23:44:20,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-26 23:44:20,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:44:20,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:20,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:20,035 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:20,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:20,036 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-26 23:44:20,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:20,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765965549] [2019-12-26 23:44:20,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:20,092 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:20,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765965549] [2019-12-26 23:44:20,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:20,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:44:20,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190463642] [2019-12-26 23:44:20,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:44:20,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:20,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:44:20,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:44:20,095 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-26 23:44:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:22,116 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-26 23:44:22,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:44:22,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-26 23:44:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:22,759 INFO L225 Difference]: With dead ends: 181618 [2019-12-26 23:44:22,759 INFO L226 Difference]: Without dead ends: 181618 [2019-12-26 23:44:22,760 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:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-26 23:44:37,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-26 23:44:37,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-26 23:44:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-26 23:44:38,718 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-26 23:44:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:38,718 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-26 23:44:38,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:44:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-26 23:44:38,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:44:38,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:38,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:38,722 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:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:38,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-26 23:44:38,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:38,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504934403] [2019-12-26 23:44:38,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:38,791 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:38,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504934403] [2019-12-26 23:44:38,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:38,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:38,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739988770] [2019-12-26 23:44:38,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:38,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:38,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:38,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:38,795 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-26 23:44:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:39,901 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-26 23:44:39,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:44:39,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:44:39,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:41,843 INFO L225 Difference]: With dead ends: 179622 [2019-12-26 23:44:41,844 INFO L226 Difference]: Without dead ends: 179542 [2019-12-26 23:44:41,844 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:52,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-26 23:44:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-26 23:44:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-26 23:44:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-26 23:44:55,549 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-26 23:44:55,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:55,550 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-26 23:44:55,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:55,550 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-26 23:44:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:44:55,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:55,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:55,555 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:44:55,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:55,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-26 23:44:55,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:55,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675896980] [2019-12-26 23:44:55,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:55,623 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:55,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675896980] [2019-12-26 23:44:55,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:55,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:55,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806557462] [2019-12-26 23:44:55,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:55,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:55,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:55,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:55,626 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-26 23:44:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:57,763 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-26 23:44:57,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:44:57,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:44:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:58,317 INFO L225 Difference]: With dead ends: 189091 [2019-12-26 23:44:58,318 INFO L226 Difference]: Without dead ends: 188995 [2019-12-26 23:44:58,318 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:08,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-26 23:45:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-26 23:45:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-26 23:45:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-26 23:45:12,154 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-26 23:45:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:12,154 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-26 23:45:12,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-26 23:45:12,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 23:45:12,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:12,172 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:12,173 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:12,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:12,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-26 23:45:12,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:12,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385684262] [2019-12-26 23:45:12,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:12,231 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:12,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385684262] [2019-12-26 23:45:12,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:12,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:45:12,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178221078] [2019-12-26 23:45:12,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:12,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:12,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:12,234 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-26 23:45:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:18,839 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-26 23:45:18,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:18,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 23:45:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:19,326 INFO L225 Difference]: With dead ends: 160940 [2019-12-26 23:45:19,326 INFO L226 Difference]: Without dead ends: 160940 [2019-12-26 23:45:19,327 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:23,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-26 23:45:26,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-26 23:45:26,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-26 23:45:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-26 23:45:26,613 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-26 23:45:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:26,613 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-26 23:45:26,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-26 23:45:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:45:26,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:26,634 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:26,634 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:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:26,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1406595818, now seen corresponding path program 1 times [2019-12-26 23:45:26,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:26,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586659019] [2019-12-26 23:45:26,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:26,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586659019] [2019-12-26 23:45:26,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:26,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:26,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796006237] [2019-12-26 23:45:26,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:26,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:26,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:26,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:26,705 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-26 23:45:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:29,010 INFO L93 Difference]: Finished difference Result 255238 states and 1058186 transitions. [2019-12-26 23:45:29,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:45:29,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 23:45:29,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:29,408 INFO L225 Difference]: With dead ends: 255238 [2019-12-26 23:45:29,408 INFO L226 Difference]: Without dead ends: 128270 [2019-12-26 23:45:29,409 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:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128270 states. [2019-12-26 23:45:41,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128270 to 128270. [2019-12-26 23:45:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128270 states. [2019-12-26 23:45:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128270 states to 128270 states and 523459 transitions. [2019-12-26 23:45:42,261 INFO L78 Accepts]: Start accepts. Automaton has 128270 states and 523459 transitions. Word has length 19 [2019-12-26 23:45:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:42,261 INFO L462 AbstractCegarLoop]: Abstraction has 128270 states and 523459 transitions. [2019-12-26 23:45:42,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 128270 states and 523459 transitions. [2019-12-26 23:45:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:45:42,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:42,275 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:42,275 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:42,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:42,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2069277611, now seen corresponding path program 1 times [2019-12-26 23:45:42,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:42,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775741391] [2019-12-26 23:45:42,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:42,366 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:42,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775741391] [2019-12-26 23:45:42,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:42,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:42,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249931980] [2019-12-26 23:45:42,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:42,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:42,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:42,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:42,369 INFO L87 Difference]: Start difference. First operand 128270 states and 523459 transitions. Second operand 4 states. [2019-12-26 23:45:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:43,486 INFO L93 Difference]: Finished difference Result 36423 states and 125388 transitions. [2019-12-26 23:45:43,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:45:43,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 23:45:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:43,539 INFO L225 Difference]: With dead ends: 36423 [2019-12-26 23:45:43,539 INFO L226 Difference]: Without dead ends: 28545 [2019-12-26 23:45:43,539 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:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28545 states. [2019-12-26 23:45:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28545 to 28545. [2019-12-26 23:45:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28545 states. [2019-12-26 23:45:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28545 states to 28545 states and 94430 transitions. [2019-12-26 23:45:44,014 INFO L78 Accepts]: Start accepts. Automaton has 28545 states and 94430 transitions. Word has length 19 [2019-12-26 23:45:44,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:44,015 INFO L462 AbstractCegarLoop]: Abstraction has 28545 states and 94430 transitions. [2019-12-26 23:45:44,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 28545 states and 94430 transitions. [2019-12-26 23:45:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:45:44,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:44,020 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:44,020 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:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:44,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-26 23:45:44,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:44,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378927671] [2019-12-26 23:45:44,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:44,081 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:44,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378927671] [2019-12-26 23:45:44,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:44,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:44,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277859581] [2019-12-26 23:45:44,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:44,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:44,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:44,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:44,083 INFO L87 Difference]: Start difference. First operand 28545 states and 94430 transitions. Second operand 5 states. [2019-12-26 23:45:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:44,508 INFO L93 Difference]: Finished difference Result 37265 states and 121195 transitions. [2019-12-26 23:45:44,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:45:44,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 23:45:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:44,568 INFO L225 Difference]: With dead ends: 37265 [2019-12-26 23:45:44,569 INFO L226 Difference]: Without dead ends: 36963 [2019-12-26 23:45:44,569 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:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36963 states. [2019-12-26 23:45:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36963 to 29525. [2019-12-26 23:45:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29525 states. [2019-12-26 23:45:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29525 states to 29525 states and 97651 transitions. [2019-12-26 23:45:47,469 INFO L78 Accepts]: Start accepts. Automaton has 29525 states and 97651 transitions. Word has length 22 [2019-12-26 23:45:47,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:47,469 INFO L462 AbstractCegarLoop]: Abstraction has 29525 states and 97651 transitions. [2019-12-26 23:45:47,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 29525 states and 97651 transitions. [2019-12-26 23:45:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:45:47,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:47,476 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:47,476 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:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:47,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-26 23:45:47,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:47,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827168450] [2019-12-26 23:45:47,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:47,531 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,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827168450] [2019-12-26 23:45:47,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:47,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:47,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051482605] [2019-12-26 23:45:47,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:47,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:47,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:47,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:47,533 INFO L87 Difference]: Start difference. First operand 29525 states and 97651 transitions. Second operand 5 states. [2019-12-26 23:45:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:47,940 INFO L93 Difference]: Finished difference Result 37362 states and 121787 transitions. [2019-12-26 23:45:47,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:45:47,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 23:45:47,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:48,001 INFO L225 Difference]: With dead ends: 37362 [2019-12-26 23:45:48,001 INFO L226 Difference]: Without dead ends: 36942 [2019-12-26 23:45:48,002 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:48,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36942 states. [2019-12-26 23:45:48,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36942 to 28461. [2019-12-26 23:45:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-26 23:45:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 94342 transitions. [2019-12-26 23:45:48,535 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 94342 transitions. Word has length 22 [2019-12-26 23:45:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:48,536 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 94342 transitions. [2019-12-26 23:45:48,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 94342 transitions. [2019-12-26 23:45:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:45:48,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:48,544 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:48,544 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:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:48,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-26 23:45:48,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:48,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685792954] [2019-12-26 23:45:48,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:48,610 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,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685792954] [2019-12-26 23:45:48,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:48,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:48,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433486483] [2019-12-26 23:45:48,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:48,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:48,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:48,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:48,612 INFO L87 Difference]: Start difference. First operand 28461 states and 94342 transitions. Second operand 5 states. [2019-12-26 23:45:48,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:48,944 INFO L93 Difference]: Finished difference Result 28874 states and 95112 transitions. [2019-12-26 23:45:48,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:45:48,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-26 23:45:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:48,993 INFO L225 Difference]: With dead ends: 28874 [2019-12-26 23:45:48,993 INFO L226 Difference]: Without dead ends: 28434 [2019-12-26 23:45:48,994 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:49,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28434 states. [2019-12-26 23:45:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28434 to 28291. [2019-12-26 23:45:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28291 states. [2019-12-26 23:45:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28291 states to 28291 states and 93821 transitions. [2019-12-26 23:45:49,732 INFO L78 Accepts]: Start accepts. Automaton has 28291 states and 93821 transitions. Word has length 25 [2019-12-26 23:45:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:49,732 INFO L462 AbstractCegarLoop]: Abstraction has 28291 states and 93821 transitions. [2019-12-26 23:45:49,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 28291 states and 93821 transitions. [2019-12-26 23:45:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:45:49,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:49,746 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:49,746 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:49,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash -126544367, now seen corresponding path program 1 times [2019-12-26 23:45:49,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:49,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803860892] [2019-12-26 23:45:49,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:49,817 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:49,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803860892] [2019-12-26 23:45:49,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:49,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:49,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075133661] [2019-12-26 23:45:49,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:49,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:49,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:49,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:49,821 INFO L87 Difference]: Start difference. First operand 28291 states and 93821 transitions. Second operand 5 states. [2019-12-26 23:45:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:50,306 INFO L93 Difference]: Finished difference Result 37145 states and 121294 transitions. [2019-12-26 23:45:50,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:45:50,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 23:45:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:50,407 INFO L225 Difference]: With dead ends: 37145 [2019-12-26 23:45:50,408 INFO L226 Difference]: Without dead ends: 36771 [2019-12-26 23:45:50,412 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:50,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36771 states. [2019-12-26 23:45:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36771 to 29755. [2019-12-26 23:45:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29755 states. [2019-12-26 23:45:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29755 states to 29755 states and 98514 transitions. [2019-12-26 23:45:51,068 INFO L78 Accepts]: Start accepts. Automaton has 29755 states and 98514 transitions. Word has length 28 [2019-12-26 23:45:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:51,068 INFO L462 AbstractCegarLoop]: Abstraction has 29755 states and 98514 transitions. [2019-12-26 23:45:51,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 29755 states and 98514 transitions. [2019-12-26 23:45:51,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:45:51,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:51,081 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:51,081 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:51,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:51,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1319845053, now seen corresponding path program 1 times [2019-12-26 23:45:51,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:51,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534773041] [2019-12-26 23:45:51,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:51,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534773041] [2019-12-26 23:45:51,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:51,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:51,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745397663] [2019-12-26 23:45:51,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:51,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:51,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:51,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:51,116 INFO L87 Difference]: Start difference. First operand 29755 states and 98514 transitions. Second operand 3 states. [2019-12-26 23:45:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:51,326 INFO L93 Difference]: Finished difference Result 38320 states and 126138 transitions. [2019-12-26 23:45:51,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:51,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-26 23:45:51,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:51,434 INFO L225 Difference]: With dead ends: 38320 [2019-12-26 23:45:51,434 INFO L226 Difference]: Without dead ends: 38320 [2019-12-26 23:45:51,435 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:51,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38320 states. [2019-12-26 23:45:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38320 to 30661. [2019-12-26 23:45:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30661 states. [2019-12-26 23:45:52,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30661 states to 30661 states and 100227 transitions. [2019-12-26 23:45:52,418 INFO L78 Accepts]: Start accepts. Automaton has 30661 states and 100227 transitions. Word has length 28 [2019-12-26 23:45:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:52,418 INFO L462 AbstractCegarLoop]: Abstraction has 30661 states and 100227 transitions. [2019-12-26 23:45:52,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 30661 states and 100227 transitions. [2019-12-26 23:45:52,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 23:45:52,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:52,435 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:52,435 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:52,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:52,435 INFO L82 PathProgramCache]: Analyzing trace with hash 234862090, now seen corresponding path program 1 times [2019-12-26 23:45:52,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:52,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535622115] [2019-12-26 23:45:52,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:52,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535622115] [2019-12-26 23:45:52,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:52,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:52,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274409073] [2019-12-26 23:45:52,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:52,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:52,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:52,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:52,507 INFO L87 Difference]: Start difference. First operand 30661 states and 100227 transitions. Second operand 5 states. [2019-12-26 23:45:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:52,916 INFO L93 Difference]: Finished difference Result 39205 states and 126499 transitions. [2019-12-26 23:45:52,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:45:52,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-26 23:45:52,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:52,986 INFO L225 Difference]: With dead ends: 39205 [2019-12-26 23:45:52,986 INFO L226 Difference]: Without dead ends: 38811 [2019-12-26 23:45:52,987 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,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38811 states. [2019-12-26 23:45:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38811 to 30894. [2019-12-26 23:45:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30894 states. [2019-12-26 23:45:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30894 states to 30894 states and 100767 transitions. [2019-12-26 23:45:53,576 INFO L78 Accepts]: Start accepts. Automaton has 30894 states and 100767 transitions. Word has length 29 [2019-12-26 23:45:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:53,576 INFO L462 AbstractCegarLoop]: Abstraction has 30894 states and 100767 transitions. [2019-12-26 23:45:53,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 30894 states and 100767 transitions. [2019-12-26 23:45:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 23:45:53,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:53,590 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:53,590 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:53,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:53,591 INFO L82 PathProgramCache]: Analyzing trace with hash 805904020, now seen corresponding path program 1 times [2019-12-26 23:45:53,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:53,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404712318] [2019-12-26 23:45:53,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:53,632 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,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404712318] [2019-12-26 23:45:53,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:53,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:53,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271723631] [2019-12-26 23:45:53,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:53,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:53,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:53,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:53,634 INFO L87 Difference]: Start difference. First operand 30894 states and 100767 transitions. Second operand 3 states. [2019-12-26 23:45:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:54,038 INFO L93 Difference]: Finished difference Result 49254 states and 162311 transitions. [2019-12-26 23:45:54,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:54,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-26 23:45:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:54,074 INFO L225 Difference]: With dead ends: 49254 [2019-12-26 23:45:54,074 INFO L226 Difference]: Without dead ends: 21429 [2019-12-26 23:45:54,075 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:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21429 states. [2019-12-26 23:45:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21429 to 20333. [2019-12-26 23:45:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20333 states. [2019-12-26 23:45:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20333 states to 20333 states and 67715 transitions. [2019-12-26 23:45:54,452 INFO L78 Accepts]: Start accepts. Automaton has 20333 states and 67715 transitions. Word has length 29 [2019-12-26 23:45:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:54,452 INFO L462 AbstractCegarLoop]: Abstraction has 20333 states and 67715 transitions. [2019-12-26 23:45:54,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 20333 states and 67715 transitions. [2019-12-26 23:45:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 23:45:54,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:54,462 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:54,462 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:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:54,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1673459084, now seen corresponding path program 1 times [2019-12-26 23:45:54,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:54,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993159699] [2019-12-26 23:45:54,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:54,529 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:54,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993159699] [2019-12-26 23:45:54,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:54,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:45:54,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314830528] [2019-12-26 23:45:54,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:54,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:54,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:54,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:54,531 INFO L87 Difference]: Start difference. First operand 20333 states and 67715 transitions. Second operand 5 states. [2019-12-26 23:45:55,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:55,089 INFO L93 Difference]: Finished difference Result 34767 states and 112990 transitions. [2019-12-26 23:45:55,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:45:55,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-26 23:45:55,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:55,148 INFO L225 Difference]: With dead ends: 34767 [2019-12-26 23:45:55,148 INFO L226 Difference]: Without dead ends: 34767 [2019-12-26 23:45:55,149 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:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34767 states. [2019-12-26 23:45:55,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34767 to 29090. [2019-12-26 23:45:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29090 states. [2019-12-26 23:45:55,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29090 states to 29090 states and 95089 transitions. [2019-12-26 23:45:55,694 INFO L78 Accepts]: Start accepts. Automaton has 29090 states and 95089 transitions. Word has length 30 [2019-12-26 23:45:55,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:55,695 INFO L462 AbstractCegarLoop]: Abstraction has 29090 states and 95089 transitions. [2019-12-26 23:45:55,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:55,695 INFO L276 IsEmpty]: Start isEmpty. Operand 29090 states and 95089 transitions. [2019-12-26 23:45:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 23:45:55,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:55,709 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:45:55,709 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:45:55,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:55,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1413309470, now seen corresponding path program 1 times [2019-12-26 23:45:55,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:55,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087181811] [2019-12-26 23:45:55,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:55,785 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,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087181811] [2019-12-26 23:45:55,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:55,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:45:55,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037481934] [2019-12-26 23:45:55,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:55,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:55,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:55,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:55,787 INFO L87 Difference]: Start difference. First operand 29090 states and 95089 transitions. Second operand 5 states. [2019-12-26 23:45:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:55,882 INFO L93 Difference]: Finished difference Result 13178 states and 39760 transitions. [2019-12-26 23:45:55,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:45:55,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-26 23:45:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:55,898 INFO L225 Difference]: With dead ends: 13178 [2019-12-26 23:45:55,898 INFO L226 Difference]: Without dead ends: 11110 [2019-12-26 23:45:55,899 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:45:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-12-26 23:45:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 10943. [2019-12-26 23:45:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10943 states. [2019-12-26 23:45:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10943 states to 10943 states and 32777 transitions. [2019-12-26 23:45:56,220 INFO L78 Accepts]: Start accepts. Automaton has 10943 states and 32777 transitions. Word has length 31 [2019-12-26 23:45:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:56,220 INFO L462 AbstractCegarLoop]: Abstraction has 10943 states and 32777 transitions. [2019-12-26 23:45:56,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 10943 states and 32777 transitions. [2019-12-26 23:45:56,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:45:56,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:56,232 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:45:56,232 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:45:56,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:56,232 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-26 23:45:56,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:56,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434815018] [2019-12-26 23:45:56,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:56,305 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,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434815018] [2019-12-26 23:45:56,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:56,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:45:56,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841966965] [2019-12-26 23:45:56,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:56,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:56,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:56,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:56,307 INFO L87 Difference]: Start difference. First operand 10943 states and 32777 transitions. Second operand 6 states. [2019-12-26 23:45:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:56,579 INFO L93 Difference]: Finished difference Result 11069 states and 33011 transitions. [2019-12-26 23:45:56,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:45:56,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 23:45:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:56,607 INFO L225 Difference]: With dead ends: 11069 [2019-12-26 23:45:56,607 INFO L226 Difference]: Without dead ends: 10842 [2019-12-26 23:45:56,608 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:45:56,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-12-26 23:45:56,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 10842. [2019-12-26 23:45:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10842 states. [2019-12-26 23:45:56,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10842 states to 10842 states and 32566 transitions. [2019-12-26 23:45:56,929 INFO L78 Accepts]: Start accepts. Automaton has 10842 states and 32566 transitions. Word has length 40 [2019-12-26 23:45:56,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:56,930 INFO L462 AbstractCegarLoop]: Abstraction has 10842 states and 32566 transitions. [2019-12-26 23:45:56,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:56,930 INFO L276 IsEmpty]: Start isEmpty. Operand 10842 states and 32566 transitions. [2019-12-26 23:45:56,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:45:56,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:56,953 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:45:56,953 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:45:56,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:56,954 INFO L82 PathProgramCache]: Analyzing trace with hash -891252526, now seen corresponding path program 1 times [2019-12-26 23:45:56,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:56,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988152385] [2019-12-26 23:45:56,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:57,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:45:57,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988152385] [2019-12-26 23:45:57,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:57,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:45:57,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859052909] [2019-12-26 23:45:57,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:57,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:57,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:57,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:57,076 INFO L87 Difference]: Start difference. First operand 10842 states and 32566 transitions. Second operand 6 states. [2019-12-26 23:45:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:57,878 INFO L93 Difference]: Finished difference Result 20964 states and 62804 transitions. [2019-12-26 23:45:57,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:45:57,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 23:45:57,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:57,917 INFO L225 Difference]: With dead ends: 20964 [2019-12-26 23:45:57,917 INFO L226 Difference]: Without dead ends: 20964 [2019-12-26 23:45:57,918 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:45:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20964 states. [2019-12-26 23:45:58,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20964 to 13761. [2019-12-26 23:45:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2019-12-26 23:45:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 41473 transitions. [2019-12-26 23:45:58,170 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 41473 transitions. Word has length 40 [2019-12-26 23:45:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:58,170 INFO L462 AbstractCegarLoop]: Abstraction has 13761 states and 41473 transitions. [2019-12-26 23:45:58,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 41473 transitions. [2019-12-26 23:45:58,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:45:58,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:58,189 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:45:58,189 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:45:58,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:58,190 INFO L82 PathProgramCache]: Analyzing trace with hash 820794198, now seen corresponding path program 2 times [2019-12-26 23:45:58,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:58,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436359710] [2019-12-26 23:45:58,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:58,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436359710] [2019-12-26 23:45:58,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:58,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:58,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538359454] [2019-12-26 23:45:58,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:58,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:58,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:58,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:58,240 INFO L87 Difference]: Start difference. First operand 13761 states and 41473 transitions. Second operand 3 states. [2019-12-26 23:45:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:58,284 INFO L93 Difference]: Finished difference Result 10124 states and 29791 transitions. [2019-12-26 23:45:58,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:58,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 23:45:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:58,300 INFO L225 Difference]: With dead ends: 10124 [2019-12-26 23:45:58,301 INFO L226 Difference]: Without dead ends: 10124 [2019-12-26 23:45:58,301 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:45:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10124 states. [2019-12-26 23:45:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10124 to 10086. [2019-12-26 23:45:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10086 states. [2019-12-26 23:45:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10086 states to 10086 states and 29686 transitions. [2019-12-26 23:45:58,443 INFO L78 Accepts]: Start accepts. Automaton has 10086 states and 29686 transitions. Word has length 40 [2019-12-26 23:45:58,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:58,443 INFO L462 AbstractCegarLoop]: Abstraction has 10086 states and 29686 transitions. [2019-12-26 23:45:58,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 10086 states and 29686 transitions. [2019-12-26 23:45:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:45:58,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:58,457 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:45:58,457 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:45:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:58,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1848652026, now seen corresponding path program 1 times [2019-12-26 23:45:58,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:58,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415669874] [2019-12-26 23:45:58,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:58,558 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,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415669874] [2019-12-26 23:45:58,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:58,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:45:58,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937267355] [2019-12-26 23:45:58,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:58,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:58,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:58,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:58,560 INFO L87 Difference]: Start difference. First operand 10086 states and 29686 transitions. Second operand 6 states. [2019-12-26 23:45:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:58,769 INFO L93 Difference]: Finished difference Result 10072 states and 29653 transitions. [2019-12-26 23:45:58,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:45:58,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 23:45:58,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:58,784 INFO L225 Difference]: With dead ends: 10072 [2019-12-26 23:45:58,784 INFO L226 Difference]: Without dead ends: 9731 [2019-12-26 23:45:58,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 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:45:58,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9731 states. [2019-12-26 23:45:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9731 to 9731. [2019-12-26 23:45:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9731 states. [2019-12-26 23:45:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9731 states to 9731 states and 28998 transitions. [2019-12-26 23:45:58,924 INFO L78 Accepts]: Start accepts. Automaton has 9731 states and 28998 transitions. Word has length 41 [2019-12-26 23:45:58,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:58,924 INFO L462 AbstractCegarLoop]: Abstraction has 9731 states and 28998 transitions. [2019-12-26 23:45:58,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 9731 states and 28998 transitions. [2019-12-26 23:45:58,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:45:58,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:58,934 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:45:58,934 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:45:58,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:58,934 INFO L82 PathProgramCache]: Analyzing trace with hash -55018944, now seen corresponding path program 1 times [2019-12-26 23:45:58,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:58,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246813654] [2019-12-26 23:45:58,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:59,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246813654] [2019-12-26 23:45:59,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:59,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:45:59,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273337906] [2019-12-26 23:45:59,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:59,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:59,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:59,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:59,049 INFO L87 Difference]: Start difference. First operand 9731 states and 28998 transitions. Second operand 6 states. [2019-12-26 23:45:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:59,828 INFO L93 Difference]: Finished difference Result 12715 states and 37116 transitions. [2019-12-26 23:45:59,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:45:59,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 23:45:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:59,845 INFO L225 Difference]: With dead ends: 12715 [2019-12-26 23:45:59,845 INFO L226 Difference]: Without dead ends: 12715 [2019-12-26 23:45:59,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:45:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12715 states. [2019-12-26 23:45:59,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12715 to 10179. [2019-12-26 23:45:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10179 states. [2019-12-26 23:46:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10179 states to 10179 states and 30296 transitions. [2019-12-26 23:46:00,004 INFO L78 Accepts]: Start accepts. Automaton has 10179 states and 30296 transitions. Word has length 41 [2019-12-26 23:46:00,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:00,004 INFO L462 AbstractCegarLoop]: Abstraction has 10179 states and 30296 transitions. [2019-12-26 23:46:00,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:46:00,004 INFO L276 IsEmpty]: Start isEmpty. Operand 10179 states and 30296 transitions. [2019-12-26 23:46:00,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:46:00,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:00,014 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:00,014 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:00,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:00,015 INFO L82 PathProgramCache]: Analyzing trace with hash -154907136, now seen corresponding path program 2 times [2019-12-26 23:46:00,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:00,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641610898] [2019-12-26 23:46:00,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:00,057 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,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641610898] [2019-12-26 23:46:00,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:00,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:46:00,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097594577] [2019-12-26 23:46:00,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:46:00,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:00,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:46:00,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:46:00,061 INFO L87 Difference]: Start difference. First operand 10179 states and 30296 transitions. Second operand 3 states. [2019-12-26 23:46:00,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:00,105 INFO L93 Difference]: Finished difference Result 10101 states and 30022 transitions. [2019-12-26 23:46:00,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:46:00,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-26 23:46:00,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:00,122 INFO L225 Difference]: With dead ends: 10101 [2019-12-26 23:46:00,123 INFO L226 Difference]: Without dead ends: 10101 [2019-12-26 23:46:00,123 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:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10101 states. [2019-12-26 23:46:00,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10101 to 8436. [2019-12-26 23:46:00,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8436 states. [2019-12-26 23:46:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 25325 transitions. [2019-12-26 23:46:00,252 INFO L78 Accepts]: Start accepts. Automaton has 8436 states and 25325 transitions. Word has length 41 [2019-12-26 23:46:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:00,252 INFO L462 AbstractCegarLoop]: Abstraction has 8436 states and 25325 transitions. [2019-12-26 23:46:00,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:46:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 8436 states and 25325 transitions. [2019-12-26 23:46:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 23:46:00,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:00,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:00,260 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:00,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:00,260 INFO L82 PathProgramCache]: Analyzing trace with hash 838446510, now seen corresponding path program 1 times [2019-12-26 23:46:00,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:00,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871804105] [2019-12-26 23:46:00,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:00,326 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,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871804105] [2019-12-26 23:46:00,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:00,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:46:00,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998710663] [2019-12-26 23:46:00,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:46:00,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:00,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:46:00,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:46:00,328 INFO L87 Difference]: Start difference. First operand 8436 states and 25325 transitions. Second operand 6 states. [2019-12-26 23:46:00,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:00,420 INFO L93 Difference]: Finished difference Result 7519 states and 23100 transitions. [2019-12-26 23:46:00,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:46:00,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-26 23:46:00,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:00,434 INFO L225 Difference]: With dead ends: 7519 [2019-12-26 23:46:00,435 INFO L226 Difference]: Without dead ends: 7420 [2019-12-26 23:46:00,435 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:00,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7420 states. [2019-12-26 23:46:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7420 to 7348. [2019-12-26 23:46:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7348 states. [2019-12-26 23:46:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7348 states to 7348 states and 22673 transitions. [2019-12-26 23:46:00,660 INFO L78 Accepts]: Start accepts. Automaton has 7348 states and 22673 transitions. Word has length 42 [2019-12-26 23:46:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:00,661 INFO L462 AbstractCegarLoop]: Abstraction has 7348 states and 22673 transitions. [2019-12-26 23:46:00,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:46:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 7348 states and 22673 transitions. [2019-12-26 23:46:00,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:00,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:00,675 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:00,675 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:00,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:00,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1033271685, now seen corresponding path program 1 times [2019-12-26 23:46:00,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:00,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052516138] [2019-12-26 23:46:00,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:00,915 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,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052516138] [2019-12-26 23:46:00,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:00,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:46:00,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234800631] [2019-12-26 23:46:00,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:46:00,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:00,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:46:00,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:46:00,917 INFO L87 Difference]: Start difference. First operand 7348 states and 22673 transitions. Second operand 11 states. [2019-12-26 23:46:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:01,774 INFO L93 Difference]: Finished difference Result 14268 states and 43135 transitions. [2019-12-26 23:46:01,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 23:46:01,775 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-26 23:46:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:01,789 INFO L225 Difference]: With dead ends: 14268 [2019-12-26 23:46:01,789 INFO L226 Difference]: Without dead ends: 9554 [2019-12-26 23:46:01,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 23:46:01,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9554 states. [2019-12-26 23:46:01,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9554 to 8656. [2019-12-26 23:46:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8656 states. [2019-12-26 23:46:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8656 states to 8656 states and 25955 transitions. [2019-12-26 23:46:01,920 INFO L78 Accepts]: Start accepts. Automaton has 8656 states and 25955 transitions. Word has length 56 [2019-12-26 23:46:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:01,921 INFO L462 AbstractCegarLoop]: Abstraction has 8656 states and 25955 transitions. [2019-12-26 23:46:01,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:46:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 8656 states and 25955 transitions. [2019-12-26 23:46:01,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:01,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:01,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:46:01,929 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:01,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:01,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1822247207, now seen corresponding path program 2 times [2019-12-26 23:46:01,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:01,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506878311] [2019-12-26 23:46:01,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:46:02,101 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,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506878311] [2019-12-26 23:46:02,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:46:02,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:46:02,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504696225] [2019-12-26 23:46:02,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:46:02,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:46:02,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:46:02,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:46:02,103 INFO L87 Difference]: Start difference. First operand 8656 states and 25955 transitions. Second operand 12 states. [2019-12-26 23:46:02,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:46:02,879 INFO L93 Difference]: Finished difference Result 9989 states and 29225 transitions. [2019-12-26 23:46:02,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 23:46:02,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-26 23:46:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:46:02,895 INFO L225 Difference]: With dead ends: 9989 [2019-12-26 23:46:02,895 INFO L226 Difference]: Without dead ends: 9138 [2019-12-26 23:46:02,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2019-12-26 23:46:02,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9138 states. [2019-12-26 23:46:03,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9138 to 8384. [2019-12-26 23:46:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8384 states. [2019-12-26 23:46:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8384 states to 8384 states and 25211 transitions. [2019-12-26 23:46:03,133 INFO L78 Accepts]: Start accepts. Automaton has 8384 states and 25211 transitions. Word has length 56 [2019-12-26 23:46:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:46:03,134 INFO L462 AbstractCegarLoop]: Abstraction has 8384 states and 25211 transitions. [2019-12-26 23:46:03,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:46:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 8384 states and 25211 transitions. [2019-12-26 23:46:03,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:46:03,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:46:03,141 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:03,141 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:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:46:03,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 3 times [2019-12-26 23:46:03,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:46:03,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039373012] [2019-12-26 23:46:03,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:46:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:46:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:46:03,263 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:46:03,264 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:46:03,267 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_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2073~0.base_30|) (= 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) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t2073~0.base_30|) 0) (= v_~x$r_buff0_thd1~0_362 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2073~0.base_30| 4)) (= 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) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2073~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2073~0.base_30|) |v_ULTIMATE.start_main_~#t2073~0.offset_22| 0))) (= 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) (= 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) (= |v_ULTIMATE.start_main_~#t2073~0.offset_22| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2073~0.base_30| 1) |v_#valid_64|))) 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, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, ULTIMATE.start_main_~#t2075~0.base=|v_ULTIMATE.start_main_~#t2075~0.base_23|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ~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, ULTIMATE.start_main_~#t2074~0.offset=|v_ULTIMATE.start_main_~#t2074~0.offset_22|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_328, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ULTIMATE.start_main_~#t2074~0.base=|v_ULTIMATE.start_main_~#t2074~0.base_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t2073~0.offset=|v_ULTIMATE.start_main_~#t2073~0.offset_22|, ~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_~#t2075~0.offset=|v_ULTIMATE.start_main_~#t2075~0.offset_14|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2073~0.base=|v_ULTIMATE.start_main_~#t2073~0.base_30|, ~y~0=v_~y~0_226, 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, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2075~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~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_~#t2075~0.offset, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2073~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2074~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2074~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_~#t2073~0.offset, ~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:03,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2074~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2074~0.base_10|) |v_ULTIMATE.start_main_~#t2074~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t2074~0.offset_9| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2074~0.base_10|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2074~0.base_10|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2074~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2074~0.base_10|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2074~0.base_10| 4) |v_#length_15|)) 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_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2074~0.offset=|v_ULTIMATE.start_main_~#t2074~0.offset_9|, ULTIMATE.start_main_~#t2074~0.base=|v_ULTIMATE.start_main_~#t2074~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2074~0.offset, ULTIMATE.start_main_~#t2074~0.base] because there is no mapped edge [2019-12-26 23:46:03,269 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:03,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2075~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2075~0.base_11|) |v_ULTIMATE.start_main_~#t2075~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2075~0.base_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2075~0.base_11| 1)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2075~0.base_11|)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2075~0.base_11| 4) |v_#length_13|) (= |v_ULTIMATE.start_main_~#t2075~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2075~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2075~0.base=|v_ULTIMATE.start_main_~#t2075~0.base_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t2075~0.offset=|v_ULTIMATE.start_main_~#t2075~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2075~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2075~0.offset] because there is no mapped edge [2019-12-26 23:46:03,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-235059484 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-235059484 256) 0))) (or (and (= ~x~0_In-235059484 |P2Thread1of1ForFork1_#t~ite32_Out-235059484|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-235059484| ~x$w_buff1~0_In-235059484) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-235059484, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-235059484, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-235059484, ~x~0=~x~0_In-235059484} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-235059484|, ~x$w_buff1~0=~x$w_buff1~0_In-235059484, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-235059484, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-235059484, ~x~0=~x~0_In-235059484} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:46:03,274 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:03,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-133437636 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-133437636 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-133437636 |P2Thread1of1ForFork1_#t~ite34_Out-133437636|)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out-133437636| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-133437636, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-133437636} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-133437636|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-133437636, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-133437636} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:46:03,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In906743401 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In906743401 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out906743401| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out906743401| ~x$w_buff0_used~0_In906743401)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In906743401, ~x$w_buff0_used~0=~x$w_buff0_used~0_In906743401} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In906743401, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out906743401|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In906743401} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 23:46:03,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-327287601 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-327287601 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-327287601 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-327287601 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-327287601| ~x$w_buff1_used~0_In-327287601)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-327287601|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-327287601, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-327287601, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-327287601, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-327287601} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-327287601, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-327287601, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-327287601, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-327287601|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-327287601} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 23:46:03,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-667919653 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-667919653 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In-667919653 ~x$r_buff0_thd2~0_Out-667919653) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-667919653)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-667919653, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-667919653} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-667919653|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-667919653, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-667919653} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:46:03,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1060068168 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1060068168 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1060068168 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1060068168 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1060068168| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite31_Out-1060068168| ~x$r_buff1_thd2~0_In-1060068168) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1060068168, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1060068168, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1060068168, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1060068168} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1060068168|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1060068168, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1060068168, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1060068168, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1060068168} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 23:46:03,278 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:03,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In395809559 256) 0))) (or (and (= ~x$w_buff0~0_In395809559 |P0Thread1of1ForFork2_#t~ite9_Out395809559|) (= |P0Thread1of1ForFork2_#t~ite8_In395809559| |P0Thread1of1ForFork2_#t~ite8_Out395809559|) (not .cse0)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In395809559 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In395809559 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In395809559 256)) (and (= (mod ~x$r_buff1_thd1~0_In395809559 256) 0) .cse1))) .cse0 (= |P0Thread1of1ForFork2_#t~ite9_Out395809559| |P0Thread1of1ForFork2_#t~ite8_Out395809559|) (= ~x$w_buff0~0_In395809559 |P0Thread1of1ForFork2_#t~ite8_Out395809559|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In395809559, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In395809559, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In395809559|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In395809559, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In395809559, ~weak$$choice2~0=~weak$$choice2~0_In395809559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In395809559} OutVars{~x$w_buff0~0=~x$w_buff0~0_In395809559, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In395809559, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out395809559|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In395809559, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out395809559|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In395809559, ~weak$$choice2~0=~weak$$choice2~0_In395809559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In395809559} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 23:46:03,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In1096185332 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1096185332 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1096185332 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In1096185332 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1096185332|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1096185332 |P2Thread1of1ForFork1_#t~ite35_Out1096185332|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1096185332, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1096185332, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1096185332, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1096185332} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1096185332|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1096185332, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1096185332, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1096185332, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1096185332} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:46:03,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1716942358 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1716942358 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-1716942358|) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In-1716942358 |P2Thread1of1ForFork1_#t~ite36_Out-1716942358|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1716942358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1716942358} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1716942358|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1716942358, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1716942358} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:46:03,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1153840019 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1153840019 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-1153840019 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1153840019 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-1153840019|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd3~0_In-1153840019 |P2Thread1of1ForFork1_#t~ite37_Out-1153840019|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1153840019, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1153840019, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1153840019, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1153840019} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1153840019|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1153840019, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1153840019, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1153840019, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1153840019} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:46:03,283 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:03,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-580617216 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite18_Out-580617216| ~x$w_buff1_used~0_In-580617216) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In-580617216| |P0Thread1of1ForFork2_#t~ite17_Out-580617216|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-580617216 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-580617216 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-580617216 256)) (and (= (mod ~x$r_buff1_thd1~0_In-580617216 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite17_Out-580617216| |P0Thread1of1ForFork2_#t~ite18_Out-580617216|) (= |P0Thread1of1ForFork2_#t~ite17_Out-580617216| ~x$w_buff1_used~0_In-580617216) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-580617216, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-580617216|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-580617216, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-580617216, ~weak$$choice2~0=~weak$$choice2~0_In-580617216, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-580617216} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-580617216, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-580617216|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-580617216|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-580617216, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-580617216, ~weak$$choice2~0=~weak$$choice2~0_In-580617216, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-580617216} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:46:03,286 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:03,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-136368294 256)))) (or (and (= ~x$r_buff1_thd1~0_In-136368294 |P0Thread1of1ForFork2_#t~ite24_Out-136368294|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In-136368294| |P0Thread1of1ForFork2_#t~ite23_Out-136368294|)) (and (= ~x$r_buff1_thd1~0_In-136368294 |P0Thread1of1ForFork2_#t~ite23_Out-136368294|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-136368294 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-136368294 256))) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-136368294 256))) (= (mod ~x$w_buff0_used~0_In-136368294 256) 0))) (= |P0Thread1of1ForFork2_#t~ite23_Out-136368294| |P0Thread1of1ForFork2_#t~ite24_Out-136368294|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-136368294, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-136368294, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-136368294, ~weak$$choice2~0=~weak$$choice2~0_In-136368294, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-136368294|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-136368294} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-136368294, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-136368294, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-136368294, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-136368294|, ~weak$$choice2~0=~weak$$choice2~0_In-136368294, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-136368294|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-136368294} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-26 23:46:03,287 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:03,288 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:03,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-618376974 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-618376974 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out-618376974| ~x$w_buff1~0_In-618376974) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-618376974| ~x~0_In-618376974)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-618376974, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-618376974, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-618376974, ~x~0=~x~0_In-618376974} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-618376974|, ~x$w_buff1~0=~x$w_buff1~0_In-618376974, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-618376974, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-618376974, ~x~0=~x~0_In-618376974} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 23:46:03,288 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:03,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In106363431 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In106363431 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out106363431| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out106363431| ~x$w_buff0_used~0_In106363431)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In106363431, ~x$w_buff0_used~0=~x$w_buff0_used~0_In106363431} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In106363431, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out106363431|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In106363431} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:46:03,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1433681103 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1433681103 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1433681103 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1433681103 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-1433681103| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1433681103| ~x$w_buff1_used~0_In-1433681103) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1433681103, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1433681103, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1433681103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1433681103} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1433681103, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1433681103, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1433681103, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1433681103|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1433681103} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:46:03,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In498442368 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In498442368 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In498442368 |ULTIMATE.start_main_#t~ite45_Out498442368|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out498442368|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In498442368, ~x$w_buff0_used~0=~x$w_buff0_used~0_In498442368} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In498442368, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out498442368|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In498442368} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:46:03,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1701623574 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1701623574 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1701623574 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1701623574 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1701623574|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-1701623574 |ULTIMATE.start_main_#t~ite46_Out-1701623574|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1701623574, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1701623574, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1701623574, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1701623574} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1701623574, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1701623574|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1701623574, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1701623574, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1701623574} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 23:46:03,291 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:03,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:46:03 BasicIcfg [2019-12-26 23:46:03,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:46:03,390 INFO L168 Benchmark]: Toolchain (without parser) took 162318.38 ms. Allocated memory was 136.8 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 99.6 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 544.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:03,390 INFO L168 Benchmark]: CDTParser took 1.52 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 23:46:03,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.72 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 154.6 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:03,392 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.71 ms. Allocated memory is still 200.8 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:03,392 INFO L168 Benchmark]: Boogie Preprocessor took 35.63 ms. Allocated memory is still 200.8 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:03,392 INFO L168 Benchmark]: RCFGBuilder took 791.53 ms. Allocated memory is still 200.8 MB. Free memory was 149.8 MB in the beginning and 103.0 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:03,393 INFO L168 Benchmark]: TraceAbstraction took 160701.68 ms. Allocated memory was 200.8 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 102.3 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 482.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:46:03,396 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.52 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.72 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 154.6 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.71 ms. Allocated memory is still 200.8 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.63 ms. Allocated memory is still 200.8 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.53 ms. Allocated memory is still 200.8 MB. Free memory was 149.8 MB in the beginning and 103.0 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 160701.68 ms. Allocated memory was 200.8 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 102.3 MB in the beginning and 2.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 482.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 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.9s, 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(&t2073, ((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(&t2074, ((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(&t2075, ((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: 160.4s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 43.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3904 SDtfs, 4871 SDslu, 9002 SDs, 0 SdLazy, 4674 SolverSat, 207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 36 SyntacticMatches, 17 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.5s 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: 96.9s AutomataMinimizationTime, 27 MinimizatonAttempts, 169781 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 826 NumberOfCodeBlocks, 826 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 743 ConstructedInterpolants, 0 QuantifiedInterpolants, 83107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...