/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/mix046_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:39:39,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:39:39,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:39:39,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:39:39,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:39:39,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:39:39,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:39:39,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:39:39,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:39:39,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:39:39,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:39:39,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:39:39,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:39:39,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:39:39,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:39:39,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:39:39,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:39:39,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:39:39,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:39:39,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:39:39,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:39:39,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:39:39,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:39:39,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:39:39,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:39:39,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:39:39,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:39:39,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:39:39,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:39:39,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:39:39,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:39:39,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:39:39,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:39:39,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:39:39,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:39:39,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:39:39,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:39:39,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:39:39,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:39:39,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:39:39,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:39:39,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:39:39,729 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:39:39,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:39:39,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:39:39,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:39:39,731 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:39:39,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:39:39,732 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:39:39,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:39:39,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:39:39,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:39:39,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:39:39,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:39:39,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:39:39,733 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:39:39,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:39:39,734 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:39:39,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:39:39,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:39:39,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:39:39,734 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:39:39,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:39:39,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:39:39,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:39:39,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:39:39,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:39:39,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:39:39,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:39:39,736 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:39:39,736 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:39:39,737 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:39:40,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:39:40,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:39:40,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:39:40,045 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:39:40,045 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:39:40,046 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_rmo.opt.i [2019-12-18 13:39:40,118 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53e980bc/2c07690a6dfc428d8b950d545185c20b/FLAGd1af6feff [2019-12-18 13:39:40,709 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:39:40,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_rmo.opt.i [2019-12-18 13:39:40,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53e980bc/2c07690a6dfc428d8b950d545185c20b/FLAGd1af6feff [2019-12-18 13:39:40,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53e980bc/2c07690a6dfc428d8b950d545185c20b [2019-12-18 13:39:40,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:39:40,948 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:39:40,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:39:40,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:39:40,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:39:40,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:39:40" (1/1) ... [2019-12-18 13:39:40,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@726d052e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:40, skipping insertion in model container [2019-12-18 13:39:40,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:39:40" (1/1) ... [2019-12-18 13:39:40,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:39:41,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:39:41,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:39:41,590 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:39:41,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:39:41,758 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:39:41,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:41 WrapperNode [2019-12-18 13:39:41,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:39:41,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:39:41,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:39:41,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:39:41,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:41" (1/1) ... [2019-12-18 13:39:41,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:41" (1/1) ... [2019-12-18 13:39:41,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:39:41,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:39:41,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:39:41,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:39:41,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:41" (1/1) ... [2019-12-18 13:39:41,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:41" (1/1) ... [2019-12-18 13:39:41,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:41" (1/1) ... [2019-12-18 13:39:41,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:41" (1/1) ... [2019-12-18 13:39:41,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:41" (1/1) ... [2019-12-18 13:39:41,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:41" (1/1) ... [2019-12-18 13:39:41,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:41" (1/1) ... [2019-12-18 13:39:41,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:39:41,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:39:41,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:39:41,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:39:41,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:39:41,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:39:41,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:39:41,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:39:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:39:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:39:41,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:39:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:39:41,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:39:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:39:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:39:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:39:41,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:39:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:39:41,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:39:41,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:39:41,953 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:39:42,739 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:39:42,740 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:39:42,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:39:42 BoogieIcfgContainer [2019-12-18 13:39:42,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:39:42,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:39:42,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:39:42,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:39:42,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:39:40" (1/3) ... [2019-12-18 13:39:42,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7322271d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:39:42, skipping insertion in model container [2019-12-18 13:39:42,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:39:41" (2/3) ... [2019-12-18 13:39:42,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7322271d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:39:42, skipping insertion in model container [2019-12-18 13:39:42,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:39:42" (3/3) ... [2019-12-18 13:39:42,750 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_rmo.opt.i [2019-12-18 13:39:42,761 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:39:42,761 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:39:42,768 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:39:42,770 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:39:42,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,808 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,808 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,811 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,812 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,812 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,812 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,836 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,837 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,837 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,837 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,837 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,837 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,838 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,838 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,838 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,840 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,840 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,840 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,840 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,841 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,841 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,841 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,841 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,841 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,842 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,842 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,842 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,842 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,842 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,843 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,843 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,843 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,843 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,848 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,848 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,851 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,851 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,855 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,855 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,858 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,858 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,860 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,861 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:39:42,875 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:39:42,894 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:39:42,894 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:39:42,895 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:39:42,895 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:39:42,895 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:39:42,895 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:39:42,895 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:39:42,895 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:39:42,913 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 13:39:42,915 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 13:39:43,006 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 13:39:43,006 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:39:43,022 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:39:43,044 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 13:39:43,092 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 13:39:43,092 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:39:43,099 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:39:43,114 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 13:39:43,115 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:39:48,301 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 13:39:48,434 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 13:39:48,463 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52490 [2019-12-18 13:39:48,463 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 13:39:48,466 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 13:39:51,596 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 37086 states. [2019-12-18 13:39:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 37086 states. [2019-12-18 13:39:51,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:39:51,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:51,607 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:39:51,608 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:51,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:51,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1862617909, now seen corresponding path program 1 times [2019-12-18 13:39:51,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:51,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800056199] [2019-12-18 13:39:51,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:51,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800056199] [2019-12-18 13:39:51,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:51,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:39:51,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385637151] [2019-12-18 13:39:51,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:39:51,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:51,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:39:51,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:51,962 INFO L87 Difference]: Start difference. First operand 37086 states. Second operand 3 states. [2019-12-18 13:39:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:52,513 INFO L93 Difference]: Finished difference Result 36830 states and 157144 transitions. [2019-12-18 13:39:52,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:39:52,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:39:52,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:53,070 INFO L225 Difference]: With dead ends: 36830 [2019-12-18 13:39:53,070 INFO L226 Difference]: Without dead ends: 36102 [2019-12-18 13:39:53,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-18 13:39:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-18 13:39:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-18 13:39:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 154176 transitions. [2019-12-18 13:39:54,737 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 154176 transitions. Word has length 9 [2019-12-18 13:39:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:54,738 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 154176 transitions. [2019-12-18 13:39:54,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:39:54,739 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 154176 transitions. [2019-12-18 13:39:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:39:56,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:56,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:39:56,219 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:56,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:56,219 INFO L82 PathProgramCache]: Analyzing trace with hash 290643941, now seen corresponding path program 1 times [2019-12-18 13:39:56,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:56,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044770032] [2019-12-18 13:39:56,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:56,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044770032] [2019-12-18 13:39:56,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:56,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:39:56,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727817179] [2019-12-18 13:39:56,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:39:56,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:56,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:39:56,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:39:56,358 INFO L87 Difference]: Start difference. First operand 36102 states and 154176 transitions. Second operand 4 states. [2019-12-18 13:39:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:39:56,954 INFO L93 Difference]: Finished difference Result 56134 states and 231868 transitions. [2019-12-18 13:39:56,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:39:56,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:39:56,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:39:57,346 INFO L225 Difference]: With dead ends: 56134 [2019-12-18 13:39:57,347 INFO L226 Difference]: Without dead ends: 56106 [2019-12-18 13:39:57,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:39:57,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-18 13:39:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 51222. [2019-12-18 13:39:59,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51222 states. [2019-12-18 13:39:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51222 states to 51222 states and 213628 transitions. [2019-12-18 13:39:59,847 INFO L78 Accepts]: Start accepts. Automaton has 51222 states and 213628 transitions. Word has length 15 [2019-12-18 13:39:59,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:39:59,848 INFO L462 AbstractCegarLoop]: Abstraction has 51222 states and 213628 transitions. [2019-12-18 13:39:59,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:39:59,848 INFO L276 IsEmpty]: Start isEmpty. Operand 51222 states and 213628 transitions. [2019-12-18 13:39:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:39:59,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:39:59,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:39:59,854 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:39:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:39:59,854 INFO L82 PathProgramCache]: Analyzing trace with hash -497322091, now seen corresponding path program 1 times [2019-12-18 13:39:59,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:39:59,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187301831] [2019-12-18 13:39:59,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:39:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:39:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:39:59,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187301831] [2019-12-18 13:39:59,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:39:59,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:39:59,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276672598] [2019-12-18 13:39:59,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:39:59,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:39:59,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:39:59,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:39:59,907 INFO L87 Difference]: Start difference. First operand 51222 states and 213628 transitions. Second operand 3 states. [2019-12-18 13:40:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:00,547 INFO L93 Difference]: Finished difference Result 40168 states and 154828 transitions. [2019-12-18 13:40:00,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:00,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 13:40:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:00,681 INFO L225 Difference]: With dead ends: 40168 [2019-12-18 13:40:00,681 INFO L226 Difference]: Without dead ends: 40168 [2019-12-18 13:40:00,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:00,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40168 states. [2019-12-18 13:40:02,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40168 to 40168. [2019-12-18 13:40:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40168 states. [2019-12-18 13:40:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40168 states to 40168 states and 154828 transitions. [2019-12-18 13:40:02,157 INFO L78 Accepts]: Start accepts. Automaton has 40168 states and 154828 transitions. Word has length 15 [2019-12-18 13:40:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:02,157 INFO L462 AbstractCegarLoop]: Abstraction has 40168 states and 154828 transitions. [2019-12-18 13:40:02,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:02,158 INFO L276 IsEmpty]: Start isEmpty. Operand 40168 states and 154828 transitions. [2019-12-18 13:40:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:40:02,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:02,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:02,160 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:02,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:02,160 INFO L82 PathProgramCache]: Analyzing trace with hash -13987850, now seen corresponding path program 1 times [2019-12-18 13:40:02,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:02,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541941512] [2019-12-18 13:40:02,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:02,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541941512] [2019-12-18 13:40:02,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:02,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:40:02,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718589677] [2019-12-18 13:40:02,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:40:02,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:02,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:40:02,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:40:02,256 INFO L87 Difference]: Start difference. First operand 40168 states and 154828 transitions. Second operand 4 states. [2019-12-18 13:40:02,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:02,331 INFO L93 Difference]: Finished difference Result 16680 states and 53353 transitions. [2019-12-18 13:40:02,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:40:02,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:40:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:02,370 INFO L225 Difference]: With dead ends: 16680 [2019-12-18 13:40:02,370 INFO L226 Difference]: Without dead ends: 16680 [2019-12-18 13:40:02,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:40:02,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16680 states. [2019-12-18 13:40:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16680 to 16680. [2019-12-18 13:40:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16680 states. [2019-12-18 13:40:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 53353 transitions. [2019-12-18 13:40:03,154 INFO L78 Accepts]: Start accepts. Automaton has 16680 states and 53353 transitions. Word has length 16 [2019-12-18 13:40:03,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:03,155 INFO L462 AbstractCegarLoop]: Abstraction has 16680 states and 53353 transitions. [2019-12-18 13:40:03,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:40:03,155 INFO L276 IsEmpty]: Start isEmpty. Operand 16680 states and 53353 transitions. [2019-12-18 13:40:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 13:40:03,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:03,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:03,161 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:03,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:03,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1397943155, now seen corresponding path program 1 times [2019-12-18 13:40:03,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:03,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113826290] [2019-12-18 13:40:03,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:03,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113826290] [2019-12-18 13:40:03,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:03,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:40:03,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014280399] [2019-12-18 13:40:03,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:40:03,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:03,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:40:03,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:40:03,267 INFO L87 Difference]: Start difference. First operand 16680 states and 53353 transitions. Second operand 5 states. [2019-12-18 13:40:03,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:03,313 INFO L93 Difference]: Finished difference Result 2823 states and 7312 transitions. [2019-12-18 13:40:03,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:40:03,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 13:40:03,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:03,319 INFO L225 Difference]: With dead ends: 2823 [2019-12-18 13:40:03,319 INFO L226 Difference]: Without dead ends: 2823 [2019-12-18 13:40:03,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:40:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-18 13:40:03,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2019-12-18 13:40:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-12-18 13:40:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 7312 transitions. [2019-12-18 13:40:03,372 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 7312 transitions. Word has length 17 [2019-12-18 13:40:03,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:03,372 INFO L462 AbstractCegarLoop]: Abstraction has 2823 states and 7312 transitions. [2019-12-18 13:40:03,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:40:03,373 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 7312 transitions. [2019-12-18 13:40:03,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 13:40:03,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:03,377 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-18 13:40:03,378 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:03,378 INFO L82 PathProgramCache]: Analyzing trace with hash 34035109, now seen corresponding path program 1 times [2019-12-18 13:40:03,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:03,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485938740] [2019-12-18 13:40:03,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:03,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485938740] [2019-12-18 13:40:03,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:03,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:40:03,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896747252] [2019-12-18 13:40:03,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:40:03,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:03,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:40:03,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:03,487 INFO L87 Difference]: Start difference. First operand 2823 states and 7312 transitions. Second operand 6 states. [2019-12-18 13:40:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:03,542 INFO L93 Difference]: Finished difference Result 1357 states and 3889 transitions. [2019-12-18 13:40:03,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:40:03,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 13:40:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:03,545 INFO L225 Difference]: With dead ends: 1357 [2019-12-18 13:40:03,545 INFO L226 Difference]: Without dead ends: 1357 [2019-12-18 13:40:03,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:03,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-18 13:40:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-18 13:40:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-18 13:40:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3489 transitions. [2019-12-18 13:40:03,566 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3489 transitions. Word has length 29 [2019-12-18 13:40:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:03,567 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3489 transitions. [2019-12-18 13:40:03,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:40:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3489 transitions. [2019-12-18 13:40:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:40:03,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:03,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:03,572 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:03,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:03,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2028178460, now seen corresponding path program 1 times [2019-12-18 13:40:03,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:03,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359810553] [2019-12-18 13:40:03,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:03,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359810553] [2019-12-18 13:40:03,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:03,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:40:03,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489982091] [2019-12-18 13:40:03,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:03,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:03,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:03,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:03,715 INFO L87 Difference]: Start difference. First operand 1217 states and 3489 transitions. Second operand 3 states. [2019-12-18 13:40:03,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:03,769 INFO L93 Difference]: Finished difference Result 1228 states and 3505 transitions. [2019-12-18 13:40:03,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:03,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:40:03,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:03,773 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 13:40:03,773 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 13:40:03,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:03,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 13:40:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-18 13:40:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-18 13:40:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3498 transitions. [2019-12-18 13:40:03,795 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3498 transitions. Word has length 58 [2019-12-18 13:40:03,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:03,797 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3498 transitions. [2019-12-18 13:40:03,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:03,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3498 transitions. [2019-12-18 13:40:03,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:40:03,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:03,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:03,802 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:03,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:03,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1114375606, now seen corresponding path program 1 times [2019-12-18 13:40:03,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:03,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661259641] [2019-12-18 13:40:03,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:03,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661259641] [2019-12-18 13:40:03,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:03,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:40:03,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110534388] [2019-12-18 13:40:03,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:03,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:03,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:03,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:03,886 INFO L87 Difference]: Start difference. First operand 1222 states and 3498 transitions. Second operand 3 states. [2019-12-18 13:40:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:03,936 INFO L93 Difference]: Finished difference Result 1228 states and 3497 transitions. [2019-12-18 13:40:03,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:03,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:40:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:03,940 INFO L225 Difference]: With dead ends: 1228 [2019-12-18 13:40:03,940 INFO L226 Difference]: Without dead ends: 1228 [2019-12-18 13:40:03,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:03,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-18 13:40:03,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1223. [2019-12-18 13:40:03,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-18 13:40:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3492 transitions. [2019-12-18 13:40:03,958 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3492 transitions. Word has length 58 [2019-12-18 13:40:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:03,961 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3492 transitions. [2019-12-18 13:40:03,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3492 transitions. [2019-12-18 13:40:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:40:03,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:03,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:03,966 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:03,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:03,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1114895507, now seen corresponding path program 1 times [2019-12-18 13:40:03,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:03,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747535216] [2019-12-18 13:40:03,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:04,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747535216] [2019-12-18 13:40:04,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:04,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:40:04,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097566382] [2019-12-18 13:40:04,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:40:04,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:04,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:40:04,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:40:04,117 INFO L87 Difference]: Start difference. First operand 1223 states and 3492 transitions. Second operand 5 states. [2019-12-18 13:40:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:04,327 INFO L93 Difference]: Finished difference Result 1764 states and 5014 transitions. [2019-12-18 13:40:04,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:40:04,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 13:40:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:04,330 INFO L225 Difference]: With dead ends: 1764 [2019-12-18 13:40:04,330 INFO L226 Difference]: Without dead ends: 1764 [2019-12-18 13:40:04,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-12-18 13:40:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1419. [2019-12-18 13:40:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-18 13:40:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4068 transitions. [2019-12-18 13:40:04,358 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4068 transitions. Word has length 58 [2019-12-18 13:40:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:04,358 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 4068 transitions. [2019-12-18 13:40:04,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:40:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4068 transitions. [2019-12-18 13:40:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:40:04,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:04,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:04,363 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:04,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:04,363 INFO L82 PathProgramCache]: Analyzing trace with hash -217131029, now seen corresponding path program 2 times [2019-12-18 13:40:04,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:04,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279105562] [2019-12-18 13:40:04,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:04,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279105562] [2019-12-18 13:40:04,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:04,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:40:04,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283750909] [2019-12-18 13:40:04,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:40:04,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:04,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:40:04,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:04,472 INFO L87 Difference]: Start difference. First operand 1419 states and 4068 transitions. Second operand 6 states. [2019-12-18 13:40:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:04,838 INFO L93 Difference]: Finished difference Result 2370 states and 6731 transitions. [2019-12-18 13:40:04,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:40:04,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 13:40:04,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:04,844 INFO L225 Difference]: With dead ends: 2370 [2019-12-18 13:40:04,844 INFO L226 Difference]: Without dead ends: 2370 [2019-12-18 13:40:04,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-18 13:40:04,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2370 states. [2019-12-18 13:40:04,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2370 to 1503. [2019-12-18 13:40:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-12-18 13:40:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 4316 transitions. [2019-12-18 13:40:04,878 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 4316 transitions. Word has length 58 [2019-12-18 13:40:04,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:04,879 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 4316 transitions. [2019-12-18 13:40:04,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:40:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 4316 transitions. [2019-12-18 13:40:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:40:04,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:04,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:04,883 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:04,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:04,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1417485459, now seen corresponding path program 3 times [2019-12-18 13:40:04,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:04,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720353578] [2019-12-18 13:40:04,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:04,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720353578] [2019-12-18 13:40:04,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:04,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:40:04,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464337255] [2019-12-18 13:40:04,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:04,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:04,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:04,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:04,997 INFO L87 Difference]: Start difference. First operand 1503 states and 4316 transitions. Second operand 3 states. [2019-12-18 13:40:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:05,053 INFO L93 Difference]: Finished difference Result 1502 states and 4314 transitions. [2019-12-18 13:40:05,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:05,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:40:05,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:05,056 INFO L225 Difference]: With dead ends: 1502 [2019-12-18 13:40:05,056 INFO L226 Difference]: Without dead ends: 1502 [2019-12-18 13:40:05,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-12-18 13:40:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1081. [2019-12-18 13:40:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2019-12-18 13:40:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 3128 transitions. [2019-12-18 13:40:05,072 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 3128 transitions. Word has length 58 [2019-12-18 13:40:05,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:05,072 INFO L462 AbstractCegarLoop]: Abstraction has 1081 states and 3128 transitions. [2019-12-18 13:40:05,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 3128 transitions. [2019-12-18 13:40:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:40:05,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:05,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:05,076 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:05,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:05,076 INFO L82 PathProgramCache]: Analyzing trace with hash 368051854, now seen corresponding path program 1 times [2019-12-18 13:40:05,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:05,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642491959] [2019-12-18 13:40:05,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:05,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642491959] [2019-12-18 13:40:05,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:05,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:40:05,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792262858] [2019-12-18 13:40:05,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:40:05,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:05,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:40:05,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:05,146 INFO L87 Difference]: Start difference. First operand 1081 states and 3128 transitions. Second operand 3 states. [2019-12-18 13:40:05,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:05,163 INFO L93 Difference]: Finished difference Result 1021 states and 2884 transitions. [2019-12-18 13:40:05,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:40:05,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 13:40:05,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:05,165 INFO L225 Difference]: With dead ends: 1021 [2019-12-18 13:40:05,165 INFO L226 Difference]: Without dead ends: 1021 [2019-12-18 13:40:05,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:40:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2019-12-18 13:40:05,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 957. [2019-12-18 13:40:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-12-18 13:40:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 2700 transitions. [2019-12-18 13:40:05,182 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 2700 transitions. Word has length 59 [2019-12-18 13:40:05,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:05,182 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 2700 transitions. [2019-12-18 13:40:05,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:40:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 2700 transitions. [2019-12-18 13:40:05,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:40:05,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:05,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:05,185 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:05,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1391147504, now seen corresponding path program 1 times [2019-12-18 13:40:05,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:05,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318566093] [2019-12-18 13:40:05,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:05,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:05,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318566093] [2019-12-18 13:40:05,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:05,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:40:05,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521375859] [2019-12-18 13:40:05,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:40:05,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:05,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:40:05,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:40:05,366 INFO L87 Difference]: Start difference. First operand 957 states and 2700 transitions. Second operand 7 states. [2019-12-18 13:40:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:05,522 INFO L93 Difference]: Finished difference Result 1852 states and 4883 transitions. [2019-12-18 13:40:05,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:40:05,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-18 13:40:05,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:05,525 INFO L225 Difference]: With dead ends: 1852 [2019-12-18 13:40:05,525 INFO L226 Difference]: Without dead ends: 1278 [2019-12-18 13:40:05,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:40:05,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2019-12-18 13:40:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 831. [2019-12-18 13:40:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-12-18 13:40:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 2276 transitions. [2019-12-18 13:40:05,543 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 2276 transitions. Word has length 60 [2019-12-18 13:40:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:05,543 INFO L462 AbstractCegarLoop]: Abstraction has 831 states and 2276 transitions. [2019-12-18 13:40:05,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:40:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 2276 transitions. [2019-12-18 13:40:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:40:05,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:05,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:05,545 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:05,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:05,546 INFO L82 PathProgramCache]: Analyzing trace with hash 709050974, now seen corresponding path program 2 times [2019-12-18 13:40:05,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:05,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148678422] [2019-12-18 13:40:05,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:05,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:05,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148678422] [2019-12-18 13:40:05,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:05,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:40:05,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477757343] [2019-12-18 13:40:05,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:40:05,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:05,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:40:05,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:40:05,707 INFO L87 Difference]: Start difference. First operand 831 states and 2276 transitions. Second operand 7 states. [2019-12-18 13:40:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:05,860 INFO L93 Difference]: Finished difference Result 1464 states and 3730 transitions. [2019-12-18 13:40:05,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:40:05,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-18 13:40:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:05,862 INFO L225 Difference]: With dead ends: 1464 [2019-12-18 13:40:05,862 INFO L226 Difference]: Without dead ends: 820 [2019-12-18 13:40:05,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:40:05,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-12-18 13:40:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 605. [2019-12-18 13:40:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 13:40:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1453 transitions. [2019-12-18 13:40:05,875 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1453 transitions. Word has length 60 [2019-12-18 13:40:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:05,875 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1453 transitions. [2019-12-18 13:40:05,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:40:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1453 transitions. [2019-12-18 13:40:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:40:05,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:05,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:05,877 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:05,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1492443498, now seen corresponding path program 3 times [2019-12-18 13:40:05,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:05,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90145971] [2019-12-18 13:40:05,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:06,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90145971] [2019-12-18 13:40:06,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:06,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:40:06,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194631145] [2019-12-18 13:40:06,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:40:06,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:06,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:40:06,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:40:06,296 INFO L87 Difference]: Start difference. First operand 605 states and 1453 transitions. Second operand 13 states. [2019-12-18 13:40:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:06,842 INFO L93 Difference]: Finished difference Result 1288 states and 3070 transitions. [2019-12-18 13:40:06,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 13:40:06,842 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 13:40:06,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:06,844 INFO L225 Difference]: With dead ends: 1288 [2019-12-18 13:40:06,844 INFO L226 Difference]: Without dead ends: 1256 [2019-12-18 13:40:06,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-18 13:40:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-12-18 13:40:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 870. [2019-12-18 13:40:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-12-18 13:40:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 2089 transitions. [2019-12-18 13:40:06,856 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 2089 transitions. Word has length 60 [2019-12-18 13:40:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:06,856 INFO L462 AbstractCegarLoop]: Abstraction has 870 states and 2089 transitions. [2019-12-18 13:40:06,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:40:06,856 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 2089 transitions. [2019-12-18 13:40:06,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:40:06,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:06,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:06,858 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:06,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:06,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1667445582, now seen corresponding path program 4 times [2019-12-18 13:40:06,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:06,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297137050] [2019-12-18 13:40:06,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:06,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297137050] [2019-12-18 13:40:06,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:06,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:40:06,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783007814] [2019-12-18 13:40:06,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:40:06,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:06,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:40:06,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:40:06,980 INFO L87 Difference]: Start difference. First operand 870 states and 2089 transitions. Second operand 6 states. [2019-12-18 13:40:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:07,053 INFO L93 Difference]: Finished difference Result 1156 states and 2681 transitions. [2019-12-18 13:40:07,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:40:07,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 13:40:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:07,054 INFO L225 Difference]: With dead ends: 1156 [2019-12-18 13:40:07,054 INFO L226 Difference]: Without dead ends: 261 [2019-12-18 13:40:07,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:40:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-18 13:40:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 237. [2019-12-18 13:40:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 13:40:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 414 transitions. [2019-12-18 13:40:07,059 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 414 transitions. Word has length 60 [2019-12-18 13:40:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:07,059 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 414 transitions. [2019-12-18 13:40:07,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:40:07,059 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 414 transitions. [2019-12-18 13:40:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:40:07,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:07,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:07,060 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:07,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:07,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1893006908, now seen corresponding path program 5 times [2019-12-18 13:40:07,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:07,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379728826] [2019-12-18 13:40:07,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:40:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:40:07,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379728826] [2019-12-18 13:40:07,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:40:07,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:40:07,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932568266] [2019-12-18 13:40:07,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:40:07,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:40:07,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:40:07,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:40:07,422 INFO L87 Difference]: Start difference. First operand 237 states and 414 transitions. Second operand 12 states. [2019-12-18 13:40:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:40:07,800 INFO L93 Difference]: Finished difference Result 395 states and 671 transitions. [2019-12-18 13:40:07,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:40:07,800 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 13:40:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:40:07,801 INFO L225 Difference]: With dead ends: 395 [2019-12-18 13:40:07,801 INFO L226 Difference]: Without dead ends: 363 [2019-12-18 13:40:07,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:40:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-18 13:40:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 345. [2019-12-18 13:40:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-18 13:40:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 599 transitions. [2019-12-18 13:40:07,806 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 599 transitions. Word has length 60 [2019-12-18 13:40:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:40:07,806 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 599 transitions. [2019-12-18 13:40:07,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:40:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 599 transitions. [2019-12-18 13:40:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:40:07,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:40:07,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:40:07,807 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:40:07,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:40:07,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1108974140, now seen corresponding path program 6 times [2019-12-18 13:40:07,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:40:07,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548400205] [2019-12-18 13:40:07,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:40:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:40:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:40:07,945 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:40:07,946 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:40:07,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_33) (= v_~z$w_buff0_used~0_862 0) (= 0 v_~z$r_buff1_thd3~0_308) (= 0 v_~z$r_buff0_thd3~0_195) (= |v_ULTIMATE.start_main_~#t1237~0.offset_16| 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1237~0.base_19| 1)) (= |v_#NULL.offset_7| 0) (= v_~x~0_30 0) (= v_~z$r_buff1_thd1~0_233 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd0~0_427 0) (= v_~b~0_102 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1237~0.base_19| 4)) (= v_~__unbuffered_cnt~0_109 0) (= 0 v_~z$flush_delayed~0_82) (= 0 v_~weak$$choice0~0_17) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1237~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1237~0.base_19|) |v_ULTIMATE.start_main_~#t1237~0.offset_16| 0)) |v_#memory_int_25|) (= v_~z$w_buff1~0_400 0) (= v_~z$r_buff0_thd2~0_88 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p3_EAX~0_243 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1237~0.base_19|)) (= v_~z$r_buff0_thd0~0_435 0) (= 0 v_~__unbuffered_p3_EBX~0_243) (= 0 v_~z$r_buff0_thd4~0_372) (= v_~y~0_50 0) (= v_~z$w_buff0~0_412 0) (= v_~weak$$choice2~0_150 0) (= 0 v_~z$r_buff1_thd4~0_281) (= v_~z~0_221 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff1_thd2~0_234 0) (= v_~z$read_delayed~0_7 0) (= 0 |v_#NULL.base_7|) (= v_~z$r_buff0_thd1~0_87 0) (= v_~z$w_buff1_used~0_620 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1237~0.base_19|) (= v_~main$tmp_guard1~0_25 0) (= v_~a~0_234 0) (= v_~main$tmp_guard0~0_24 0) (= v_~z$mem_tmp~0_23 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_234, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_44|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_101|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_38|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_120|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_57|, ULTIMATE.start_main_~#t1240~0.offset=|v_ULTIMATE.start_main_~#t1240~0.offset_17|, ~a~0=v_~a~0_234, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_435, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_33, ULTIMATE.start_main_~#t1240~0.base=|v_ULTIMATE.start_main_~#t1240~0.base_22|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_372, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_243, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_45|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_82, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_36|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_69|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_233, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_195, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_30, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_281, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_43|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_40|, ~z$w_buff1~0=v_~z$w_buff1~0_400, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_34|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_36|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_55|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_427, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_28|, ~y~0=v_~y~0_50, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_88, ULTIMATE.start_main_~#t1239~0.base=|v_ULTIMATE.start_main_~#t1239~0.base_21|, ULTIMATE.start_main_~#t1237~0.offset=|v_ULTIMATE.start_main_~#t1237~0.offset_16|, ULTIMATE.start_main_~#t1238~0.base=|v_ULTIMATE.start_main_~#t1238~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_862, ~z$w_buff0~0=v_~z$w_buff0~0_412, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_40|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_28|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_46|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_243, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_61|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_64|, ULTIMATE.start_main_~#t1238~0.offset=|v_ULTIMATE.start_main_~#t1238~0.offset_17|, ULTIMATE.start_main_~#t1237~0.base=|v_ULTIMATE.start_main_~#t1237~0.base_19|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ~b~0=v_~b~0_102, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_22|, ~z~0=v_~z~0_221, ULTIMATE.start_main_~#t1239~0.offset=|v_ULTIMATE.start_main_~#t1239~0.offset_16|, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_87} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1240~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1240~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1239~0.base, ULTIMATE.start_main_~#t1237~0.offset, ULTIMATE.start_main_~#t1238~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1238~0.offset, ULTIMATE.start_main_~#t1237~0.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ULTIMATE.start_main_~#t1239~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:40:07,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L833-1-->L835: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1238~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1238~0.base_13|) |v_ULTIMATE.start_main_~#t1238~0.offset_11| 1)) |v_#memory_int_19|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1238~0.base_13|)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1238~0.base_13| 1) |v_#valid_48|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1238~0.base_13|) (= |v_ULTIMATE.start_main_~#t1238~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1238~0.base_13|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1238~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1238~0.base=|v_ULTIMATE.start_main_~#t1238~0.base_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1238~0.offset=|v_ULTIMATE.start_main_~#t1238~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1238~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1238~0.offset] because there is no mapped edge [2019-12-18 13:40:07,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1239~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1239~0.base_12|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1239~0.base_12|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1239~0.base_12| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1239~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1239~0.base_12|) |v_ULTIMATE.start_main_~#t1239~0.offset_10| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1239~0.base_12|) (= |v_ULTIMATE.start_main_~#t1239~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1239~0.offset=|v_ULTIMATE.start_main_~#t1239~0.offset_10|, ULTIMATE.start_main_~#t1239~0.base=|v_ULTIMATE.start_main_~#t1239~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1239~0.offset, ULTIMATE.start_main_~#t1239~0.base] because there is no mapped edge [2019-12-18 13:40:07,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L837-1-->L839: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1240~0.offset_10|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1240~0.base_12|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1240~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1240~0.base_12| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1240~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1240~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1240~0.base_12|) |v_ULTIMATE.start_main_~#t1240~0.offset_10| 3)) |v_#memory_int_13|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1240~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1240~0.base=|v_ULTIMATE.start_main_~#t1240~0.base_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1240~0.offset=|v_ULTIMATE.start_main_~#t1240~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1240~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1240~0.offset] because there is no mapped edge [2019-12-18 13:40:07,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_60 v_~z$r_buff1_thd0~0_36) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= v_~z$r_buff0_thd4~0_20 v_~z$r_buff1_thd4~0_14) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_19 1) (= v_~z$r_buff0_thd3~0_17 v_~z$r_buff1_thd3~0_11)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_36, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 13:40:07,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_~b~0_77 1) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~x~0_21 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~x~0=v_~x~0_21} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, ~b~0=v_~b~0_77, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_21, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:40:07,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_12 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_35 1) (= v_~x~0_26 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_12) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_12, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~y~0=v_~y~0_35, ~x~0=v_~x~0_26, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:40:07,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-872988990 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-872988990 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out-872988990| ~z$w_buff0_used~0_In-872988990)) (and (= 0 |P3Thread1of1ForFork3_#t~ite11_Out-872988990|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-872988990, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-872988990} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-872988990, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-872988990, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-872988990|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 13:40:07,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-1488123871 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1488123871 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1488123871 |P2Thread1of1ForFork2_#t~ite3_Out-1488123871|) (not .cse1)) (and (= ~z~0_In-1488123871 |P2Thread1of1ForFork2_#t~ite3_Out-1488123871|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1488123871, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1488123871, ~z$w_buff1~0=~z$w_buff1~0_In-1488123871, ~z~0=~z~0_In-1488123871} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1488123871|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1488123871, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1488123871, ~z$w_buff1~0=~z$w_buff1~0_In-1488123871, ~z~0=~z~0_In-1488123871} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 13:40:07,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In1704152008 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1704152008 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1704152008 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1704152008 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out1704152008|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1704152008 |P3Thread1of1ForFork3_#t~ite12_Out1704152008|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1704152008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1704152008, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1704152008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1704152008} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1704152008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1704152008, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1704152008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1704152008, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1704152008|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 13:40:07,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1545447095 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1545447095 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out1545447095 ~z$r_buff0_thd4~0_In1545447095)) (and (= ~z$r_buff0_thd4~0_Out1545447095 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1545447095, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1545447095} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1545447095, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1545447095, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1545447095|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 13:40:07,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1708144852 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1708144852 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1708144852 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-1708144852 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite14_Out-1708144852| ~z$r_buff1_thd4~0_In-1708144852) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite14_Out-1708144852| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1708144852, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1708144852, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1708144852, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1708144852} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1708144852, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1708144852, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-1708144852|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1708144852, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1708144852} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 13:40:07,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_32| v_~z$r_buff1_thd4~0_45) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_31|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 13:40:07,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_16| v_~z~0_56) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_16|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_11|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_15|, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 13:40:07,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-204275954 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-204275954 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out-204275954| 0)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out-204275954| ~z$w_buff0_used~0_In-204275954) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-204275954, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-204275954} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-204275954|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-204275954, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-204275954} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:40:07,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1766402908 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1766402908 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1766402908 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-1766402908 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-1766402908|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1766402908 |P2Thread1of1ForFork2_#t~ite6_Out-1766402908|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1766402908, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1766402908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1766402908, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1766402908} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1766402908|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1766402908, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1766402908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1766402908, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1766402908} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:40:07,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In636611751 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In636611751 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out636611751| ~z$r_buff0_thd3~0_In636611751) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out636611751| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In636611751, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In636611751} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In636611751, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In636611751, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out636611751|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:40:07,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In933809350 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In933809350 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In933809350 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In933809350 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite8_Out933809350| ~z$r_buff1_thd3~0_In933809350)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite8_Out933809350| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In933809350, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In933809350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In933809350, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In933809350} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In933809350, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In933809350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In933809350, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In933809350, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out933809350|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:40:07,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_30| v_~z$r_buff1_thd3~0_74) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_30|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_29|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:40:07,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_34) (= v_~main$tmp_guard0~0_13 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_13, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_12|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 13:40:07,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1125797554 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1125797554 256) 0))) (or (and (= ~z~0_In-1125797554 |ULTIMATE.start_main_#t~ite19_Out-1125797554|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In-1125797554 |ULTIMATE.start_main_#t~ite19_Out-1125797554|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1125797554, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1125797554, ~z$w_buff1~0=~z$w_buff1~0_In-1125797554, ~z~0=~z~0_In-1125797554} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1125797554|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1125797554, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1125797554, ~z$w_buff1~0=~z$w_buff1~0_In-1125797554, ~z~0=~z~0_In-1125797554} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:40:07,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_30 |v_ULTIMATE.start_main_#t~ite19_9|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ~z~0=v_~z~0_30, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:40:07,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In435554485 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In435554485 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out435554485| 0)) (and (= |ULTIMATE.start_main_#t~ite21_Out435554485| ~z$w_buff0_used~0_In435554485) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In435554485, ~z$w_buff0_used~0=~z$w_buff0_used~0_In435554485} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In435554485, ~z$w_buff0_used~0=~z$w_buff0_used~0_In435554485, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out435554485|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:40:07,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In973721259 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In973721259 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In973721259 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In973721259 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out973721259| 0)) (and (= |ULTIMATE.start_main_#t~ite22_Out973721259| ~z$w_buff1_used~0_In973721259) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In973721259, ~z$w_buff0_used~0=~z$w_buff0_used~0_In973721259, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In973721259, ~z$w_buff1_used~0=~z$w_buff1_used~0_In973721259} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In973721259, ~z$w_buff0_used~0=~z$w_buff0_used~0_In973721259, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In973721259, ~z$w_buff1_used~0=~z$w_buff1_used~0_In973721259, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out973721259|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:40:07,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In406223760 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In406223760 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out406223760| ~z$r_buff0_thd0~0_In406223760) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out406223760| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In406223760, ~z$w_buff0_used~0=~z$w_buff0_used~0_In406223760} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In406223760, ~z$w_buff0_used~0=~z$w_buff0_used~0_In406223760, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out406223760|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:40:07,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In892904267 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In892904267 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In892904267 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In892904267 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite24_Out892904267| 0)) (and (= |ULTIMATE.start_main_#t~ite24_Out892904267| ~z$r_buff1_thd0~0_In892904267) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In892904267, ~z$w_buff0_used~0=~z$w_buff0_used~0_In892904267, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In892904267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In892904267} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In892904267, ~z$w_buff0_used~0=~z$w_buff0_used~0_In892904267, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In892904267, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out892904267|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In892904267} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 13:40:07,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In901948193 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out901948193| |ULTIMATE.start_main_#t~ite39_Out901948193|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In901948193 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In901948193 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd0~0_In901948193 256))) (and .cse0 (= (mod ~z$w_buff1_used~0_In901948193 256) 0)))) .cse1 (= ~z$w_buff1_used~0_In901948193 |ULTIMATE.start_main_#t~ite39_Out901948193|)) (and (= |ULTIMATE.start_main_#t~ite39_In901948193| |ULTIMATE.start_main_#t~ite39_Out901948193|) (= |ULTIMATE.start_main_#t~ite40_Out901948193| ~z$w_buff1_used~0_In901948193) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In901948193, ~z$w_buff0_used~0=~z$w_buff0_used~0_In901948193, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In901948193|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In901948193, ~z$w_buff1_used~0=~z$w_buff1_used~0_In901948193, ~weak$$choice2~0=~weak$$choice2~0_In901948193} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In901948193, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out901948193|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out901948193|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In901948193, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In901948193, ~z$w_buff1_used~0=~z$w_buff1_used~0_In901948193, ~weak$$choice2~0=~weak$$choice2~0_In901948193} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:40:07,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_125 v_~z$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:40:07,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L862-->L862-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-985055119 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite45_Out-985055119| ~z$r_buff1_thd0~0_In-985055119) (= |ULTIMATE.start_main_#t~ite45_Out-985055119| |ULTIMATE.start_main_#t~ite46_Out-985055119|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-985055119 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In-985055119 256) 0)) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In-985055119 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-985055119 256))))) (and (= |ULTIMATE.start_main_#t~ite46_Out-985055119| ~z$r_buff1_thd0~0_In-985055119) (= |ULTIMATE.start_main_#t~ite45_In-985055119| |ULTIMATE.start_main_#t~ite45_Out-985055119|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-985055119, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-985055119, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-985055119, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-985055119, ~weak$$choice2~0=~weak$$choice2~0_In-985055119, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-985055119|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-985055119, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-985055119, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-985055119, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-985055119, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-985055119|, ~weak$$choice2~0=~weak$$choice2~0_In-985055119, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-985055119|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:40:07,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L864-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_110) (not (= 0 (mod v_~z$flush_delayed~0_38 256))) (= 0 v_~z$flush_delayed~0_37) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_38} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~z~0=v_~z~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:40:07,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 13:40:08,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:40:08 BasicIcfg [2019-12-18 13:40:08,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:40:08,063 INFO L168 Benchmark]: Toolchain (without parser) took 27115.34 ms. Allocated memory was 139.5 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 101.1 MB in the beginning and 602.7 MB in the end (delta: -501.6 MB). Peak memory consumption was 737.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:08,064 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 13:40:08,064 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.02 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 157.4 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:08,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.70 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:08,066 INFO L168 Benchmark]: Boogie Preprocessor took 44.29 ms. Allocated memory is still 203.9 MB. Free memory was 154.2 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:08,066 INFO L168 Benchmark]: RCFGBuilder took 866.67 ms. Allocated memory is still 203.9 MB. Free memory was 151.7 MB in the beginning and 102.2 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:08,067 INFO L168 Benchmark]: TraceAbstraction took 25318.39 ms. Allocated memory was 203.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 102.2 MB in the beginning and 602.7 MB in the end (delta: -500.5 MB). Peak memory consumption was 673.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:40:08,075 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 810.02 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 157.4 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.70 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.29 ms. Allocated memory is still 203.9 MB. Free memory was 154.2 MB in the beginning and 151.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 866.67 ms. Allocated memory is still 203.9 MB. Free memory was 151.7 MB in the beginning and 102.2 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25318.39 ms. Allocated memory was 203.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 102.2 MB in the beginning and 602.7 MB in the end (delta: -500.5 MB). Peak memory consumption was 673.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 181 ProgramPointsBefore, 92 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 4988 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 145 SemBasedMoverChecksPositive, 210 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 52490 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1237, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1238, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1239, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1240, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.0s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1891 SDtfs, 1882 SDslu, 4680 SDs, 0 SdLazy, 1497 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51222occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 7822 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 810 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 733 ConstructedInterpolants, 0 QuantifiedInterpolants, 207027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...