/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:37:49,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:37:49,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:37:49,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:37:49,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:37:49,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:37:49,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:37:49,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:37:49,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:37:49,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:37:49,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:37:49,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:37:49,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:37:49,685 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:37:49,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:37:49,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:37:49,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:37:49,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:37:49,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:37:49,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:37:49,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:37:49,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:37:49,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:37:49,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:37:49,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:37:49,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:37:49,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:37:49,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:37:49,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:37:49,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:37:49,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:37:49,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:37:49,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:37:49,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:37:49,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:37:49,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:37:49,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:37:49,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:37:49,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:37:49,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:37:49,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:37:49,711 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:37:49,725 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:37:49,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:37:49,727 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:37:49,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:37:49,727 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:37:49,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:37:49,728 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:37:49,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:37:49,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:37:49,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:37:49,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:37:49,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:37:49,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:37:49,729 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:37:49,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:37:49,730 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:37:49,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:37:49,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:37:49,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:37:49,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:37:49,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:37:49,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:37:49,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:37:49,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:37:49,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:37:49,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:37:49,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:37:49,732 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:37:49,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:37:49,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:37:50,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:37:50,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:37:50,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:37:50,031 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:37:50,032 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:37:50,032 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2019-12-27 06:37:50,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb544797/7761412e531b46d4913260a1311ae507/FLAG7c02504b9 [2019-12-27 06:37:50,704 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:37:50,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_tso.opt.i [2019-12-27 06:37:50,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb544797/7761412e531b46d4913260a1311ae507/FLAG7c02504b9 [2019-12-27 06:37:50,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bb544797/7761412e531b46d4913260a1311ae507 [2019-12-27 06:37:50,979 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:37:50,981 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:37:50,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:37:50,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:37:50,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:37:50,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:37:50" (1/1) ... [2019-12-27 06:37:50,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7126c0fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:37:50, skipping insertion in model container [2019-12-27 06:37:50,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:37:50" (1/1) ... [2019-12-27 06:37:50,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:37:51,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:37:51,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:37:51,604 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:37:51,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:37:51,807 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:37:51,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:37:51 WrapperNode [2019-12-27 06:37:51,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:37:51,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:37:51,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:37:51,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:37:51,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:37:51" (1/1) ... [2019-12-27 06:37:51,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:37:51" (1/1) ... [2019-12-27 06:37:51,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:37:51,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:37:51,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:37:51,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:37:51,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:37:51" (1/1) ... [2019-12-27 06:37:51,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:37:51" (1/1) ... [2019-12-27 06:37:51,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:37:51" (1/1) ... [2019-12-27 06:37:51,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:37:51" (1/1) ... [2019-12-27 06:37:51,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:37:51" (1/1) ... [2019-12-27 06:37:51,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:37:51" (1/1) ... [2019-12-27 06:37:51,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:37:51" (1/1) ... [2019-12-27 06:37:51,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:37:51,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:37:51,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:37:51,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:37:51,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:37:51" (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-27 06:37:52,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:37:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:37:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:37:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:37:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:37:52,001 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:37:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:37:52,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:37:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:37:52,002 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:37:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:37:52,003 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:37:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:37:52,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:37:52,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:37:52,005 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:37:52,793 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:37:52,793 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:37:52,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:37:52 BoogieIcfgContainer [2019-12-27 06:37:52,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:37:52,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:37:52,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:37:52,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:37:52,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:37:50" (1/3) ... [2019-12-27 06:37:52,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19734961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:37:52, skipping insertion in model container [2019-12-27 06:37:52,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:37:51" (2/3) ... [2019-12-27 06:37:52,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19734961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:37:52, skipping insertion in model container [2019-12-27 06:37:52,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:37:52" (3/3) ... [2019-12-27 06:37:52,802 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_tso.opt.i [2019-12-27 06:37:52,812 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:37:52,812 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:37:52,820 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:37:52,821 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:37:52,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,860 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,861 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,862 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,863 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,864 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,864 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,874 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,874 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,874 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,875 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,875 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,875 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,876 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,876 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,877 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,878 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,878 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,878 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,879 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,879 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,879 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,879 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,888 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,889 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,891 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,892 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,913 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,913 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,916 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,917 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,918 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,919 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,919 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:37:52,932 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:37:52,952 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:37:52,953 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:37:52,953 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:37:52,953 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:37:52,953 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:37:52,953 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:37:52,953 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:37:52,954 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:37:52,971 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 06:37:52,973 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 06:37:53,076 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 06:37:53,077 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:37:53,092 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:37:53,114 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 06:37:53,167 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 06:37:53,168 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:37:53,175 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 06:37:53,193 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 06:37:53,194 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:37:56,815 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 06:37:56,957 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 06:37:56,981 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54567 [2019-12-27 06:37:56,981 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 06:37:56,985 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 100 transitions [2019-12-27 06:38:00,079 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 39550 states. [2019-12-27 06:38:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 39550 states. [2019-12-27 06:38:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 06:38:00,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:00,090 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:38:00,090 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:00,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1832018812, now seen corresponding path program 1 times [2019-12-27 06:38:00,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:00,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596454483] [2019-12-27 06:38:00,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:00,363 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-27 06:38:00,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596454483] [2019-12-27 06:38:00,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:00,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:38:00,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329960659] [2019-12-27 06:38:00,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:38:00,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:00,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:38:00,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:38:00,389 INFO L87 Difference]: Start difference. First operand 39550 states. Second operand 3 states. [2019-12-27 06:38:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:01,178 INFO L93 Difference]: Finished difference Result 36830 states and 156304 transitions. [2019-12-27 06:38:01,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:38:01,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 06:38:01,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:01,552 INFO L225 Difference]: With dead ends: 36830 [2019-12-27 06:38:01,552 INFO L226 Difference]: Without dead ends: 36102 [2019-12-27 06:38:01,554 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-27 06:38:03,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-27 06:38:04,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-27 06:38:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-27 06:38:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 153336 transitions. [2019-12-27 06:38:04,581 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 153336 transitions. Word has length 9 [2019-12-27 06:38:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:04,582 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 153336 transitions. [2019-12-27 06:38:04,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:38:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 153336 transitions. [2019-12-27 06:38:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:38:04,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:04,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:38:04,598 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:04,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:04,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1657144856, now seen corresponding path program 1 times [2019-12-27 06:38:04,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:04,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040164848] [2019-12-27 06:38:04,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:04,731 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-27 06:38:04,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040164848] [2019-12-27 06:38:04,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:04,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:38:04,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741205723] [2019-12-27 06:38:04,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:38:04,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:04,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:38:04,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:38:04,735 INFO L87 Difference]: Start difference. First operand 36102 states and 153336 transitions. Second operand 4 states. [2019-12-27 06:38:07,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:07,219 INFO L93 Difference]: Finished difference Result 56134 states and 230968 transitions. [2019-12-27 06:38:07,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:38:07,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:38:07,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:07,544 INFO L225 Difference]: With dead ends: 56134 [2019-12-27 06:38:07,544 INFO L226 Difference]: Without dead ends: 56106 [2019-12-27 06:38:07,545 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-27 06:38:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-27 06:38:09,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 50070. [2019-12-27 06:38:09,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50070 states. [2019-12-27 06:38:09,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50070 states to 50070 states and 208456 transitions. [2019-12-27 06:38:09,801 INFO L78 Accepts]: Start accepts. Automaton has 50070 states and 208456 transitions. Word has length 15 [2019-12-27 06:38:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:09,801 INFO L462 AbstractCegarLoop]: Abstraction has 50070 states and 208456 transitions. [2019-12-27 06:38:09,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:38:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 50070 states and 208456 transitions. [2019-12-27 06:38:09,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:38:09,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:09,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:38:09,804 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:09,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:09,804 INFO L82 PathProgramCache]: Analyzing trace with hash -311678002, now seen corresponding path program 1 times [2019-12-27 06:38:09,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:09,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43159382] [2019-12-27 06:38:09,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:09,868 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-27 06:38:09,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43159382] [2019-12-27 06:38:09,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:09,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:38:09,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969413600] [2019-12-27 06:38:09,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:38:09,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:09,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:38:09,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:38:09,874 INFO L87 Difference]: Start difference. First operand 50070 states and 208456 transitions. Second operand 3 states. [2019-12-27 06:38:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:10,076 INFO L93 Difference]: Finished difference Result 39280 states and 151115 transitions. [2019-12-27 06:38:10,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:38:10,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 06:38:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:10,320 INFO L225 Difference]: With dead ends: 39280 [2019-12-27 06:38:10,320 INFO L226 Difference]: Without dead ends: 39280 [2019-12-27 06:38:10,321 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-27 06:38:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39280 states. [2019-12-27 06:38:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39280 to 39280. [2019-12-27 06:38:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39280 states. [2019-12-27 06:38:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39280 states to 39280 states and 151115 transitions. [2019-12-27 06:38:13,623 INFO L78 Accepts]: Start accepts. Automaton has 39280 states and 151115 transitions. Word has length 15 [2019-12-27 06:38:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:13,623 INFO L462 AbstractCegarLoop]: Abstraction has 39280 states and 151115 transitions. [2019-12-27 06:38:13,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:38:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 39280 states and 151115 transitions. [2019-12-27 06:38:13,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:38:13,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:13,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:38:13,627 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:13,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1094107821, now seen corresponding path program 1 times [2019-12-27 06:38:13,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:13,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526666012] [2019-12-27 06:38:13,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:13,719 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-27 06:38:13,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526666012] [2019-12-27 06:38:13,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:13,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:38:13,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255952044] [2019-12-27 06:38:13,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:38:13,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:13,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:38:13,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:38:13,721 INFO L87 Difference]: Start difference. First operand 39280 states and 151115 transitions. Second operand 4 states. [2019-12-27 06:38:13,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:13,803 INFO L93 Difference]: Finished difference Result 16344 states and 52151 transitions. [2019-12-27 06:38:13,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:38:13,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:38:13,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:13,834 INFO L225 Difference]: With dead ends: 16344 [2019-12-27 06:38:13,834 INFO L226 Difference]: Without dead ends: 16344 [2019-12-27 06:38:13,834 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-27 06:38:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16344 states. [2019-12-27 06:38:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16344 to 16344. [2019-12-27 06:38:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-12-27 06:38:14,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 52151 transitions. [2019-12-27 06:38:14,164 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 52151 transitions. Word has length 16 [2019-12-27 06:38:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:14,164 INFO L462 AbstractCegarLoop]: Abstraction has 16344 states and 52151 transitions. [2019-12-27 06:38:14,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:38:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 52151 transitions. [2019-12-27 06:38:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 06:38:14,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:14,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:38:14,167 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:14,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:14,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1111128464, now seen corresponding path program 1 times [2019-12-27 06:38:14,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:14,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662150738] [2019-12-27 06:38:14,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:14,228 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-27 06:38:14,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662150738] [2019-12-27 06:38:14,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:14,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:38:14,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756249480] [2019-12-27 06:38:14,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:38:14,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:14,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:38:14,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:38:14,230 INFO L87 Difference]: Start difference. First operand 16344 states and 52151 transitions. Second operand 5 states. [2019-12-27 06:38:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:14,284 INFO L93 Difference]: Finished difference Result 2799 states and 7236 transitions. [2019-12-27 06:38:14,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:38:14,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 06:38:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:14,289 INFO L225 Difference]: With dead ends: 2799 [2019-12-27 06:38:14,289 INFO L226 Difference]: Without dead ends: 2799 [2019-12-27 06:38:14,290 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-27 06:38:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2019-12-27 06:38:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2799. [2019-12-27 06:38:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2799 states. [2019-12-27 06:38:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 7236 transitions. [2019-12-27 06:38:14,334 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 7236 transitions. Word has length 17 [2019-12-27 06:38:14,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:14,334 INFO L462 AbstractCegarLoop]: Abstraction has 2799 states and 7236 transitions. [2019-12-27 06:38:14,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:38:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 7236 transitions. [2019-12-27 06:38:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:38:14,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:14,340 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-27 06:38:14,341 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:14,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1318629020, now seen corresponding path program 1 times [2019-12-27 06:38:14,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:14,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012902687] [2019-12-27 06:38:14,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:14,455 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-27 06:38:14,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012902687] [2019-12-27 06:38:14,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:14,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:38:14,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164681651] [2019-12-27 06:38:14,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:38:14,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:14,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:38:14,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:38:14,457 INFO L87 Difference]: Start difference. First operand 2799 states and 7236 transitions. Second operand 6 states. [2019-12-27 06:38:14,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:14,506 INFO L93 Difference]: Finished difference Result 1357 states and 3888 transitions. [2019-12-27 06:38:14,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:38:14,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 06:38:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:14,509 INFO L225 Difference]: With dead ends: 1357 [2019-12-27 06:38:14,509 INFO L226 Difference]: Without dead ends: 1357 [2019-12-27 06:38:14,510 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-27 06:38:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-27 06:38:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-27 06:38:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-27 06:38:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3488 transitions. [2019-12-27 06:38:14,530 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3488 transitions. Word has length 29 [2019-12-27 06:38:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:14,530 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3488 transitions. [2019-12-27 06:38:14,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:38:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3488 transitions. [2019-12-27 06:38:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:38:14,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:14,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:38:14,535 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:14,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:14,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1789262397, now seen corresponding path program 1 times [2019-12-27 06:38:14,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:14,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40956531] [2019-12-27 06:38:14,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:38:14,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40956531] [2019-12-27 06:38:14,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:14,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:38:14,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146513301] [2019-12-27 06:38:14,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:38:14,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:14,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:38:14,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:38:14,672 INFO L87 Difference]: Start difference. First operand 1217 states and 3488 transitions. Second operand 3 states. [2019-12-27 06:38:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:14,719 INFO L93 Difference]: Finished difference Result 1228 states and 3503 transitions. [2019-12-27 06:38:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:38:14,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 06:38:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:14,724 INFO L225 Difference]: With dead ends: 1228 [2019-12-27 06:38:14,724 INFO L226 Difference]: Without dead ends: 1228 [2019-12-27 06:38:14,725 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-27 06:38:14,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-27 06:38:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-27 06:38:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-27 06:38:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3497 transitions. [2019-12-27 06:38:14,740 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3497 transitions. Word has length 58 [2019-12-27 06:38:14,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:14,741 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3497 transitions. [2019-12-27 06:38:14,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:38:14,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3497 transitions. [2019-12-27 06:38:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:38:14,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:14,745 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-27 06:38:14,745 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:14,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:14,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2131195958, now seen corresponding path program 1 times [2019-12-27 06:38:14,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:14,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100566817] [2019-12-27 06:38:14,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:14,851 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-27 06:38:14,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100566817] [2019-12-27 06:38:14,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:14,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:38:14,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956500089] [2019-12-27 06:38:14,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:38:14,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:14,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:38:14,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:38:14,854 INFO L87 Difference]: Start difference. First operand 1222 states and 3497 transitions. Second operand 5 states. [2019-12-27 06:38:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:15,297 INFO L93 Difference]: Finished difference Result 1763 states and 5019 transitions. [2019-12-27 06:38:15,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:38:15,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 06:38:15,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:15,300 INFO L225 Difference]: With dead ends: 1763 [2019-12-27 06:38:15,300 INFO L226 Difference]: Without dead ends: 1763 [2019-12-27 06:38:15,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:38:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2019-12-27 06:38:15,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1418. [2019-12-27 06:38:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-12-27 06:38:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 4073 transitions. [2019-12-27 06:38:15,318 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 4073 transitions. Word has length 58 [2019-12-27 06:38:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:15,319 INFO L462 AbstractCegarLoop]: Abstraction has 1418 states and 4073 transitions. [2019-12-27 06:38:15,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:38:15,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 4073 transitions. [2019-12-27 06:38:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:38:15,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:15,322 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-27 06:38:15,322 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:15,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:15,322 INFO L82 PathProgramCache]: Analyzing trace with hash 831744802, now seen corresponding path program 2 times [2019-12-27 06:38:15,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:15,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761186090] [2019-12-27 06:38:15,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:15,431 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-27 06:38:15,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761186090] [2019-12-27 06:38:15,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:15,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:38:15,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405836634] [2019-12-27 06:38:15,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:38:15,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:15,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:38:15,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:38:15,436 INFO L87 Difference]: Start difference. First operand 1418 states and 4073 transitions. Second operand 6 states. [2019-12-27 06:38:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:15,779 INFO L93 Difference]: Finished difference Result 2369 states and 6739 transitions. [2019-12-27 06:38:15,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:38:15,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 06:38:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:15,784 INFO L225 Difference]: With dead ends: 2369 [2019-12-27 06:38:15,785 INFO L226 Difference]: Without dead ends: 2369 [2019-12-27 06:38:15,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:38:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2019-12-27 06:38:15,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1502. [2019-12-27 06:38:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-27 06:38:15,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4321 transitions. [2019-12-27 06:38:15,813 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4321 transitions. Word has length 58 [2019-12-27 06:38:15,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:15,813 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 4321 transitions. [2019-12-27 06:38:15,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:38:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4321 transitions. [2019-12-27 06:38:15,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:38:15,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:15,817 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-27 06:38:15,818 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:15,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:15,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1828606006, now seen corresponding path program 3 times [2019-12-27 06:38:15,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:15,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442278909] [2019-12-27 06:38:15,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:15,932 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-27 06:38:15,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442278909] [2019-12-27 06:38:15,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:15,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:38:15,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384385839] [2019-12-27 06:38:15,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:38:15,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:15,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:38:15,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:38:15,934 INFO L87 Difference]: Start difference. First operand 1502 states and 4321 transitions. Second operand 6 states. [2019-12-27 06:38:16,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:16,384 INFO L93 Difference]: Finished difference Result 2376 states and 6757 transitions. [2019-12-27 06:38:16,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:38:16,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 06:38:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:16,392 INFO L225 Difference]: With dead ends: 2376 [2019-12-27 06:38:16,392 INFO L226 Difference]: Without dead ends: 2376 [2019-12-27 06:38:16,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:38:16,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-12-27 06:38:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1690. [2019-12-27 06:38:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-12-27 06:38:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 4865 transitions. [2019-12-27 06:38:16,431 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 4865 transitions. Word has length 58 [2019-12-27 06:38:16,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:16,432 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 4865 transitions. [2019-12-27 06:38:16,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:38:16,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 4865 transitions. [2019-12-27 06:38:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:38:16,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:16,436 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-27 06:38:16,437 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:16,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:16,437 INFO L82 PathProgramCache]: Analyzing trace with hash 361631606, now seen corresponding path program 4 times [2019-12-27 06:38:16,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:16,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388836672] [2019-12-27 06:38:16,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:16,619 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-27 06:38:16,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388836672] [2019-12-27 06:38:16,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:16,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:38:16,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369151362] [2019-12-27 06:38:16,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:38:16,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:16,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:38:16,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:38:16,621 INFO L87 Difference]: Start difference. First operand 1690 states and 4865 transitions. Second operand 6 states. [2019-12-27 06:38:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:16,691 INFO L93 Difference]: Finished difference Result 2411 states and 6570 transitions. [2019-12-27 06:38:16,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:38:16,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 06:38:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:16,695 INFO L225 Difference]: With dead ends: 2411 [2019-12-27 06:38:16,695 INFO L226 Difference]: Without dead ends: 1544 [2019-12-27 06:38:16,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:38:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2019-12-27 06:38:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2019-12-27 06:38:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-12-27 06:38:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 4371 transitions. [2019-12-27 06:38:16,725 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 4371 transitions. Word has length 58 [2019-12-27 06:38:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:16,725 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 4371 transitions. [2019-12-27 06:38:16,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:38:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 4371 transitions. [2019-12-27 06:38:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 06:38:16,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:16,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-27 06:38:16,730 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2125865736, now seen corresponding path program 5 times [2019-12-27 06:38:16,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:16,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679404643] [2019-12-27 06:38:16,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:38:16,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679404643] [2019-12-27 06:38:16,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:16,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:38:16,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504746959] [2019-12-27 06:38:16,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:38:16,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:16,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:38:16,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:38:16,828 INFO L87 Difference]: Start difference. First operand 1544 states and 4371 transitions. Second operand 3 states. [2019-12-27 06:38:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:16,878 INFO L93 Difference]: Finished difference Result 1543 states and 4369 transitions. [2019-12-27 06:38:16,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:38:16,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 06:38:16,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:16,881 INFO L225 Difference]: With dead ends: 1543 [2019-12-27 06:38:16,881 INFO L226 Difference]: Without dead ends: 1543 [2019-12-27 06:38:16,882 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-27 06:38:16,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2019-12-27 06:38:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 950. [2019-12-27 06:38:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-12-27 06:38:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2693 transitions. [2019-12-27 06:38:16,900 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2693 transitions. Word has length 58 [2019-12-27 06:38:16,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:16,902 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 2693 transitions. [2019-12-27 06:38:16,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:38:16,902 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2693 transitions. [2019-12-27 06:38:16,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 06:38:16,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:16,904 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-27 06:38:16,905 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:16,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:16,905 INFO L82 PathProgramCache]: Analyzing trace with hash -916388173, now seen corresponding path program 1 times [2019-12-27 06:38:16,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:16,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306759045] [2019-12-27 06:38:16,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:16,988 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-27 06:38:16,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306759045] [2019-12-27 06:38:16,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:16,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:38:16,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148547913] [2019-12-27 06:38:16,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:38:16,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:16,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:38:16,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:38:16,991 INFO L87 Difference]: Start difference. First operand 950 states and 2693 transitions. Second operand 3 states. [2019-12-27 06:38:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:17,009 INFO L93 Difference]: Finished difference Result 894 states and 2465 transitions. [2019-12-27 06:38:17,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:38:17,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 06:38:17,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:17,012 INFO L225 Difference]: With dead ends: 894 [2019-12-27 06:38:17,012 INFO L226 Difference]: Without dead ends: 894 [2019-12-27 06:38:17,013 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-27 06:38:17,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-27 06:38:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 830. [2019-12-27 06:38:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-12-27 06:38:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2281 transitions. [2019-12-27 06:38:17,028 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2281 transitions. Word has length 59 [2019-12-27 06:38:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:17,028 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 2281 transitions. [2019-12-27 06:38:17,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:38:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2281 transitions. [2019-12-27 06:38:17,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:38:17,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:17,031 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-27 06:38:17,031 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:17,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:17,031 INFO L82 PathProgramCache]: Analyzing trace with hash -40355053, now seen corresponding path program 1 times [2019-12-27 06:38:17,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:17,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944533037] [2019-12-27 06:38:17,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:17,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:38:17,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944533037] [2019-12-27 06:38:17,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:17,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:38:17,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62875291] [2019-12-27 06:38:17,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:38:17,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:17,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:38:17,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:38:17,421 INFO L87 Difference]: Start difference. First operand 830 states and 2281 transitions. Second operand 13 states. [2019-12-27 06:38:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:18,593 INFO L93 Difference]: Finished difference Result 1928 states and 4731 transitions. [2019-12-27 06:38:18,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:38:18,594 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-27 06:38:18,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:18,596 INFO L225 Difference]: With dead ends: 1928 [2019-12-27 06:38:18,596 INFO L226 Difference]: Without dead ends: 819 [2019-12-27 06:38:18,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:38:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-12-27 06:38:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 604. [2019-12-27 06:38:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-27 06:38:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1458 transitions. [2019-12-27 06:38:18,609 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1458 transitions. Word has length 60 [2019-12-27 06:38:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:18,609 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1458 transitions. [2019-12-27 06:38:18,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:38:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1458 transitions. [2019-12-27 06:38:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:38:18,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:18,611 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-27 06:38:18,611 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:18,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:18,612 INFO L82 PathProgramCache]: Analyzing trace with hash -528056523, now seen corresponding path program 2 times [2019-12-27 06:38:18,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:18,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303233913] [2019-12-27 06:38:18,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:18,918 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-27 06:38:18,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303233913] [2019-12-27 06:38:18,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:18,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:38:18,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774950565] [2019-12-27 06:38:18,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:38:18,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:18,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:38:18,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:38:18,920 INFO L87 Difference]: Start difference. First operand 604 states and 1458 transitions. Second operand 12 states. [2019-12-27 06:38:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:19,293 INFO L93 Difference]: Finished difference Result 1132 states and 2758 transitions. [2019-12-27 06:38:19,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:38:19,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-27 06:38:19,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:19,295 INFO L225 Difference]: With dead ends: 1132 [2019-12-27 06:38:19,295 INFO L226 Difference]: Without dead ends: 1101 [2019-12-27 06:38:19,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:38:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2019-12-27 06:38:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 868. [2019-12-27 06:38:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-12-27 06:38:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 2092 transitions. [2019-12-27 06:38:19,309 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 2092 transitions. Word has length 60 [2019-12-27 06:38:19,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:19,310 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 2092 transitions. [2019-12-27 06:38:19,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:38:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 2092 transitions. [2019-12-27 06:38:19,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:38:19,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:19,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:38:19,312 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:19,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:19,313 INFO L82 PathProgramCache]: Analyzing trace with hash 840952941, now seen corresponding path program 3 times [2019-12-27 06:38:19,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:19,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247039653] [2019-12-27 06:38:19,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:19,439 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-27 06:38:19,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247039653] [2019-12-27 06:38:19,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:19,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:38:19,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375659337] [2019-12-27 06:38:19,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:38:19,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:19,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:38:19,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:38:19,442 INFO L87 Difference]: Start difference. First operand 868 states and 2092 transitions. Second operand 6 states. [2019-12-27 06:38:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:19,527 INFO L93 Difference]: Finished difference Result 1153 states and 2689 transitions. [2019-12-27 06:38:19,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:38:19,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 06:38:19,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:19,528 INFO L225 Difference]: With dead ends: 1153 [2019-12-27 06:38:19,528 INFO L226 Difference]: Without dead ends: 260 [2019-12-27 06:38:19,529 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-27 06:38:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-27 06:38:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 236. [2019-12-27 06:38:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-27 06:38:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 419 transitions. [2019-12-27 06:38:19,533 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 419 transitions. Word has length 60 [2019-12-27 06:38:19,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:19,534 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 419 transitions. [2019-12-27 06:38:19,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:38:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 419 transitions. [2019-12-27 06:38:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:38:19,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:19,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:38:19,536 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:19,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1833326427, now seen corresponding path program 4 times [2019-12-27 06:38:19,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:19,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029487235] [2019-12-27 06:38:19,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:19,878 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-27 06:38:19,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029487235] [2019-12-27 06:38:19,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:19,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:38:19,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463143797] [2019-12-27 06:38:19,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:38:19,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:19,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:38:19,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:38:19,881 INFO L87 Difference]: Start difference. First operand 236 states and 419 transitions. Second operand 14 states. [2019-12-27 06:38:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:20,472 INFO L93 Difference]: Finished difference Result 453 states and 781 transitions. [2019-12-27 06:38:20,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 06:38:20,472 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 06:38:20,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:20,473 INFO L225 Difference]: With dead ends: 453 [2019-12-27 06:38:20,473 INFO L226 Difference]: Without dead ends: 422 [2019-12-27 06:38:20,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-12-27 06:38:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-27 06:38:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 317. [2019-12-27 06:38:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 06:38:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 556 transitions. [2019-12-27 06:38:20,479 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 556 transitions. Word has length 60 [2019-12-27 06:38:20,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:20,479 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 556 transitions. [2019-12-27 06:38:20,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:38:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 556 transitions. [2019-12-27 06:38:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:38:20,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:20,481 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-27 06:38:20,481 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:20,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:20,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1154236733, now seen corresponding path program 5 times [2019-12-27 06:38:20,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:20,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671924357] [2019-12-27 06:38:20,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:20,829 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-27 06:38:20,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671924357] [2019-12-27 06:38:20,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:20,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:38:20,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481127388] [2019-12-27 06:38:20,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:38:20,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:20,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:38:20,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:38:20,832 INFO L87 Difference]: Start difference. First operand 317 states and 556 transitions. Second operand 15 states. [2019-12-27 06:38:21,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:21,540 INFO L93 Difference]: Finished difference Result 525 states and 897 transitions. [2019-12-27 06:38:21,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:38:21,540 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-27 06:38:21,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:21,541 INFO L225 Difference]: With dead ends: 525 [2019-12-27 06:38:21,542 INFO L226 Difference]: Without dead ends: 494 [2019-12-27 06:38:21,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:38:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-12-27 06:38:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 351. [2019-12-27 06:38:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-12-27 06:38:21,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 618 transitions. [2019-12-27 06:38:21,549 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 618 transitions. Word has length 60 [2019-12-27 06:38:21,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:21,549 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 618 transitions. [2019-12-27 06:38:21,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:38:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 618 transitions. [2019-12-27 06:38:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:38:21,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:21,550 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-27 06:38:21,550 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:21,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:21,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1330572061, now seen corresponding path program 6 times [2019-12-27 06:38:21,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:21,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792873315] [2019-12-27 06:38:21,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:38:21,924 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 9 [2019-12-27 06:38:22,099 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-27 06:38:22,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792873315] [2019-12-27 06:38:22,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:38:22,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:38:22,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250968872] [2019-12-27 06:38:22,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:38:22,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:38:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:38:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:38:22,103 INFO L87 Difference]: Start difference. First operand 351 states and 618 transitions. Second operand 14 states. [2019-12-27 06:38:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:38:22,607 INFO L93 Difference]: Finished difference Result 465 states and 797 transitions. [2019-12-27 06:38:22,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 06:38:22,607 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 06:38:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:38:22,608 INFO L225 Difference]: With dead ends: 465 [2019-12-27 06:38:22,608 INFO L226 Difference]: Without dead ends: 434 [2019-12-27 06:38:22,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:38:22,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-12-27 06:38:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 344. [2019-12-27 06:38:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 06:38:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 604 transitions. [2019-12-27 06:38:22,614 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 604 transitions. Word has length 60 [2019-12-27 06:38:22,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:38:22,615 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 604 transitions. [2019-12-27 06:38:22,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:38:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 604 transitions. [2019-12-27 06:38:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 06:38:22,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:38:22,616 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-27 06:38:22,616 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:38:22,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:38:22,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1060183003, now seen corresponding path program 7 times [2019-12-27 06:38:22,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:38:22,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374362701] [2019-12-27 06:38:22,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:38:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:38:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:38:22,810 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:38:22,810 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:38:22,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~z$r_buff1_thd0~0_47) (= 0 v_~a~0_9) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p3_EAX~0_10) (= |v_#NULL.offset_7| 0) (= v_~z$r_buff0_thd3~0_20 0) (= v_~z$mem_tmp~0_11 0) (= v_~z$r_buff0_thd1~0_8 0) (= v_~z$r_buff1_thd1~0_8 0) (< 0 |v_#StackHeapBarrier_21|) (= 0 v_~z$r_buff1_thd4~0_16) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~b~0_11 0) (= 0 |v_ULTIMATE.start_main_~#t1245~0.offset_16|) (= 0 v_~z$w_buff1~0_22) (= 0 v_~z$flush_delayed~0_16) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1245~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1245~0.base_19|) |v_ULTIMATE.start_main_~#t1245~0.offset_16| 0)) |v_#memory_int_25|) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$w_buff1_used~0_62) (= v_~z$r_buff0_thd4~0_24 0) (= 0 v_~weak$$choice2~0_33) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1245~0.base_19| 4)) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 0 |v_#NULL.base_7|) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1245~0.base_19|) (= v_~z~0_27 0) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1245~0.base_19| 1)) (= v_~y~0_10 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1245~0.base_19|) 0) (= 0 v_~z$w_buff0~0_25) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 v_~__unbuffered_p3_EBX~0_10))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_12|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_10|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~a~0=v_~a~0_9, ULTIMATE.start_main_~#t1246~0.offset=|v_ULTIMATE.start_main_~#t1246~0.offset_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_62, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ULTIMATE.start_main_~#t1246~0.base=|v_ULTIMATE.start_main_~#t1246~0.base_22|, ULTIMATE.start_main_~#t1247~0.base=|v_ULTIMATE.start_main_~#t1247~0.base_21|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ULTIMATE.start_main_~#t1245~0.offset=|v_ULTIMATE.start_main_~#t1245~0.offset_16|, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t1245~0.base=|v_ULTIMATE.start_main_~#t1245~0.base_19|, ULTIMATE.start_main_~#t1248~0.base=|v_ULTIMATE.start_main_~#t1248~0.base_22|, ULTIMATE.start_main_~#t1247~0.offset=|v_ULTIMATE.start_main_~#t1247~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_13|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~z$w_buff1~0=v_~z$w_buff1~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ~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_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_8|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_~#t1248~0.offset=|v_ULTIMATE.start_main_~#t1248~0.offset_17|, ~b~0=v_~b~0_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ULTIMATE.start_main_~#t1246~0.offset, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~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, ULTIMATE.start_main_~#t1246~0.base, ULTIMATE.start_main_~#t1247~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1245~0.offset, ~x~0, ULTIMATE.start_main_~#t1245~0.base, ULTIMATE.start_main_~#t1248~0.base, ULTIMATE.start_main_~#t1247~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1248~0.offset, ~b~0, 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-27 06:38:22,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L833-1-->L835: Formula: (and (= |v_ULTIMATE.start_main_~#t1246~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1246~0.base_13|)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1246~0.base_13|)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1246~0.base_13| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1246~0.base_13| 4) |v_#length_23|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1246~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1246~0.base_13|) |v_ULTIMATE.start_main_~#t1246~0.offset_11| 1)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1246~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1246~0.offset=|v_ULTIMATE.start_main_~#t1246~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1246~0.base=|v_ULTIMATE.start_main_~#t1246~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1246~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1246~0.base] because there is no mapped edge [2019-12-27 06:38:22,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L835-1-->L837: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1247~0.base_12| 1) |v_#valid_46|) (not (= |v_ULTIMATE.start_main_~#t1247~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1247~0.offset_10| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1247~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1247~0.base_12|) |v_ULTIMATE.start_main_~#t1247~0.offset_10| 2)) |v_#memory_int_17|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1247~0.base_12|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1247~0.base_12|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1247~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1247~0.offset=|v_ULTIMATE.start_main_~#t1247~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1247~0.base=|v_ULTIMATE.start_main_~#t1247~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1247~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1247~0.base] because there is no mapped edge [2019-12-27 06:38:22,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L837-1-->L839: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1248~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t1248~0.base_12| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1248~0.base_12| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1248~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1248~0.offset_10| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1248~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1248~0.base_12|) |v_ULTIMATE.start_main_~#t1248~0.offset_10| 3)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1248~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1248~0.base=|v_ULTIMATE.start_main_~#t1248~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1248~0.offset=|v_ULTIMATE.start_main_~#t1248~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1248~0.base, ULTIMATE.start_main_~#t1248~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 06:38:22,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_15 1) (= v_~z$r_buff0_thd4~0_16 v_~z$r_buff1_thd4~0_10) (= v_~z$r_buff0_thd3~0_15 v_~z$r_buff1_thd3~0_11) (= v_~z$r_buff0_thd0~0_46 v_~z$r_buff1_thd0~0_26)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_16, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_10, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_46, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_15, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 06:38:22,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 1 v_~b~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_6) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_6} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_6, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 06:38:22,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 1 v_~y~0_6) (= 1 v_~x~0_7) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_6, ~x~0=v_~x~0_7, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 06:38:22,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1236109269 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1236109269 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out1236109269| 0) (not .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite11_Out1236109269| ~z$w_buff0_used~0_In1236109269) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1236109269, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1236109269} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1236109269, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1236109269, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1236109269|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 06:38:22,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In277034492 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In277034492 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out277034492| ~z$w_buff1~0_In277034492)) (and (= |P2Thread1of1ForFork2_#t~ite3_Out277034492| ~z~0_In277034492) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In277034492, ~z$w_buff1_used~0=~z$w_buff1_used~0_In277034492, ~z$w_buff1~0=~z$w_buff1~0_In277034492, ~z~0=~z~0_In277034492} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out277034492|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In277034492, ~z$w_buff1_used~0=~z$w_buff1_used~0_In277034492, ~z$w_buff1~0=~z$w_buff1~0_In277034492, ~z~0=~z~0_In277034492} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:38:22,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In2043379882 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2043379882 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In2043379882 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In2043379882 256)))) (or (and (= ~z$w_buff1_used~0_In2043379882 |P3Thread1of1ForFork3_#t~ite12_Out2043379882|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite12_Out2043379882| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2043379882, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2043379882, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2043379882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2043379882} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2043379882, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2043379882, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2043379882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2043379882, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out2043379882|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 06:38:22,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1379507482 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1379507482 256)))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out1379507482 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out1379507482 ~z$r_buff0_thd4~0_In1379507482)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1379507482, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1379507482} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1379507482, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1379507482, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1379507482|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 06:38:22,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In1084524133 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1084524133 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1084524133 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1084524133 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out1084524133|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out1084524133| ~z$r_buff1_thd4~0_In1084524133)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1084524133, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1084524133, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1084524133, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1084524133} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1084524133, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1084524133, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1084524133|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1084524133, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1084524133} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 06:38:22,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_11) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_11, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 06:38:22,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 06:38:22,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1335114517 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1335114517 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite5_Out1335114517| ~z$w_buff0_used~0_In1335114517) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out1335114517| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1335114517, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1335114517} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1335114517|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1335114517, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1335114517} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:38:22,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1487586738 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1487586738 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1487586738 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1487586738 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out-1487586738| ~z$w_buff1_used~0_In-1487586738) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite6_Out-1487586738| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1487586738, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1487586738, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1487586738, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1487586738} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1487586738|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1487586738, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1487586738, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1487586738, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1487586738} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:38:22,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1449209705 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1449209705 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-1449209705|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In-1449209705 |P2Thread1of1ForFork2_#t~ite7_Out-1449209705|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1449209705, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1449209705} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1449209705, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1449209705, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1449209705|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:38:22,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1641309820 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1641309820 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1641309820 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1641309820 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-1641309820 |P2Thread1of1ForFork2_#t~ite8_Out-1641309820|)) (and (= |P2Thread1of1ForFork2_#t~ite8_Out-1641309820| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1641309820, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1641309820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1641309820, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1641309820} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1641309820, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1641309820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1641309820, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1641309820, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1641309820|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:38:22,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~z$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork2_#t~ite8_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:38:22,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 06:38:22,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1837251619 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1837251619 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1837251619 |ULTIMATE.start_main_#t~ite19_Out-1837251619|) (not .cse1)) (and (= ~z~0_In-1837251619 |ULTIMATE.start_main_#t~ite19_Out-1837251619|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1837251619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1837251619, ~z$w_buff1~0=~z$w_buff1~0_In-1837251619, ~z~0=~z~0_In-1837251619} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1837251619|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1837251619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1837251619, ~z$w_buff1~0=~z$w_buff1~0_In-1837251619, ~z~0=~z~0_In-1837251619} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:38:22,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_16 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_16, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:38:22,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1362517174 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1362517174 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-1362517174| ~z$w_buff0_used~0_In-1362517174) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-1362517174| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1362517174, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1362517174} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1362517174, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1362517174, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1362517174|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:38:22,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-606838509 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-606838509 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-606838509 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-606838509 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-606838509| ~z$w_buff1_used~0_In-606838509) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite22_Out-606838509| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-606838509, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-606838509, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-606838509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-606838509} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-606838509, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-606838509, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-606838509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-606838509, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-606838509|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:38:22,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1368356189 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1368356189 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1368356189 |ULTIMATE.start_main_#t~ite23_Out1368356189|)) (and (= |ULTIMATE.start_main_#t~ite23_Out1368356189| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1368356189, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1368356189} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1368356189, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1368356189, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1368356189|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:38:22,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1242976023 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1242976023 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1242976023 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1242976023 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite24_Out-1242976023| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In-1242976023 |ULTIMATE.start_main_#t~ite24_Out-1242976023|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1242976023, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1242976023, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1242976023, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1242976023} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1242976023, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1242976023, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1242976023, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1242976023|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1242976023} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 06:38:22,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L860-->L860-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1218030192 256) 0))) (or (and (= ~z$w_buff1_used~0_In1218030192 |ULTIMATE.start_main_#t~ite39_Out1218030192|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1218030192 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1218030192 256)) (and (= 0 (mod ~z$w_buff1_used~0_In1218030192 256)) .cse0) (and (= 0 (mod ~z$r_buff1_thd0~0_In1218030192 256)) .cse0))) (= |ULTIMATE.start_main_#t~ite40_Out1218030192| |ULTIMATE.start_main_#t~ite39_Out1218030192|) .cse1) (and (= |ULTIMATE.start_main_#t~ite39_In1218030192| |ULTIMATE.start_main_#t~ite39_Out1218030192|) (= ~z$w_buff1_used~0_In1218030192 |ULTIMATE.start_main_#t~ite40_Out1218030192|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1218030192, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1218030192, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In1218030192|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1218030192, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1218030192, ~weak$$choice2~0=~weak$$choice2~0_In1218030192} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1218030192, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1218030192|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1218030192|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1218030192, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1218030192, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1218030192, ~weak$$choice2~0=~weak$$choice2~0_In1218030192} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:38:22,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_59 v_~z$r_buff0_thd0~0_60) (not (= (mod v_~weak$$choice2~0_18 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_18, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} 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-27 06:38:22,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L862-->L862-8: Formula: (let ((.cse4 (= |ULTIMATE.start_main_#t~ite45_Out2109845084| |ULTIMATE.start_main_#t~ite46_Out2109845084|)) (.cse1 (= (mod ~z$w_buff1_used~0_In2109845084 256) 0)) (.cse6 (= 0 (mod ~z$r_buff0_thd0~0_In2109845084 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In2109845084 256))) (.cse5 (= 0 (mod ~z$w_buff0_used~0_In2109845084 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In2109845084 256)))) (or (let ((.cse2 (not .cse6))) (and (= |ULTIMATE.start_main_#t~ite45_Out2109845084| |ULTIMATE.start_main_#t~ite44_Out2109845084|) .cse0 (or (not .cse1) .cse2) (or .cse2 (not .cse3)) .cse4 (not .cse5) (= 0 |ULTIMATE.start_main_#t~ite44_Out2109845084|))) (and (= |ULTIMATE.start_main_#t~ite44_In2109845084| |ULTIMATE.start_main_#t~ite44_Out2109845084|) (or (and .cse0 .cse4 (= |ULTIMATE.start_main_#t~ite45_Out2109845084| ~z$r_buff1_thd0~0_In2109845084) (or (and .cse6 .cse1) (and .cse6 .cse3) .cse5)) (and (= |ULTIMATE.start_main_#t~ite45_In2109845084| |ULTIMATE.start_main_#t~ite45_Out2109845084|) (= |ULTIMATE.start_main_#t~ite46_Out2109845084| ~z$r_buff1_thd0~0_In2109845084) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2109845084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2109845084, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2109845084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2109845084, ~weak$$choice2~0=~weak$$choice2~0_In2109845084, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In2109845084|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In2109845084|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2109845084, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2109845084, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2109845084, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2109845084, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out2109845084|, ~weak$$choice2~0=~weak$$choice2~0_In2109845084, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2109845084|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2109845084|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:38:22,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L864-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (not (= 0 (mod v_~z$flush_delayed~0_12 256))) (= v_~z~0_23 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:38:22,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:38:22,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:38:22 BasicIcfg [2019-12-27 06:38:22,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:38:22,962 INFO L168 Benchmark]: Toolchain (without parser) took 31979.99 ms. Allocated memory was 136.3 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 99.8 MB in the beginning and 865.4 MB in the end (delta: -765.6 MB). Peak memory consumption was 696.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:38:22,967 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 06:38:22,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.17 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 99.4 MB in the beginning and 151.9 MB in the end (delta: -52.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:38:22,968 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.09 ms. Allocated memory is still 200.8 MB. Free memory was 151.9 MB in the beginning and 149.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:38:22,968 INFO L168 Benchmark]: Boogie Preprocessor took 39.03 ms. Allocated memory is still 200.8 MB. Free memory was 149.1 MB in the beginning and 146.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:38:22,971 INFO L168 Benchmark]: RCFGBuilder took 870.28 ms. Allocated memory is still 200.8 MB. Free memory was 146.2 MB in the beginning and 96.8 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:38:22,972 INFO L168 Benchmark]: TraceAbstraction took 30162.86 ms. Allocated memory was 200.8 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 96.8 MB in the beginning and 865.4 MB in the end (delta: -768.6 MB). Peak memory consumption was 629.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:38:22,975 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 825.17 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 99.4 MB in the beginning and 151.9 MB in the end (delta: -52.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.09 ms. Allocated memory is still 200.8 MB. Free memory was 151.9 MB in the beginning and 149.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.03 ms. Allocated memory is still 200.8 MB. Free memory was 149.1 MB in the beginning and 146.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 870.28 ms. Allocated memory is still 200.8 MB. Free memory was 146.2 MB in the beginning and 96.8 MB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30162.86 ms. Allocated memory was 200.8 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 96.8 MB in the beginning and 865.4 MB in the end (delta: -768.6 MB). Peak memory consumption was 629.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 181 ProgramPointsBefore, 93 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4801 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54567 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1248, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.8s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2136 SDtfs, 2575 SDslu, 7004 SDs, 0 SdLazy, 3235 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 37 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50070occurred 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: 9.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 9547 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 928 NumberOfCodeBlocks, 928 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 849 ConstructedInterpolants, 0 QuantifiedInterpolants, 197313 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...