/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/mix057_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:04:59,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:04:59,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:04:59,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:04:59,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:04:59,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:04:59,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:04:59,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:04:59,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:04:59,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:04:59,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:04:59,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:04:59,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:04:59,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:04:59,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:04:59,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:04:59,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:04:59,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:04:59,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:04:59,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:04:59,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:04:59,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:04:59,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:04:59,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:04:59,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:04:59,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:04:59,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:04:59,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:04:59,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:04:59,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:04:59,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:04:59,691 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:04:59,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:04:59,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:04:59,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:04:59,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:04:59,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:04:59,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:04:59,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:04:59,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:04:59,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:04:59,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:04:59,716 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:04:59,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:04:59,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:04:59,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:04:59,718 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:04:59,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:04:59,718 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:04:59,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:04:59,718 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:04:59,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:04:59,719 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:04:59,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:04:59,719 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:04:59,719 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:04:59,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:04:59,720 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:04:59,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:04:59,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:04:59,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:04:59,721 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:04:59,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:04:59,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:04:59,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:04:59,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:04:59,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:04:59,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:04:59,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:04:59,722 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:04:59,722 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:04:59,723 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:05:00,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:05:00,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:05:00,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:05:00,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:05:00,038 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:05:00,040 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt.i [2019-12-26 23:05:00,118 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a530e3d4b/07afda5e0b7f49d48cbb735104d0e5d3/FLAG7eda83f96 [2019-12-26 23:05:00,696 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:05:00,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.opt.i [2019-12-26 23:05:00,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a530e3d4b/07afda5e0b7f49d48cbb735104d0e5d3/FLAG7eda83f96 [2019-12-26 23:05:00,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a530e3d4b/07afda5e0b7f49d48cbb735104d0e5d3 [2019-12-26 23:05:00,950 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:05:00,952 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:05:00,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:05:00,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:05:00,957 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:05:00,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:05:00" (1/1) ... [2019-12-26 23:05:00,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6943ffe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:00, skipping insertion in model container [2019-12-26 23:05:00,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:05:00" (1/1) ... [2019-12-26 23:05:00,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:05:01,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:05:01,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:05:01,537 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:05:01,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:05:01,687 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:05:01,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:01 WrapperNode [2019-12-26 23:05:01,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:05:01,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:05:01,689 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:05:01,689 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:05:01,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:01" (1/1) ... [2019-12-26 23:05:01,722 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:01" (1/1) ... [2019-12-26 23:05:01,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:05:01,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:05:01,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:05:01,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:05:01,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:01" (1/1) ... [2019-12-26 23:05:01,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:01" (1/1) ... [2019-12-26 23:05:01,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:01" (1/1) ... [2019-12-26 23:05:01,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:01" (1/1) ... [2019-12-26 23:05:01,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:01" (1/1) ... [2019-12-26 23:05:01,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:01" (1/1) ... [2019-12-26 23:05:01,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:01" (1/1) ... [2019-12-26 23:05:01,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:05:01,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:05:01,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:05:01,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:05:01,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:05:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:05:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:05:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:05:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:05:01,874 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:05:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:05:01,874 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:05:01,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:05:01,874 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:05:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:05:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 23:05:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 23:05:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:05:01,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:05:01,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:05:01,878 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:05:02,649 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:05:02,649 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:05:02,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:05:02 BoogieIcfgContainer [2019-12-26 23:05:02,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:05:02,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:05:02,653 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:05:02,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:05:02,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:05:00" (1/3) ... [2019-12-26 23:05:02,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afc11f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:05:02, skipping insertion in model container [2019-12-26 23:05:02,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:01" (2/3) ... [2019-12-26 23:05:02,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afc11f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:05:02, skipping insertion in model container [2019-12-26 23:05:02,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:05:02" (3/3) ... [2019-12-26 23:05:02,660 INFO L109 eAbstractionObserver]: Analyzing ICFG mix057_power.opt.i [2019-12-26 23:05:02,671 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:05:02,672 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:05:02,682 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:05:02,683 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:05:02,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,747 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,748 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,749 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,749 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,754 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,754 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,768 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,768 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,768 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,768 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,769 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,769 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,769 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,781 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,782 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,787 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,803 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,806 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,806 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,806 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,808 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,811 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,812 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:02,827 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 23:05:02,849 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:05:02,849 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:05:02,849 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:05:02,849 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:05:02,849 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:05:02,850 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:05:02,850 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:05:02,850 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:05:02,868 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 206 transitions [2019-12-26 23:05:02,870 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-26 23:05:02,968 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-26 23:05:02,968 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:05:02,983 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 23:05:03,007 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-26 23:05:03,062 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-26 23:05:03,062 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:05:03,070 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 23:05:03,090 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-26 23:05:03,091 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:05:08,226 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-26 23:05:08,606 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-26 23:05:08,748 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 23:05:08,776 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56276 [2019-12-26 23:05:08,777 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-26 23:05:08,781 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 100 transitions [2019-12-26 23:05:10,776 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32878 states. [2019-12-26 23:05:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 32878 states. [2019-12-26 23:05:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 23:05:10,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:10,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:10,787 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:10,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:10,793 INFO L82 PathProgramCache]: Analyzing trace with hash -667351009, now seen corresponding path program 1 times [2019-12-26 23:05:10,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:10,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56815323] [2019-12-26 23:05:10,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:11,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56815323] [2019-12-26 23:05:11,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:11,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:05:11,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642071333] [2019-12-26 23:05:11,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:05:11,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:11,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:05:11,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:11,146 INFO L87 Difference]: Start difference. First operand 32878 states. Second operand 3 states. [2019-12-26 23:05:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:12,511 INFO L93 Difference]: Finished difference Result 32686 states and 139960 transitions. [2019-12-26 23:05:12,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:05:12,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 23:05:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:12,781 INFO L225 Difference]: With dead ends: 32686 [2019-12-26 23:05:12,781 INFO L226 Difference]: Without dead ends: 32062 [2019-12-26 23:05:12,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:13,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32062 states. [2019-12-26 23:05:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32062 to 32062. [2019-12-26 23:05:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32062 states. [2019-12-26 23:05:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32062 states to 32062 states and 137412 transitions. [2019-12-26 23:05:15,868 INFO L78 Accepts]: Start accepts. Automaton has 32062 states and 137412 transitions. Word has length 9 [2019-12-26 23:05:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:15,869 INFO L462 AbstractCegarLoop]: Abstraction has 32062 states and 137412 transitions. [2019-12-26 23:05:15,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:05:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 32062 states and 137412 transitions. [2019-12-26 23:05:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 23:05:15,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:15,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:15,885 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:15,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:15,885 INFO L82 PathProgramCache]: Analyzing trace with hash -139405083, now seen corresponding path program 1 times [2019-12-26 23:05:15,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:15,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368760545] [2019-12-26 23:05:15,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:16,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368760545] [2019-12-26 23:05:16,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:16,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:05:16,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997059410] [2019-12-26 23:05:16,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:05:16,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:16,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:05:16,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:05:16,058 INFO L87 Difference]: Start difference. First operand 32062 states and 137412 transitions. Second operand 4 states. [2019-12-26 23:05:16,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:16,620 INFO L93 Difference]: Finished difference Result 51166 states and 211740 transitions. [2019-12-26 23:05:16,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:05:16,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 23:05:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:17,287 INFO L225 Difference]: With dead ends: 51166 [2019-12-26 23:05:17,287 INFO L226 Difference]: Without dead ends: 51138 [2019-12-26 23:05:17,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:05:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51138 states. [2019-12-26 23:05:18,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51138 to 46670. [2019-12-26 23:05:18,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46670 states. [2019-12-26 23:05:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46670 states to 46670 states and 195108 transitions. [2019-12-26 23:05:19,140 INFO L78 Accepts]: Start accepts. Automaton has 46670 states and 195108 transitions. Word has length 15 [2019-12-26 23:05:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:19,140 INFO L462 AbstractCegarLoop]: Abstraction has 46670 states and 195108 transitions. [2019-12-26 23:05:19,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:05:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 46670 states and 195108 transitions. [2019-12-26 23:05:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 23:05:19,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:19,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:19,143 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:19,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:19,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2113277815, now seen corresponding path program 1 times [2019-12-26 23:05:19,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:19,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980373880] [2019-12-26 23:05:19,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:19,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980373880] [2019-12-26 23:05:19,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:19,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:05:19,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937530033] [2019-12-26 23:05:19,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:05:19,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:19,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:05:19,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:19,217 INFO L87 Difference]: Start difference. First operand 46670 states and 195108 transitions. Second operand 3 states. [2019-12-26 23:05:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:19,380 INFO L93 Difference]: Finished difference Result 36669 states and 141744 transitions. [2019-12-26 23:05:19,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:05:19,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 23:05:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:21,737 INFO L225 Difference]: With dead ends: 36669 [2019-12-26 23:05:21,739 INFO L226 Difference]: Without dead ends: 36669 [2019-12-26 23:05:21,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36669 states. [2019-12-26 23:05:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36669 to 36669. [2019-12-26 23:05:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36669 states. [2019-12-26 23:05:22,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36669 states to 36669 states and 141744 transitions. [2019-12-26 23:05:22,907 INFO L78 Accepts]: Start accepts. Automaton has 36669 states and 141744 transitions. Word has length 15 [2019-12-26 23:05:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:22,907 INFO L462 AbstractCegarLoop]: Abstraction has 36669 states and 141744 transitions. [2019-12-26 23:05:22,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:05:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand 36669 states and 141744 transitions. [2019-12-26 23:05:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:05:22,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:22,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:22,910 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:22,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:22,911 INFO L82 PathProgramCache]: Analyzing trace with hash -456655226, now seen corresponding path program 1 times [2019-12-26 23:05:22,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:22,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445233213] [2019-12-26 23:05:22,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:22,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445233213] [2019-12-26 23:05:22,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:22,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:05:22,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363083031] [2019-12-26 23:05:22,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:05:22,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:22,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:05:22,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:05:22,966 INFO L87 Difference]: Start difference. First operand 36669 states and 141744 transitions. Second operand 4 states. [2019-12-26 23:05:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:23,035 INFO L93 Difference]: Finished difference Result 15339 states and 49236 transitions. [2019-12-26 23:05:23,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:05:23,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 23:05:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:23,059 INFO L225 Difference]: With dead ends: 15339 [2019-12-26 23:05:23,059 INFO L226 Difference]: Without dead ends: 15339 [2019-12-26 23:05:23,060 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-26 23:05:23,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15339 states. [2019-12-26 23:05:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15339 to 15339. [2019-12-26 23:05:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15339 states. [2019-12-26 23:05:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15339 states to 15339 states and 49236 transitions. [2019-12-26 23:05:23,319 INFO L78 Accepts]: Start accepts. Automaton has 15339 states and 49236 transitions. Word has length 16 [2019-12-26 23:05:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:23,319 INFO L462 AbstractCegarLoop]: Abstraction has 15339 states and 49236 transitions. [2019-12-26 23:05:23,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:05:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 15339 states and 49236 transitions. [2019-12-26 23:05:23,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 23:05:23,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:23,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:23,322 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:23,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:23,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1764835742, now seen corresponding path program 1 times [2019-12-26 23:05:23,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:23,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597644515] [2019-12-26 23:05:23,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:23,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597644515] [2019-12-26 23:05:23,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:23,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:05:23,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112126819] [2019-12-26 23:05:23,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:05:23,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:23,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:05:23,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:05:23,382 INFO L87 Difference]: Start difference. First operand 15339 states and 49236 transitions. Second operand 5 states. [2019-12-26 23:05:23,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:23,419 INFO L93 Difference]: Finished difference Result 2638 states and 6819 transitions. [2019-12-26 23:05:23,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:05:23,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 23:05:23,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:23,424 INFO L225 Difference]: With dead ends: 2638 [2019-12-26 23:05:23,424 INFO L226 Difference]: Without dead ends: 2638 [2019-12-26 23:05:23,425 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-26 23:05:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2019-12-26 23:05:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2638. [2019-12-26 23:05:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2638 states. [2019-12-26 23:05:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 6819 transitions. [2019-12-26 23:05:23,467 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 6819 transitions. Word has length 17 [2019-12-26 23:05:23,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:23,467 INFO L462 AbstractCegarLoop]: Abstraction has 2638 states and 6819 transitions. [2019-12-26 23:05:23,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:05:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 6819 transitions. [2019-12-26 23:05:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 23:05:23,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:23,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:23,473 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:23,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1144833891, now seen corresponding path program 1 times [2019-12-26 23:05:23,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:23,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915552965] [2019-12-26 23:05:23,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:23,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915552965] [2019-12-26 23:05:23,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:23,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:05:23,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143059099] [2019-12-26 23:05:23,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:05:23,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:23,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:05:23,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:05:23,595 INFO L87 Difference]: Start difference. First operand 2638 states and 6819 transitions. Second operand 6 states. [2019-12-26 23:05:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:23,645 INFO L93 Difference]: Finished difference Result 1222 states and 3487 transitions. [2019-12-26 23:05:23,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:05:23,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-26 23:05:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:23,648 INFO L225 Difference]: With dead ends: 1222 [2019-12-26 23:05:23,649 INFO L226 Difference]: Without dead ends: 1222 [2019-12-26 23:05:23,649 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-26 23:05:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-26 23:05:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1110. [2019-12-26 23:05:23,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2019-12-26 23:05:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 3167 transitions. [2019-12-26 23:05:23,672 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 3167 transitions. Word has length 29 [2019-12-26 23:05:23,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:23,672 INFO L462 AbstractCegarLoop]: Abstraction has 1110 states and 3167 transitions. [2019-12-26 23:05:23,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:05:23,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 3167 transitions. [2019-12-26 23:05:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:05:23,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:23,677 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-26 23:05:23,677 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:23,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:23,678 INFO L82 PathProgramCache]: Analyzing trace with hash -275883304, now seen corresponding path program 1 times [2019-12-26 23:05:23,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:23,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448390628] [2019-12-26 23:05:23,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:23,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448390628] [2019-12-26 23:05:23,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:23,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:05:23,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812935604] [2019-12-26 23:05:23,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:05:23,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:23,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:05:23,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:23,768 INFO L87 Difference]: Start difference. First operand 1110 states and 3167 transitions. Second operand 3 states. [2019-12-26 23:05:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:23,817 INFO L93 Difference]: Finished difference Result 1120 states and 3182 transitions. [2019-12-26 23:05:23,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:05:23,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 23:05:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:23,820 INFO L225 Difference]: With dead ends: 1120 [2019-12-26 23:05:23,820 INFO L226 Difference]: Without dead ends: 1120 [2019-12-26 23:05:23,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-12-26 23:05:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1114. [2019-12-26 23:05:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-12-26 23:05:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 3175 transitions. [2019-12-26 23:05:23,838 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 3175 transitions. Word has length 58 [2019-12-26 23:05:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:23,838 INFO L462 AbstractCegarLoop]: Abstraction has 1114 states and 3175 transitions. [2019-12-26 23:05:23,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:05:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 3175 transitions. [2019-12-26 23:05:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:05:23,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:23,842 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-26 23:05:23,843 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:23,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:23,843 INFO L82 PathProgramCache]: Analyzing trace with hash -791070951, now seen corresponding path program 1 times [2019-12-26 23:05:23,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:23,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123492093] [2019-12-26 23:05:23,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:23,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123492093] [2019-12-26 23:05:23,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:23,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:05:23,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878533362] [2019-12-26 23:05:23,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:05:23,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:05:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:05:23,982 INFO L87 Difference]: Start difference. First operand 1114 states and 3175 transitions. Second operand 5 states. [2019-12-26 23:05:24,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:24,231 INFO L93 Difference]: Finished difference Result 1623 states and 4613 transitions. [2019-12-26 23:05:24,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:05:24,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-26 23:05:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:24,234 INFO L225 Difference]: With dead ends: 1623 [2019-12-26 23:05:24,234 INFO L226 Difference]: Without dead ends: 1623 [2019-12-26 23:05:24,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:05:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2019-12-26 23:05:24,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1210. [2019-12-26 23:05:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-12-26 23:05:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 3463 transitions. [2019-12-26 23:05:24,250 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 3463 transitions. Word has length 58 [2019-12-26 23:05:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:24,251 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 3463 transitions. [2019-12-26 23:05:24,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:05:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 3463 transitions. [2019-12-26 23:05:24,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:05:24,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:24,254 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-26 23:05:24,254 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:24,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:24,255 INFO L82 PathProgramCache]: Analyzing trace with hash 867176459, now seen corresponding path program 2 times [2019-12-26 23:05:24,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:24,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637834037] [2019-12-26 23:05:24,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:24,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637834037] [2019-12-26 23:05:24,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:24,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:05:24,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892398879] [2019-12-26 23:05:24,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:05:24,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:24,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:05:24,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:05:24,383 INFO L87 Difference]: Start difference. First operand 1210 states and 3463 transitions. Second operand 6 states. [2019-12-26 23:05:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:24,707 INFO L93 Difference]: Finished difference Result 1488 states and 4124 transitions. [2019-12-26 23:05:24,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:05:24,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-26 23:05:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:24,710 INFO L225 Difference]: With dead ends: 1488 [2019-12-26 23:05:24,710 INFO L226 Difference]: Without dead ends: 1488 [2019-12-26 23:05:24,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:05:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-12-26 23:05:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1266. [2019-12-26 23:05:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2019-12-26 23:05:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 3555 transitions. [2019-12-26 23:05:24,725 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 3555 transitions. Word has length 58 [2019-12-26 23:05:24,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:24,725 INFO L462 AbstractCegarLoop]: Abstraction has 1266 states and 3555 transitions. [2019-12-26 23:05:24,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:05:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 3555 transitions. [2019-12-26 23:05:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:05:24,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:24,729 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-26 23:05:24,729 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:24,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:24,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2105802411, now seen corresponding path program 3 times [2019-12-26 23:05:24,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:24,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746758812] [2019-12-26 23:05:24,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:24,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746758812] [2019-12-26 23:05:24,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:24,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:05:24,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555061566] [2019-12-26 23:05:24,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:05:24,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:24,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:05:24,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:24,868 INFO L87 Difference]: Start difference. First operand 1266 states and 3555 transitions. Second operand 3 states. [2019-12-26 23:05:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:24,922 INFO L93 Difference]: Finished difference Result 1265 states and 3553 transitions. [2019-12-26 23:05:24,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:05:24,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 23:05:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:24,925 INFO L225 Difference]: With dead ends: 1265 [2019-12-26 23:05:24,926 INFO L226 Difference]: Without dead ends: 1265 [2019-12-26 23:05:24,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-12-26 23:05:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 952. [2019-12-26 23:05:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-26 23:05:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2683 transitions. [2019-12-26 23:05:24,944 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2683 transitions. Word has length 58 [2019-12-26 23:05:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:24,944 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 2683 transitions. [2019-12-26 23:05:24,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:05:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2683 transitions. [2019-12-26 23:05:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:05:24,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:24,947 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-26 23:05:24,947 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:24,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:24,948 INFO L82 PathProgramCache]: Analyzing trace with hash 654382096, now seen corresponding path program 1 times [2019-12-26 23:05:24,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:24,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115430365] [2019-12-26 23:05:24,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:25,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115430365] [2019-12-26 23:05:25,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:25,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:05:25,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423332269] [2019-12-26 23:05:25,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:05:25,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:25,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:05:25,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:25,030 INFO L87 Difference]: Start difference. First operand 952 states and 2683 transitions. Second operand 3 states. [2019-12-26 23:05:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:25,047 INFO L93 Difference]: Finished difference Result 936 states and 2615 transitions. [2019-12-26 23:05:25,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:05:25,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 23:05:25,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:25,049 INFO L225 Difference]: With dead ends: 936 [2019-12-26 23:05:25,049 INFO L226 Difference]: Without dead ends: 936 [2019-12-26 23:05:25,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:25,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-12-26 23:05:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 936. [2019-12-26 23:05:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2019-12-26 23:05:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 2615 transitions. [2019-12-26 23:05:25,068 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 2615 transitions. Word has length 59 [2019-12-26 23:05:25,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:25,068 INFO L462 AbstractCegarLoop]: Abstraction has 936 states and 2615 transitions. [2019-12-26 23:05:25,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:05:25,069 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 2615 transitions. [2019-12-26 23:05:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 23:05:25,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:25,071 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-26 23:05:25,071 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:25,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:25,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1664209591, now seen corresponding path program 1 times [2019-12-26 23:05:25,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:25,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766626999] [2019-12-26 23:05:25,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:25,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766626999] [2019-12-26 23:05:25,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:25,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:05:25,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592463851] [2019-12-26 23:05:25,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:05:25,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:25,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:05:25,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:05:25,241 INFO L87 Difference]: Start difference. First operand 936 states and 2615 transitions. Second operand 7 states. [2019-12-26 23:05:25,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:25,377 INFO L93 Difference]: Finished difference Result 1881 states and 4958 transitions. [2019-12-26 23:05:25,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:05:25,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-26 23:05:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:25,379 INFO L225 Difference]: With dead ends: 1881 [2019-12-26 23:05:25,379 INFO L226 Difference]: Without dead ends: 1290 [2019-12-26 23:05:25,381 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-26 23:05:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-12-26 23:05:25,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 796. [2019-12-26 23:05:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-12-26 23:05:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2144 transitions. [2019-12-26 23:05:25,400 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 2144 transitions. Word has length 60 [2019-12-26 23:05:25,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:25,400 INFO L462 AbstractCegarLoop]: Abstraction has 796 states and 2144 transitions. [2019-12-26 23:05:25,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:05:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 2144 transitions. [2019-12-26 23:05:25,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 23:05:25,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:25,403 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-26 23:05:25,403 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:25,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:25,403 INFO L82 PathProgramCache]: Analyzing trace with hash -92263015, now seen corresponding path program 2 times [2019-12-26 23:05:25,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:25,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893092106] [2019-12-26 23:05:25,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:25,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893092106] [2019-12-26 23:05:25,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:25,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:05:25,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397727602] [2019-12-26 23:05:25,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:05:25,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:25,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:05:25,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:05:25,598 INFO L87 Difference]: Start difference. First operand 796 states and 2144 transitions. Second operand 6 states. [2019-12-26 23:05:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:25,674 INFO L93 Difference]: Finished difference Result 1358 states and 3386 transitions. [2019-12-26 23:05:25,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:05:25,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-26 23:05:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:25,676 INFO L225 Difference]: With dead ends: 1358 [2019-12-26 23:05:25,676 INFO L226 Difference]: Without dead ends: 737 [2019-12-26 23:05:25,676 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-26 23:05:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-12-26 23:05:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 575. [2019-12-26 23:05:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-26 23:05:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1356 transitions. [2019-12-26 23:05:25,685 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1356 transitions. Word has length 60 [2019-12-26 23:05:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:25,685 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1356 transitions. [2019-12-26 23:05:25,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:05:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1356 transitions. [2019-12-26 23:05:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 23:05:25,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:25,687 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-26 23:05:25,687 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:25,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:25,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1752143333, now seen corresponding path program 3 times [2019-12-26 23:05:25,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:25,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364708552] [2019-12-26 23:05:25,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:25,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364708552] [2019-12-26 23:05:25,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:25,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:05:25,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192122924] [2019-12-26 23:05:25,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:05:25,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:25,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:05:25,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:05:25,834 INFO L87 Difference]: Start difference. First operand 575 states and 1356 transitions. Second operand 6 states. [2019-12-26 23:05:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:25,905 INFO L93 Difference]: Finished difference Result 930 states and 2158 transitions. [2019-12-26 23:05:25,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:05:25,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-26 23:05:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:25,907 INFO L225 Difference]: With dead ends: 930 [2019-12-26 23:05:25,907 INFO L226 Difference]: Without dead ends: 245 [2019-12-26 23:05:25,907 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-26 23:05:25,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-12-26 23:05:25,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 213. [2019-12-26 23:05:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-26 23:05:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 368 transitions. [2019-12-26 23:05:25,910 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 368 transitions. Word has length 60 [2019-12-26 23:05:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:25,911 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 368 transitions. [2019-12-26 23:05:25,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:05:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 368 transitions. [2019-12-26 23:05:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 23:05:25,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:25,912 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-26 23:05:25,912 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:25,912 INFO L82 PathProgramCache]: Analyzing trace with hash -524819563, now seen corresponding path program 4 times [2019-12-26 23:05:25,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:25,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929115761] [2019-12-26 23:05:25,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:05:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:05:26,069 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:05:26,069 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:05:26,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] ULTIMATE.startENTRY-->L821: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~weak$$choice2~0_146 0) (= v_~z$w_buff0_used~0_885 0) (= v_~z$mem_tmp~0_22 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1517~0.base_24|) 0) (= v_~z$r_buff1_thd0~0_298 0) (= 0 v_~z$r_buff1_thd2~0_83) (= 0 v_~z$r_buff1_thd4~0_140) (= 0 v_~z$r_buff1_thd1~0_83) (= 0 v_~z$flush_delayed~0_36) (= |v_#memory_int_25| (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1517~0.base_24| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1517~0.base_24|) |v_ULTIMATE.start_main_~#t1517~0.offset_18| 0))) (= 0 |v_ULTIMATE.start_main_~#t1517~0.offset_18|) (= v_~z$r_buff0_thd3~0_92 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~__unbuffered_p3_EAX~0_100 0) (= v_~z$w_buff0~0_503 0) (= v_~z$w_buff1_used~0_515 0) (= v_~a~0_48 0) (= v_~x~0_57 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z~0_155 0) (= v_~main$tmp_guard1~0_32 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1517~0.base_24| 4)) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1517~0.base_24| 1)) (= 0 v_~weak$$choice0~0_16) (= v_~__unbuffered_cnt~0_141 0) (= 0 v_~z$r_buff1_thd3~0_146) (= v_~z$w_buff1~0_306 0) (= v_~z$r_buff0_thd0~0_394 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff0_thd2~0_32 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd4~0_161) (= v_~y~0_76 0) (= v_~z$r_buff0_thd1~0_32 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1517~0.base_24|) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_59|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_83, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_41|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_32|, ULTIMATE.start_main_~#t1517~0.offset=|v_ULTIMATE.start_main_~#t1517~0.offset_18|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_35|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_30|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_45|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_394, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_161, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_100, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_48|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_114|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_515, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_191|, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_35|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_44|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_38|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_~#t1519~0.base=|v_ULTIMATE.start_main_~#t1519~0.base_20|, ~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_92, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_57, ULTIMATE.start_main_~#t1520~0.base=|v_ULTIMATE.start_main_~#t1520~0.base_21|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_140, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_40|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~z$w_buff1~0=v_~z$w_buff1~0_306, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ~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_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_29|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_51|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_298, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_25|, ULTIMATE.start_main_~#t1520~0.offset=|v_ULTIMATE.start_main_~#t1520~0.offset_17|, ULTIMATE.start_main_~#t1518~0.base=|v_ULTIMATE.start_main_~#t1518~0.base_22|, ~y~0=v_~y~0_76, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_32, ULTIMATE.start_main_~#t1518~0.offset=|v_ULTIMATE.start_main_~#t1518~0.offset_17|, ULTIMATE.start_main_~#t1517~0.base=|v_ULTIMATE.start_main_~#t1517~0.base_24|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_885, ~z$w_buff0~0=v_~z$w_buff0~0_503, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_39|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_146, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_122|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t1519~0.offset=|v_ULTIMATE.start_main_~#t1519~0.offset_16|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_36|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_23|, ~z~0=v_~z~0_155, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1517~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~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, ULTIMATE.start_main_~#t1519~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1520~0.base, ~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, ULTIMATE.start_main_~#t1520~0.offset, ULTIMATE.start_main_~#t1518~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1518~0.offset, ULTIMATE.start_main_~#t1517~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, ULTIMATE.start_main_~#t1519~0.offset, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:05:26,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L821-1-->L823: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1518~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1518~0.base_10|) |v_ULTIMATE.start_main_~#t1518~0.offset_9| 1)) |v_#memory_int_13|) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1518~0.base_10|) 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1518~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1518~0.base_10|)) (= 0 |v_ULTIMATE.start_main_~#t1518~0.offset_9|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1518~0.base_10| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1518~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1518~0.base=|v_ULTIMATE.start_main_~#t1518~0.base_10|, ULTIMATE.start_main_~#t1518~0.offset=|v_ULTIMATE.start_main_~#t1518~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1518~0.base, ULTIMATE.start_main_~#t1518~0.offset] because there is no mapped edge [2019-12-26 23:05:26,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L823-1-->L825: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1519~0.base_12|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1519~0.base_12| 4)) (= (select |v_#valid_46| |v_ULTIMATE.start_main_~#t1519~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1519~0.base_12| 0)) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1519~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1519~0.base_12|) |v_ULTIMATE.start_main_~#t1519~0.offset_10| 2))) (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t1519~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t1519~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1519~0.base=|v_ULTIMATE.start_main_~#t1519~0.base_12|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1519~0.offset=|v_ULTIMATE.start_main_~#t1519~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1519~0.base, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1519~0.offset] because there is no mapped edge [2019-12-26 23:05:26,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L825-1-->L827: Formula: (and (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1520~0.base_11|) 0) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1520~0.base_11| 1) |v_#valid_39|) (= |v_ULTIMATE.start_main_~#t1520~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1520~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t1520~0.base_11| 0)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1520~0.base_11| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1520~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1520~0.base_11|) |v_ULTIMATE.start_main_~#t1520~0.offset_10| 3)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1520~0.offset=|v_ULTIMATE.start_main_~#t1520~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ULTIMATE.start_main_~#t1520~0.base=|v_ULTIMATE.start_main_~#t1520~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1520~0.offset, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1520~0.base] because there is no mapped edge [2019-12-26 23:05:26,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11| 1) (= v_P3Thread1of1ForFork2_~arg.offset_11 |v_P3Thread1of1ForFork2_#in~arg.offset_11|) (= (mod v_~z$w_buff1_used~0_99 256) 0) (= |v_P3Thread1of1ForFork2_#in~arg.base_11| v_P3Thread1of1ForFork2_~arg.base_11) (= v_~z$w_buff0_used~0_218 1) (= v_~z$w_buff0~0_48 v_~z$w_buff1~0_32) (= 2 v_~z$w_buff0~0_47) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_13 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|) (= v_~z$w_buff0_used~0_219 v_~z$w_buff1_used~0_99)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_219, ~z$w_buff0~0=v_~z$w_buff0~0_48, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_11|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_11|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_13, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_11, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_218, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_99, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_11|, ~z$w_buff1~0=v_~z$w_buff1~0_32, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_11, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-26 23:05:26,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_19 |v_P0Thread1of1ForFork3_#in~arg.base_19|) (= v_~x~0_44 1) (= 0 |v_P0Thread1of1ForFork3_#res.base_11|) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_19| v_P0Thread1of1ForFork3_~arg.offset_19) (= 0 |v_P0Thread1of1ForFork3_#res.offset_11|) (= v_~a~0_40 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_19|} OutVars{~a~0=v_~a~0_40, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_19|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_19, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_11|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_19, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_19|, ~x~0=v_~x~0_44} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-26 23:05:26,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_39 2) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_~y~0_50 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_10| v_P1Thread1of1ForFork0_~arg.offset_10) (= v_P1Thread1of1ForFork0_~arg.base_10 |v_P1Thread1of1ForFork0_#in~arg.base_10|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_10|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_10, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_10, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_10|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_50, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-26 23:05:26,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L768-2-->L768-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork1_#t~ite3_Out2132262809| |P2Thread1of1ForFork1_#t~ite4_Out2132262809|)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In2132262809 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2132262809 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In2132262809 |P2Thread1of1ForFork1_#t~ite3_Out2132262809|)) (and (= |P2Thread1of1ForFork1_#t~ite3_Out2132262809| ~z~0_In2132262809) .cse0 (or .cse2 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2132262809, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2132262809, ~z$w_buff1~0=~z$w_buff1~0_In2132262809, ~z~0=~z~0_In2132262809} OutVars{P2Thread1of1ForFork1_#t~ite4=|P2Thread1of1ForFork1_#t~ite4_Out2132262809|, P2Thread1of1ForFork1_#t~ite3=|P2Thread1of1ForFork1_#t~ite3_Out2132262809|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2132262809, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2132262809, ~z$w_buff1~0=~z$w_buff1~0_In2132262809, ~z~0=~z~0_In2132262809} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite4, P2Thread1of1ForFork1_#t~ite3] because there is no mapped edge [2019-12-26 23:05:26,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1799935397 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1799935397 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite5_Out1799935397| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1799935397 |P2Thread1of1ForFork1_#t~ite5_Out1799935397|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1799935397, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1799935397} OutVars{P2Thread1of1ForFork1_#t~ite5=|P2Thread1of1ForFork1_#t~ite5_Out1799935397|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1799935397, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1799935397} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 23:05:26,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-284964361 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-284964361 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-284964361 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-284964361 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-284964361 |P2Thread1of1ForFork1_#t~ite6_Out-284964361|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite6_Out-284964361|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-284964361, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-284964361, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-284964361, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-284964361} OutVars{P2Thread1of1ForFork1_#t~ite6=|P2Thread1of1ForFork1_#t~ite6_Out-284964361|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-284964361, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-284964361, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-284964361, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-284964361} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 23:05:26,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1838480668 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1838480668 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite7_Out1838480668| 0)) (and (= |P2Thread1of1ForFork1_#t~ite7_Out1838480668| ~z$r_buff0_thd3~0_In1838480668) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1838480668, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1838480668} OutVars{P2Thread1of1ForFork1_#t~ite7=|P2Thread1of1ForFork1_#t~ite7_Out1838480668|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1838480668, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1838480668} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-26 23:05:26,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1393108015 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1393108015 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1393108015 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1393108015 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite8_Out-1393108015|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-1393108015 |P2Thread1of1ForFork1_#t~ite8_Out-1393108015|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1393108015, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1393108015, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1393108015, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1393108015} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1393108015, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1393108015, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1393108015, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1393108015, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-1393108015|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 23:05:26,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L772-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~z$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork1_#t~ite8_46|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_46|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_45|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 23:05:26,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1297685948 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1297685948 256)))) (or (and (= ~z$w_buff0_used~0_In-1297685948 |P3Thread1of1ForFork2_#t~ite11_Out-1297685948|) (or .cse0 .cse1)) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite11_Out-1297685948| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1297685948, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1297685948} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1297685948, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1297685948, P3Thread1of1ForFork2_#t~ite11=|P3Thread1of1ForFork2_#t~ite11_Out-1297685948|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 23:05:26,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L800-->L800-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1510058388 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1510058388 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In1510058388 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1510058388 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite12_Out1510058388| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1510058388 |P3Thread1of1ForFork2_#t~ite12_Out1510058388|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1510058388, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1510058388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1510058388, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1510058388} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1510058388, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1510058388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1510058388, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1510058388, P3Thread1of1ForFork2_#t~ite12=|P3Thread1of1ForFork2_#t~ite12_Out1510058388|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 23:05:26,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L801-->L802: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In931185745 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In931185745 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out931185745 ~z$r_buff0_thd4~0_In931185745)) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out931185745) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In931185745, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In931185745} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In931185745, P3Thread1of1ForFork2_#t~ite13=|P3Thread1of1ForFork2_#t~ite13_Out931185745|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out931185745} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite13, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-26 23:05:26,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1997272490 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-1997272490 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1997272490 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1997272490 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite14_Out-1997272490| ~z$r_buff1_thd4~0_In-1997272490) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite14_Out-1997272490| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1997272490, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1997272490, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1997272490, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1997272490} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1997272490, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1997272490, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1997272490, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1997272490, P3Thread1of1ForFork2_#t~ite14=|P3Thread1of1ForFork2_#t~ite14_Out-1997272490|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 23:05:26,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L802-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite14_56| v_~z$r_buff1_thd4~0_130) (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_126 (+ v_~__unbuffered_cnt~0_127 1))) InVars {P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_130, P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_55|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite14, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:05:26,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L827-1-->L833: Formula: (and (= 4 v_~__unbuffered_cnt~0_21) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-26 23:05:26,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L833-2-->L833-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In2044008184 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In2044008184 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out2044008184| ~z$w_buff1~0_In2044008184) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out2044008184| ~z~0_In2044008184)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2044008184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2044008184, ~z$w_buff1~0=~z$w_buff1~0_In2044008184, ~z~0=~z~0_In2044008184} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out2044008184|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2044008184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2044008184, ~z$w_buff1~0=~z$w_buff1~0_In2044008184, ~z~0=~z~0_In2044008184} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 23:05:26,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L833-4-->L834: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite19_8|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|, ~z~0=v_~z~0_31, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 23:05:26,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L834-->L834-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-471366586 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-471366586 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-471366586| ~z$w_buff0_used~0_In-471366586)) (and (= |ULTIMATE.start_main_#t~ite21_Out-471366586| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-471366586, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-471366586} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-471366586, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-471366586, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-471366586|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 23:05:26,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L835-->L835-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1076330230 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1076330230 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1076330230 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1076330230 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out1076330230| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite22_Out1076330230| ~z$w_buff1_used~0_In1076330230) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1076330230, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1076330230, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1076330230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1076330230} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1076330230, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1076330230, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1076330230, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1076330230, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1076330230|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 23:05:26,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1169208659 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1169208659 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1169208659 |ULTIMATE.start_main_#t~ite23_Out1169208659|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite23_Out1169208659| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1169208659, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1169208659} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1169208659, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1169208659, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1169208659|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 23:05:26,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-84606778 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-84606778 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-84606778 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-84606778 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-84606778 |ULTIMATE.start_main_#t~ite24_Out-84606778|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-84606778|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-84606778, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-84606778, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-84606778, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-84606778} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-84606778, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-84606778, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-84606778, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-84606778|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-84606778} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 23:05:26,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L849-->L850: Formula: (and (= v_~z$r_buff0_thd0~0_119 v_~z$r_buff0_thd0~0_120) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_29, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} 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-26 23:05:26,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L850-->L850-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In890148 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out890148| |ULTIMATE.start_main_#t~ite45_Out890148|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In890148 256) 0))) (or (= (mod ~z$w_buff0_used~0_In890148 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In890148 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In890148 256) 0)))) (= |ULTIMATE.start_main_#t~ite45_Out890148| ~z$r_buff1_thd0~0_In890148)) (and (= |ULTIMATE.start_main_#t~ite46_Out890148| ~z$r_buff1_thd0~0_In890148) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In890148| |ULTIMATE.start_main_#t~ite45_Out890148|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In890148, ~z$w_buff0_used~0=~z$w_buff0_used~0_In890148, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In890148, ~z$w_buff1_used~0=~z$w_buff1_used~0_In890148, ~weak$$choice2~0=~weak$$choice2~0_In890148, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In890148|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In890148, ~z$w_buff0_used~0=~z$w_buff0_used~0_In890148, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In890148, ~z$w_buff1_used~0=~z$w_buff1_used~0_In890148, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out890148|, ~weak$$choice2~0=~weak$$choice2~0_In890148, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out890148|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:05:26,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L852-->L855-1: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_120) (= 0 v_~z$flush_delayed~0_24) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (not (= 0 (mod v_~z$flush_delayed~0_25 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z$flush_delayed~0=v_~z$flush_delayed~0_25} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ~z~0=v_~z~0_120, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[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-26 23:05:26,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L855-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:05:26,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:05:26 BasicIcfg [2019-12-26 23:05:26,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:05:26,213 INFO L168 Benchmark]: Toolchain (without parser) took 25260.10 ms. Allocated memory was 144.7 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 99.8 MB in the beginning and 613.3 MB in the end (delta: -513.5 MB). Peak memory consumption was 750.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:05:26,215 INFO L168 Benchmark]: CDTParser took 1.47 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 23:05:26,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.88 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.4 MB in the beginning and 155.0 MB in the end (delta: -55.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:05:26,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.33 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:05:26,221 INFO L168 Benchmark]: Boogie Preprocessor took 44.38 ms. Allocated memory is still 201.9 MB. Free memory was 152.4 MB in the beginning and 149.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:05:26,221 INFO L168 Benchmark]: RCFGBuilder took 845.07 ms. Allocated memory is still 201.9 MB. Free memory was 149.7 MB in the beginning and 101.1 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:05:26,223 INFO L168 Benchmark]: TraceAbstraction took 23557.88 ms. Allocated memory was 201.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 100.4 MB in the beginning and 613.3 MB in the end (delta: -512.9 MB). Peak memory consumption was 693.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:05:26,230 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.47 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 734.88 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.4 MB in the beginning and 155.0 MB in the end (delta: -55.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.33 ms. Allocated memory is still 201.9 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.38 ms. Allocated memory is still 201.9 MB. Free memory was 152.4 MB in the beginning and 149.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 845.07 ms. Allocated memory is still 201.9 MB. Free memory was 149.7 MB in the beginning and 101.1 MB in the end (delta: 48.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23557.88 ms. Allocated memory was 201.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 100.4 MB in the beginning and 613.3 MB in the end (delta: -512.9 MB). Peak memory consumption was 693.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 178 ProgramPointsBefore, 91 ProgramPointsAfterwards, 206 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 24 ChoiceCompositions, 4617 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 231 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 56276 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L821] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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] [L823] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0: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] [L825] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L827] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L787] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L788] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L789] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L790] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L791] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L792] 4 z$r_buff0_thd4 = (_Bool)1 [L795] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L762] 3 y = 2 [L765] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L768] EXPR 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L768] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L769] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 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 [L771] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L798] 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) [L799] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L800] 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 [L833] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 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 [L836] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L837] 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 [L840] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L841] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L842] 0 z$flush_delayed = weak$$choice2 [L843] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L844] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L844] 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) [L845] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L845] 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)) [L846] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L846] 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)) [L847] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L847] 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)) [L848] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L848] 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)) [L850] 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)) [L851] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 23.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1537 SDtfs, 1485 SDslu, 2557 SDs, 0 SdLazy, 926 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46670occurred 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.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 6222 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 113648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...