/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/mix042_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:24:51,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:24:51,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:24:51,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:24:51,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:24:51,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:24:51,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:24:51,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:24:51,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:24:51,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:24:51,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:24:51,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:24:51,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:24:51,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:24:51,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:24:51,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:24:51,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:24:51,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:24:51,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:24:51,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:24:51,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:24:51,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:24:51,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:24:51,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:24:51,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:24:51,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:24:51,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:24:51,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:24:51,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:24:51,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:24:51,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:24:51,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:24:51,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:24:51,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:24:51,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:24:51,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:24:51,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:24:51,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:24:51,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:24:51,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:24:51,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:24:51,720 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-18 21:24:51,745 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:24:51,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:24:51,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:24:51,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:24:51,747 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:24:51,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:24:51,747 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:24:51,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:24:51,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:24:51,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:24:51,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:24:51,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:24:51,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:24:51,748 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:24:51,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:24:51,749 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:24:51,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:24:51,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:24:51,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:24:51,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:24:51,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:24:51,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:24:51,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:24:51,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:24:51,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:24:51,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:24:51,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:24:51,751 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:24:51,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:24:51,752 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:24:52,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:24:52,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:24:52,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:24:52,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:24:52,038 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:24:52,039 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2019-12-18 21:24:52,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4b36a679/1e07c802d6954973afaeb7fb4e9d8482/FLAGa04a20f9a [2019-12-18 21:24:52,755 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:24:52,757 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.opt.i [2019-12-18 21:24:52,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4b36a679/1e07c802d6954973afaeb7fb4e9d8482/FLAGa04a20f9a [2019-12-18 21:24:52,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4b36a679/1e07c802d6954973afaeb7fb4e9d8482 [2019-12-18 21:24:52,984 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:24:52,986 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:24:52,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:24:52,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:24:52,991 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:24:52,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:24:52" (1/1) ... [2019-12-18 21:24:52,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e380f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:52, skipping insertion in model container [2019-12-18 21:24:52,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:24:52" (1/1) ... [2019-12-18 21:24:53,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:24:53,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:24:53,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:24:53,604 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:24:53,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:24:53,747 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:24:53,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:53 WrapperNode [2019-12-18 21:24:53,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:24:53,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:24:53,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:24:53,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:24:53,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:53" (1/1) ... [2019-12-18 21:24:53,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:53" (1/1) ... [2019-12-18 21:24:53,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:24:53,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:24:53,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:24:53,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:24:53,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:53" (1/1) ... [2019-12-18 21:24:53,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:53" (1/1) ... [2019-12-18 21:24:53,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:53" (1/1) ... [2019-12-18 21:24:53,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:53" (1/1) ... [2019-12-18 21:24:53,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:53" (1/1) ... [2019-12-18 21:24:53,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:53" (1/1) ... [2019-12-18 21:24:53,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:53" (1/1) ... [2019-12-18 21:24:53,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:24:53,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:24:53,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:24:53,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:24:53,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:24:53,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:24:53,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:24:53,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:24:53,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:24:53,930 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:24:53,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:24:53,931 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:24:53,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:24:53,931 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:24:53,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:24:53,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:24:53,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:24:53,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:24:53,933 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:24:54,686 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:24:54,686 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:24:54,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:24:54 BoogieIcfgContainer [2019-12-18 21:24:54,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:24:54,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:24:54,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:24:54,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:24:54,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:24:52" (1/3) ... [2019-12-18 21:24:54,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197264c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:24:54, skipping insertion in model container [2019-12-18 21:24:54,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:53" (2/3) ... [2019-12-18 21:24:54,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197264c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:24:54, skipping insertion in model container [2019-12-18 21:24:54,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:24:54" (3/3) ... [2019-12-18 21:24:54,696 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_rmo.opt.i [2019-12-18 21:24:54,706 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:24:54,707 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:24:54,714 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:24:54,715 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:24:54,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,753 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,753 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,755 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,755 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,764 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,765 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,765 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,765 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,766 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,776 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,777 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,783 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,784 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,785 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,788 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,789 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:54,830 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:24:54,848 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:24:54,848 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:24:54,848 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:24:54,848 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:24:54,849 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:24:54,849 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:24:54,849 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:24:54,849 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:24:54,867 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 21:24:54,870 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 21:24:54,955 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 21:24:54,956 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:24:54,975 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:24:54,997 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 21:24:55,084 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 21:24:55,085 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:24:55,094 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:24:55,111 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 21:24:55,112 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:24:58,670 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 21:24:58,797 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 21:24:58,823 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50879 [2019-12-18 21:24:58,823 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 21:24:58,828 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 85 transitions [2019-12-18 21:24:59,630 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-18 21:24:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-18 21:24:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:24:59,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:59,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:59,639 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:59,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:59,645 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-18 21:24:59,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:59,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373274279] [2019-12-18 21:24:59,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:59,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:59,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373274279] [2019-12-18 21:24:59,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:59,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:24:59,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643170963] [2019-12-18 21:24:59,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:24:59,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:59,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:24:59,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:59,906 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-18 21:25:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:00,259 INFO L93 Difference]: Finished difference Result 14182 states and 52796 transitions. [2019-12-18 21:25:00,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:00,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:25:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:00,416 INFO L225 Difference]: With dead ends: 14182 [2019-12-18 21:25:00,416 INFO L226 Difference]: Without dead ends: 13870 [2019-12-18 21:25:00,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-18 21:25:01,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-18 21:25:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-18 21:25:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 51678 transitions. [2019-12-18 21:25:01,800 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 51678 transitions. Word has length 7 [2019-12-18 21:25:01,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:01,802 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 51678 transitions. [2019-12-18 21:25:01,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 51678 transitions. [2019-12-18 21:25:01,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:25:01,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:01,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:01,808 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:01,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:01,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-18 21:25:01,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:01,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521172729] [2019-12-18 21:25:01,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:01,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521172729] [2019-12-18 21:25:01,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:01,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:01,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441759868] [2019-12-18 21:25:01,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:25:01,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:01,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:25:01,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:25:01,935 INFO L87 Difference]: Start difference. First operand 13870 states and 51678 transitions. Second operand 4 states. [2019-12-18 21:25:02,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:02,298 INFO L93 Difference]: Finished difference Result 19034 states and 68884 transitions. [2019-12-18 21:25:02,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:25:02,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:25:02,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:02,378 INFO L225 Difference]: With dead ends: 19034 [2019-12-18 21:25:02,378 INFO L226 Difference]: Without dead ends: 19034 [2019-12-18 21:25:02,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-18 21:25:03,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-18 21:25:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-18 21:25:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68123 transitions. [2019-12-18 21:25:03,145 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68123 transitions. Word has length 13 [2019-12-18 21:25:03,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:03,146 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68123 transitions. [2019-12-18 21:25:03,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:25:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68123 transitions. [2019-12-18 21:25:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:25:03,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:03,149 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:03,149 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:03,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:03,150 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-18 21:25:03,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:03,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134743262] [2019-12-18 21:25:03,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:03,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134743262] [2019-12-18 21:25:03,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:03,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:03,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247738750] [2019-12-18 21:25:03,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:25:03,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:03,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:25:03,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:25:03,222 INFO L87 Difference]: Start difference. First operand 18800 states and 68123 transitions. Second operand 4 states. [2019-12-18 21:25:04,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:04,310 INFO L93 Difference]: Finished difference Result 27022 states and 95920 transitions. [2019-12-18 21:25:04,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:25:04,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:25:04,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:04,394 INFO L225 Difference]: With dead ends: 27022 [2019-12-18 21:25:04,394 INFO L226 Difference]: Without dead ends: 27008 [2019-12-18 21:25:04,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-18 21:25:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22014. [2019-12-18 21:25:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22014 states. [2019-12-18 21:25:05,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22014 states to 22014 states and 79478 transitions. [2019-12-18 21:25:05,248 INFO L78 Accepts]: Start accepts. Automaton has 22014 states and 79478 transitions. Word has length 13 [2019-12-18 21:25:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:05,248 INFO L462 AbstractCegarLoop]: Abstraction has 22014 states and 79478 transitions. [2019-12-18 21:25:05,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:25:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 22014 states and 79478 transitions. [2019-12-18 21:25:05,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 21:25:05,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:05,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:05,256 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:05,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:05,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-18 21:25:05,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:05,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930646731] [2019-12-18 21:25:05,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:05,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930646731] [2019-12-18 21:25:05,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:05,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:25:05,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930751217] [2019-12-18 21:25:05,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:25:05,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:05,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:25:05,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:05,342 INFO L87 Difference]: Start difference. First operand 22014 states and 79478 transitions. Second operand 5 states. [2019-12-18 21:25:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:05,862 INFO L93 Difference]: Finished difference Result 29780 states and 105415 transitions. [2019-12-18 21:25:05,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:25:05,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 21:25:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:05,935 INFO L225 Difference]: With dead ends: 29780 [2019-12-18 21:25:05,935 INFO L226 Difference]: Without dead ends: 29766 [2019-12-18 21:25:05,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:25:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29766 states. [2019-12-18 21:25:06,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29766 to 21918. [2019-12-18 21:25:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21918 states. [2019-12-18 21:25:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21918 states to 21918 states and 78970 transitions. [2019-12-18 21:25:06,727 INFO L78 Accepts]: Start accepts. Automaton has 21918 states and 78970 transitions. Word has length 19 [2019-12-18 21:25:06,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:06,727 INFO L462 AbstractCegarLoop]: Abstraction has 21918 states and 78970 transitions. [2019-12-18 21:25:06,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:25:06,727 INFO L276 IsEmpty]: Start isEmpty. Operand 21918 states and 78970 transitions. [2019-12-18 21:25:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:25:06,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:06,751 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] [2019-12-18 21:25:06,751 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:06,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:06,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1048489812, now seen corresponding path program 1 times [2019-12-18 21:25:06,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:06,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496189847] [2019-12-18 21:25:06,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:06,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496189847] [2019-12-18 21:25:06,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:06,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:25:06,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453859743] [2019-12-18 21:25:06,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:25:06,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:06,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:25:06,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:25:06,862 INFO L87 Difference]: Start difference. First operand 21918 states and 78970 transitions. Second operand 4 states. [2019-12-18 21:25:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:06,940 INFO L93 Difference]: Finished difference Result 13150 states and 40780 transitions. [2019-12-18 21:25:06,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:25:06,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-18 21:25:06,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:06,959 INFO L225 Difference]: With dead ends: 13150 [2019-12-18 21:25:06,959 INFO L226 Difference]: Without dead ends: 12620 [2019-12-18 21:25:06,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:07,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12620 states. [2019-12-18 21:25:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12620 to 12620. [2019-12-18 21:25:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12620 states. [2019-12-18 21:25:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12620 states to 12620 states and 39274 transitions. [2019-12-18 21:25:08,052 INFO L78 Accepts]: Start accepts. Automaton has 12620 states and 39274 transitions. Word has length 27 [2019-12-18 21:25:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:08,052 INFO L462 AbstractCegarLoop]: Abstraction has 12620 states and 39274 transitions. [2019-12-18 21:25:08,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:25:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 12620 states and 39274 transitions. [2019-12-18 21:25:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 21:25:08,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:08,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:08,062 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:08,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:08,062 INFO L82 PathProgramCache]: Analyzing trace with hash -173751725, now seen corresponding path program 1 times [2019-12-18 21:25:08,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:08,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166793070] [2019-12-18 21:25:08,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:08,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:08,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166793070] [2019-12-18 21:25:08,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:08,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:25:08,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322455020] [2019-12-18 21:25:08,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:25:08,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:08,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:25:08,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:25:08,173 INFO L87 Difference]: Start difference. First operand 12620 states and 39274 transitions. Second operand 6 states. [2019-12-18 21:25:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:08,575 INFO L93 Difference]: Finished difference Result 17774 states and 54068 transitions. [2019-12-18 21:25:08,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:25:08,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 21:25:08,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:08,600 INFO L225 Difference]: With dead ends: 17774 [2019-12-18 21:25:08,600 INFO L226 Difference]: Without dead ends: 17758 [2019-12-18 21:25:08,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:25:08,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17758 states. [2019-12-18 21:25:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17758 to 15419. [2019-12-18 21:25:08,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15419 states. [2019-12-18 21:25:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15419 states to 15419 states and 47344 transitions. [2019-12-18 21:25:08,871 INFO L78 Accepts]: Start accepts. Automaton has 15419 states and 47344 transitions. Word has length 28 [2019-12-18 21:25:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:08,871 INFO L462 AbstractCegarLoop]: Abstraction has 15419 states and 47344 transitions. [2019-12-18 21:25:08,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:25:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 15419 states and 47344 transitions. [2019-12-18 21:25:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 21:25:08,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:08,884 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] [2019-12-18 21:25:08,885 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:08,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:08,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1496615068, now seen corresponding path program 1 times [2019-12-18 21:25:08,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:08,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012981271] [2019-12-18 21:25:08,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:08,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012981271] [2019-12-18 21:25:08,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:08,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:25:08,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869424817] [2019-12-18 21:25:08,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:08,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:08,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:08,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:08,961 INFO L87 Difference]: Start difference. First operand 15419 states and 47344 transitions. Second operand 3 states. [2019-12-18 21:25:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:09,241 INFO L93 Difference]: Finished difference Result 19451 states and 60048 transitions. [2019-12-18 21:25:09,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:09,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-18 21:25:09,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:09,275 INFO L225 Difference]: With dead ends: 19451 [2019-12-18 21:25:09,275 INFO L226 Difference]: Without dead ends: 19451 [2019-12-18 21:25:09,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19451 states. [2019-12-18 21:25:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19451 to 17233. [2019-12-18 21:25:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17233 states. [2019-12-18 21:25:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17233 states to 17233 states and 53543 transitions. [2019-12-18 21:25:09,552 INFO L78 Accepts]: Start accepts. Automaton has 17233 states and 53543 transitions. Word has length 34 [2019-12-18 21:25:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:09,553 INFO L462 AbstractCegarLoop]: Abstraction has 17233 states and 53543 transitions. [2019-12-18 21:25:09,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 17233 states and 53543 transitions. [2019-12-18 21:25:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 21:25:09,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:09,566 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] [2019-12-18 21:25:09,566 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1228654752, now seen corresponding path program 1 times [2019-12-18 21:25:09,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:09,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044251068] [2019-12-18 21:25:09,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:09,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044251068] [2019-12-18 21:25:09,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:09,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:25:09,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554689635] [2019-12-18 21:25:09,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:25:09,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:09,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:25:09,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:09,639 INFO L87 Difference]: Start difference. First operand 17233 states and 53543 transitions. Second operand 5 states. [2019-12-18 21:25:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:09,690 INFO L93 Difference]: Finished difference Result 2566 states and 6050 transitions. [2019-12-18 21:25:09,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:25:09,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 21:25:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:09,694 INFO L225 Difference]: With dead ends: 2566 [2019-12-18 21:25:09,694 INFO L226 Difference]: Without dead ends: 2257 [2019-12-18 21:25:09,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:25:09,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2019-12-18 21:25:09,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2019-12-18 21:25:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2019-12-18 21:25:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 5189 transitions. [2019-12-18 21:25:09,725 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 5189 transitions. Word has length 34 [2019-12-18 21:25:09,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:09,726 INFO L462 AbstractCegarLoop]: Abstraction has 2257 states and 5189 transitions. [2019-12-18 21:25:09,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:25:09,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 5189 transitions. [2019-12-18 21:25:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:25:09,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:09,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:09,730 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:09,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:09,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2015633809, now seen corresponding path program 1 times [2019-12-18 21:25:09,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:09,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377797830] [2019-12-18 21:25:09,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:09,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:09,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377797830] [2019-12-18 21:25:09,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:09,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:25:09,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697710896] [2019-12-18 21:25:09,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:25:09,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:09,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:25:09,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:25:09,830 INFO L87 Difference]: Start difference. First operand 2257 states and 5189 transitions. Second operand 7 states. [2019-12-18 21:25:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:10,328 INFO L93 Difference]: Finished difference Result 2798 states and 6246 transitions. [2019-12-18 21:25:10,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 21:25:10,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-18 21:25:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:10,333 INFO L225 Difference]: With dead ends: 2798 [2019-12-18 21:25:10,334 INFO L226 Difference]: Without dead ends: 2796 [2019-12-18 21:25:10,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:25:10,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2019-12-18 21:25:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2367. [2019-12-18 21:25:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2019-12-18 21:25:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 5412 transitions. [2019-12-18 21:25:10,364 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 5412 transitions. Word has length 40 [2019-12-18 21:25:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:10,364 INFO L462 AbstractCegarLoop]: Abstraction has 2367 states and 5412 transitions. [2019-12-18 21:25:10,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:25:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 5412 transitions. [2019-12-18 21:25:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:25:10,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:10,367 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] [2019-12-18 21:25:10,367 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:10,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:10,368 INFO L82 PathProgramCache]: Analyzing trace with hash 517881523, now seen corresponding path program 1 times [2019-12-18 21:25:10,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:10,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341451280] [2019-12-18 21:25:10,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:10,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341451280] [2019-12-18 21:25:10,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:10,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:25:10,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67651862] [2019-12-18 21:25:10,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:25:10,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:10,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:25:10,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:10,448 INFO L87 Difference]: Start difference. First operand 2367 states and 5412 transitions. Second operand 5 states. [2019-12-18 21:25:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:10,977 INFO L93 Difference]: Finished difference Result 3212 states and 7242 transitions. [2019-12-18 21:25:10,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:25:10,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-18 21:25:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:10,981 INFO L225 Difference]: With dead ends: 3212 [2019-12-18 21:25:10,981 INFO L226 Difference]: Without dead ends: 3212 [2019-12-18 21:25:10,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:25:10,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2019-12-18 21:25:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 2933. [2019-12-18 21:25:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2933 states. [2019-12-18 21:25:11,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 6685 transitions. [2019-12-18 21:25:11,009 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 6685 transitions. Word has length 44 [2019-12-18 21:25:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:11,009 INFO L462 AbstractCegarLoop]: Abstraction has 2933 states and 6685 transitions. [2019-12-18 21:25:11,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:25:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 6685 transitions. [2019-12-18 21:25:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 21:25:11,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:11,015 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] [2019-12-18 21:25:11,015 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1551487306, now seen corresponding path program 1 times [2019-12-18 21:25:11,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:11,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056610886] [2019-12-18 21:25:11,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:11,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056610886] [2019-12-18 21:25:11,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:11,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:25:11,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206212896] [2019-12-18 21:25:11,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:25:11,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:11,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:25:11,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:25:11,122 INFO L87 Difference]: Start difference. First operand 2933 states and 6685 transitions. Second operand 6 states. [2019-12-18 21:25:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:11,192 INFO L93 Difference]: Finished difference Result 997 states and 2269 transitions. [2019-12-18 21:25:11,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:25:11,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-18 21:25:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:11,194 INFO L225 Difference]: With dead ends: 997 [2019-12-18 21:25:11,194 INFO L226 Difference]: Without dead ends: 927 [2019-12-18 21:25:11,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:25:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-12-18 21:25:11,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 797. [2019-12-18 21:25:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-18 21:25:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1828 transitions. [2019-12-18 21:25:11,205 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1828 transitions. Word has length 45 [2019-12-18 21:25:11,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:11,206 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1828 transitions. [2019-12-18 21:25:11,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:25:11,206 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1828 transitions. [2019-12-18 21:25:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 21:25:11,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:11,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:11,208 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:11,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:11,209 INFO L82 PathProgramCache]: Analyzing trace with hash -442739356, now seen corresponding path program 1 times [2019-12-18 21:25:11,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:11,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358916489] [2019-12-18 21:25:11,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:11,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358916489] [2019-12-18 21:25:11,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:11,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:11,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91244846] [2019-12-18 21:25:11,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:11,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:11,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:11,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:11,335 INFO L87 Difference]: Start difference. First operand 797 states and 1828 transitions. Second operand 3 states. [2019-12-18 21:25:11,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:11,350 INFO L93 Difference]: Finished difference Result 797 states and 1798 transitions. [2019-12-18 21:25:11,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:11,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 21:25:11,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:11,352 INFO L225 Difference]: With dead ends: 797 [2019-12-18 21:25:11,352 INFO L226 Difference]: Without dead ends: 797 [2019-12-18 21:25:11,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:11,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-12-18 21:25:11,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 773. [2019-12-18 21:25:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-18 21:25:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1742 transitions. [2019-12-18 21:25:11,363 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1742 transitions. Word has length 55 [2019-12-18 21:25:11,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:11,364 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1742 transitions. [2019-12-18 21:25:11,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1742 transitions. [2019-12-18 21:25:11,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:25:11,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:11,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:11,367 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:11,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:11,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2116087477, now seen corresponding path program 1 times [2019-12-18 21:25:11,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:11,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44260413] [2019-12-18 21:25:11,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:11,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44260413] [2019-12-18 21:25:11,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:11,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:25:11,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002110422] [2019-12-18 21:25:11,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:25:11,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:25:11,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:25:11,499 INFO L87 Difference]: Start difference. First operand 773 states and 1742 transitions. Second operand 6 states. [2019-12-18 21:25:11,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:11,850 INFO L93 Difference]: Finished difference Result 1056 states and 2387 transitions. [2019-12-18 21:25:11,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 21:25:11,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-18 21:25:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:11,852 INFO L225 Difference]: With dead ends: 1056 [2019-12-18 21:25:11,853 INFO L226 Difference]: Without dead ends: 1056 [2019-12-18 21:25:11,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:25:11,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-12-18 21:25:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 859. [2019-12-18 21:25:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-12-18 21:25:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1943 transitions. [2019-12-18 21:25:11,870 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1943 transitions. Word has length 56 [2019-12-18 21:25:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:11,871 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1943 transitions. [2019-12-18 21:25:11,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:25:11,871 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1943 transitions. [2019-12-18 21:25:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:25:11,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:11,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:11,873 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:11,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:11,875 INFO L82 PathProgramCache]: Analyzing trace with hash 2084977387, now seen corresponding path program 2 times [2019-12-18 21:25:11,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:11,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229782496] [2019-12-18 21:25:11,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:11,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229782496] [2019-12-18 21:25:11,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:11,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:11,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775043740] [2019-12-18 21:25:11,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:11,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:11,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:11,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:11,963 INFO L87 Difference]: Start difference. First operand 859 states and 1943 transitions. Second operand 3 states. [2019-12-18 21:25:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:12,002 INFO L93 Difference]: Finished difference Result 859 states and 1942 transitions. [2019-12-18 21:25:12,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:12,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 21:25:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:12,004 INFO L225 Difference]: With dead ends: 859 [2019-12-18 21:25:12,004 INFO L226 Difference]: Without dead ends: 859 [2019-12-18 21:25:12,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-12-18 21:25:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 604. [2019-12-18 21:25:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 21:25:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1351 transitions. [2019-12-18 21:25:12,015 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1351 transitions. Word has length 56 [2019-12-18 21:25:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:12,017 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1351 transitions. [2019-12-18 21:25:12,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1351 transitions. [2019-12-18 21:25:12,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:25:12,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:12,018 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] [2019-12-18 21:25:12,019 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:12,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:12,019 INFO L82 PathProgramCache]: Analyzing trace with hash 748257012, now seen corresponding path program 1 times [2019-12-18 21:25:12,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:12,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260918705] [2019-12-18 21:25:12,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:12,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260918705] [2019-12-18 21:25:12,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:12,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:25:12,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299808327] [2019-12-18 21:25:12,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:25:12,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:12,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:25:12,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:25:12,502 INFO L87 Difference]: Start difference. First operand 604 states and 1351 transitions. Second operand 14 states. [2019-12-18 21:25:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:13,264 INFO L93 Difference]: Finished difference Result 1117 states and 2316 transitions. [2019-12-18 21:25:13,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 21:25:13,265 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-18 21:25:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:13,266 INFO L225 Difference]: With dead ends: 1117 [2019-12-18 21:25:13,267 INFO L226 Difference]: Without dead ends: 700 [2019-12-18 21:25:13,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:25:13,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-12-18 21:25:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 619. [2019-12-18 21:25:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-12-18 21:25:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 1366 transitions. [2019-12-18 21:25:13,275 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 1366 transitions. Word has length 57 [2019-12-18 21:25:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:13,275 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 1366 transitions. [2019-12-18 21:25:13,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:25:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 1366 transitions. [2019-12-18 21:25:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:25:13,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:13,276 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] [2019-12-18 21:25:13,276 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:13,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1127271004, now seen corresponding path program 2 times [2019-12-18 21:25:13,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:13,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920166693] [2019-12-18 21:25:13,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:13,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920166693] [2019-12-18 21:25:13,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:13,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:25:13,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13908153] [2019-12-18 21:25:13,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:25:13,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:13,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:25:13,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:25:13,401 INFO L87 Difference]: Start difference. First operand 619 states and 1366 transitions. Second operand 6 states. [2019-12-18 21:25:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:13,458 INFO L93 Difference]: Finished difference Result 893 states and 1834 transitions. [2019-12-18 21:25:13,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:25:13,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-18 21:25:13,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:13,460 INFO L225 Difference]: With dead ends: 893 [2019-12-18 21:25:13,460 INFO L226 Difference]: Without dead ends: 542 [2019-12-18 21:25:13,460 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-18 21:25:13,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-12-18 21:25:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2019-12-18 21:25:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-12-18 21:25:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1172 transitions. [2019-12-18 21:25:13,467 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1172 transitions. Word has length 57 [2019-12-18 21:25:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:13,468 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 1172 transitions. [2019-12-18 21:25:13,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:25:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1172 transitions. [2019-12-18 21:25:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:25:13,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:13,469 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] [2019-12-18 21:25:13,469 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:13,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:13,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1731614154, now seen corresponding path program 3 times [2019-12-18 21:25:13,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:13,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969466925] [2019-12-18 21:25:13,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:14,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969466925] [2019-12-18 21:25:14,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:14,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 21:25:14,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427981838] [2019-12-18 21:25:14,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 21:25:14,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:14,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 21:25:14,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:25:14,094 INFO L87 Difference]: Start difference. First operand 542 states and 1172 transitions. Second operand 18 states. [2019-12-18 21:25:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:15,489 INFO L93 Difference]: Finished difference Result 1303 states and 2895 transitions. [2019-12-18 21:25:15,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 21:25:15,490 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-18 21:25:15,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:15,492 INFO L225 Difference]: With dead ends: 1303 [2019-12-18 21:25:15,492 INFO L226 Difference]: Without dead ends: 1273 [2019-12-18 21:25:15,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=1051, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 21:25:15,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2019-12-18 21:25:15,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 724. [2019-12-18 21:25:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-12-18 21:25:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1572 transitions. [2019-12-18 21:25:15,501 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1572 transitions. Word has length 57 [2019-12-18 21:25:15,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:15,501 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1572 transitions. [2019-12-18 21:25:15,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 21:25:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1572 transitions. [2019-12-18 21:25:15,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:25:15,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:15,503 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] [2019-12-18 21:25:15,503 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:15,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:15,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1334743882, now seen corresponding path program 4 times [2019-12-18 21:25:15,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:15,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443445373] [2019-12-18 21:25:15,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:15,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:15,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443445373] [2019-12-18 21:25:15,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:15,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:25:15,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936689612] [2019-12-18 21:25:15,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:25:15,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:15,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:25:15,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:25:15,792 INFO L87 Difference]: Start difference. First operand 724 states and 1572 transitions. Second operand 13 states. [2019-12-18 21:25:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:16,448 INFO L93 Difference]: Finished difference Result 1170 states and 2544 transitions. [2019-12-18 21:25:16,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:25:16,449 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 21:25:16,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:16,451 INFO L225 Difference]: With dead ends: 1170 [2019-12-18 21:25:16,451 INFO L226 Difference]: Without dead ends: 1140 [2019-12-18 21:25:16,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:25:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2019-12-18 21:25:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 784. [2019-12-18 21:25:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-12-18 21:25:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1718 transitions. [2019-12-18 21:25:16,466 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1718 transitions. Word has length 57 [2019-12-18 21:25:16,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:16,466 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1718 transitions. [2019-12-18 21:25:16,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:25:16,467 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1718 transitions. [2019-12-18 21:25:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:25:16,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:16,469 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] [2019-12-18 21:25:16,469 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:16,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:16,469 INFO L82 PathProgramCache]: Analyzing trace with hash -778309658, now seen corresponding path program 5 times [2019-12-18 21:25:16,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:16,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91277196] [2019-12-18 21:25:16,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:16,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91277196] [2019-12-18 21:25:16,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:16,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:25:16,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213137009] [2019-12-18 21:25:16,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:25:16,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:16,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:25:16,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:25:16,838 INFO L87 Difference]: Start difference. First operand 784 states and 1718 transitions. Second operand 14 states. [2019-12-18 21:25:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:17,526 INFO L93 Difference]: Finished difference Result 1158 states and 2512 transitions. [2019-12-18 21:25:17,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:25:17,527 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-18 21:25:17,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:17,529 INFO L225 Difference]: With dead ends: 1158 [2019-12-18 21:25:17,529 INFO L226 Difference]: Without dead ends: 1128 [2019-12-18 21:25:17,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2019-12-18 21:25:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-12-18 21:25:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 780. [2019-12-18 21:25:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-18 21:25:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1708 transitions. [2019-12-18 21:25:17,539 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1708 transitions. Word has length 57 [2019-12-18 21:25:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:17,539 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1708 transitions. [2019-12-18 21:25:17,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:25:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1708 transitions. [2019-12-18 21:25:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:25:17,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:17,540 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] [2019-12-18 21:25:17,540 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:17,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash -109693258, now seen corresponding path program 6 times [2019-12-18 21:25:17,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:17,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578153378] [2019-12-18 21:25:17,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:25:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:25:17,652 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:25:17,652 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:25:17,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~y$r_buff1_thd3~0_21) (= v_~main$tmp_guard0~0_10 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~y$w_buff1_used~0_72 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1120~0.base_27|) (= 0 |v_ULTIMATE.start_main_~#t1120~0.offset_21|) (= 0 v_~y$w_buff1~0_27) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff0_thd1~0_11 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~a~0_11 0) (= v_~z~0_11 0) (= v_~main$tmp_guard1~0_11 0) (= v_~y$read_delayed~0_8 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1120~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1120~0.base_27|) |v_ULTIMATE.start_main_~#t1120~0.offset_21| 0)) |v_#memory_int_15|) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~x~0_9) (= 0 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_28 0) (= 0 v_~y$r_buff1_thd2~0_21) (= v_~y$mem_tmp~0_11 0) (= v_~y$r_buff0_thd0~0_85 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (< 0 |v_#StackHeapBarrier_14|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1120~0.base_27|) 0) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~y$w_buff0~0_27) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1120~0.base_27| 4) |v_#length_19|) (= 0 v_~y$read_delayed_var~0.base_8) (= (store .cse0 |v_ULTIMATE.start_main_~#t1120~0.base_27| 1) |v_#valid_54|) (= v_~y~0_26 0) (= 0 v_~__unbuffered_cnt~0_18) (= v_~y$r_buff0_thd2~0_22 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16) (= 0 v_~y$r_buff1_thd0~0_53))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, ULTIMATE.start_main_~#t1121~0.base=|v_ULTIMATE.start_main_~#t1121~0.base_26|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_16|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_~#t1122~0.base=|v_ULTIMATE.start_main_~#t1122~0.base_21|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_~#t1120~0.offset=|v_ULTIMATE.start_main_~#t1120~0.offset_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y~0=v_~y~0_26, ULTIMATE.start_main_~#t1122~0.offset=|v_ULTIMATE.start_main_~#t1122~0.offset_16|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_14|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ULTIMATE.start_main_~#t1120~0.base=|v_ULTIMATE.start_main_~#t1120~0.base_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_~#t1121~0.offset=|v_ULTIMATE.start_main_~#t1121~0.offset_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_72} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1121~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1122~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1120~0.offset, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1122~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1120~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1121~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:25:17,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1121~0.base_9| 1) |v_#valid_27|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1121~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1121~0.base_9|) |v_ULTIMATE.start_main_~#t1121~0.offset_8| 1)) |v_#memory_int_9|) (= 0 |v_ULTIMATE.start_main_~#t1121~0.offset_8|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1121~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1121~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1121~0.base_9| 0)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1121~0.base_9|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1121~0.offset=|v_ULTIMATE.start_main_~#t1121~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1121~0.base=|v_ULTIMATE.start_main_~#t1121~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1121~0.offset, ULTIMATE.start_main_~#t1121~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 21:25:17,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1122~0.base_10| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t1122~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1122~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1122~0.base_10|) |v_ULTIMATE.start_main_~#t1122~0.offset_10| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1122~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1122~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1122~0.base_10|)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1122~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1122~0.offset=|v_ULTIMATE.start_main_~#t1122~0.offset_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1122~0.base=|v_ULTIMATE.start_main_~#t1122~0.base_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1122~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1122~0.base, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 21:25:17,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L4-->L789: Formula: (and (not (= P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-2057155690 0)) (= ~y$r_buff0_thd3~0_In-2057155690 ~y$r_buff1_thd3~0_Out-2057155690) (= ~__unbuffered_p2_EBX~0_Out-2057155690 ~a~0_In-2057155690) (= 1 ~z~0_Out-2057155690) (= ~y$r_buff0_thd1~0_In-2057155690 ~y$r_buff1_thd1~0_Out-2057155690) (= ~__unbuffered_p2_EAX~0_Out-2057155690 ~z~0_Out-2057155690) (= ~y$r_buff1_thd0~0_Out-2057155690 ~y$r_buff0_thd0~0_In-2057155690) (= 1 ~y$r_buff0_thd3~0_Out-2057155690) (= ~y$r_buff1_thd2~0_Out-2057155690 ~y$r_buff0_thd2~0_In-2057155690)) InVars {~a~0=~a~0_In-2057155690, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2057155690, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2057155690, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2057155690, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2057155690, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-2057155690} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out-2057155690, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In-2057155690, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-2057155690, ~a~0=~a~0_In-2057155690, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-2057155690, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-2057155690, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2057155690, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2057155690, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2057155690, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2057155690, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out-2057155690, ~z~0=~z~0_Out-2057155690, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-2057155690} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:25:17,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= 1 v_~a~0_6) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_5) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~a~0=v_~a~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_5, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 21:25:17,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1983614243 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1983614243 256) 0)) (.cse2 (= |P1Thread1of1ForFork0_#t~ite3_Out1983614243| |P1Thread1of1ForFork0_#t~ite4_Out1983614243|))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1983614243 |P1Thread1of1ForFork0_#t~ite3_Out1983614243|) .cse2) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite3_Out1983614243| ~y~0_In1983614243) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1983614243, ~y$w_buff1~0=~y$w_buff1~0_In1983614243, ~y~0=~y~0_In1983614243, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1983614243} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1983614243, ~y$w_buff1~0=~y$w_buff1~0_In1983614243, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out1983614243|, ~y~0=~y~0_In1983614243, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out1983614243|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1983614243} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 21:25:17,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1432063363 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1432063363 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite11_Out-1432063363|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite11_Out-1432063363| ~y$w_buff0_used~0_In-1432063363)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1432063363, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1432063363} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1432063363, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-1432063363|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1432063363} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:25:17,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1723467215 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1723467215 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1723467215 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1723467215 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite12_Out1723467215|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1723467215 |P2Thread1of1ForFork1_#t~ite12_Out1723467215|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1723467215, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1723467215, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1723467215, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1723467215} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1723467215, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1723467215, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1723467215, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1723467215|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1723467215} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:25:17,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-832657926 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-832657926 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In-832657926 ~y$r_buff0_thd3~0_Out-832657926)) (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-832657926)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-832657926, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-832657926} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out-832657926|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-832657926, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-832657926} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:25:17,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In996196459 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In996196459 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In996196459 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In996196459 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite14_Out996196459|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite14_Out996196459| ~y$r_buff1_thd3~0_In996196459) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In996196459, ~y$w_buff0_used~0=~y$w_buff0_used~0_In996196459, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In996196459, ~y$w_buff1_used~0=~y$w_buff1_used~0_In996196459} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out996196459|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In996196459, ~y$w_buff0_used~0=~y$w_buff0_used~0_In996196459, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In996196459, ~y$w_buff1_used~0=~y$w_buff1_used~0_In996196459} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:25:17,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 21:25:17,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-522772063 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-522772063 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite5_Out-522772063| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite5_Out-522772063| ~y$w_buff0_used~0_In-522772063) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-522772063, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-522772063} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-522772063, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-522772063, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-522772063|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:25:17,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-435724343 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-435724343 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-435724343 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-435724343 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite6_Out-435724343| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite6_Out-435724343| ~y$w_buff1_used~0_In-435724343)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-435724343, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-435724343, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-435724343, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-435724343} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-435724343, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-435724343, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-435724343, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out-435724343|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-435724343} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:25:17,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1257033419 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1257033419 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1257033419 |P1Thread1of1ForFork0_#t~ite7_Out-1257033419|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite7_Out-1257033419|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1257033419, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1257033419} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1257033419, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1257033419, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out-1257033419|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 21:25:17,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In221946809 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In221946809 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In221946809 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In221946809 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite8_Out221946809| ~y$r_buff1_thd2~0_In221946809) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite8_Out221946809| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In221946809, ~y$w_buff0_used~0=~y$w_buff0_used~0_In221946809, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In221946809, ~y$w_buff1_used~0=~y$w_buff1_used~0_In221946809} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In221946809, ~y$w_buff0_used~0=~y$w_buff0_used~0_In221946809, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In221946809, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out221946809|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In221946809} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:25:17,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L758-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd2~0_16) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 21:25:17,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$w_buff0_used~0_89 256)) (= 0 (mod v_~y$r_buff0_thd0~0_67 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:25:17,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite19_Out437405289| |ULTIMATE.start_main_#t~ite18_Out437405289|)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In437405289 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In437405289 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite18_Out437405289| ~y$w_buff1~0_In437405289)) (and (= |ULTIMATE.start_main_#t~ite18_Out437405289| ~y~0_In437405289) .cse1 (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In437405289, ~y~0=~y~0_In437405289, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In437405289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In437405289} OutVars{~y$w_buff1~0=~y$w_buff1~0_In437405289, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out437405289|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out437405289|, ~y~0=~y~0_In437405289, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In437405289, ~y$w_buff1_used~0=~y$w_buff1_used~0_In437405289} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:25:17,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In239988643 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In239988643 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out239988643| ~y$w_buff0_used~0_In239988643)) (and (= |ULTIMATE.start_main_#t~ite20_Out239988643| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In239988643, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In239988643} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In239988643, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In239988643, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out239988643|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:25:17,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-2033851894 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2033851894 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-2033851894 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2033851894 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-2033851894| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-2033851894 |ULTIMATE.start_main_#t~ite21_Out-2033851894|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2033851894, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2033851894, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2033851894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2033851894} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2033851894, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2033851894, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-2033851894|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2033851894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2033851894} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:25:17,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-520335020 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-520335020 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-520335020| ~y$r_buff0_thd0~0_In-520335020) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite22_Out-520335020|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-520335020, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-520335020} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-520335020, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-520335020, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-520335020|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:25:17,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1880098780 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1880098780 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1880098780 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1880098780 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite23_Out-1880098780| 0)) (and (= |ULTIMATE.start_main_#t~ite23_Out-1880098780| ~y$r_buff1_thd0~0_In-1880098780) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1880098780, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1880098780, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1880098780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1880098780} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1880098780, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1880098780, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1880098780, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1880098780|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1880098780} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:25:17,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L834-->L834-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1885600430 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1885600430 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-1885600430 256)) .cse1) (and (= (mod ~y$r_buff1_thd0~0_In-1885600430 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-1885600430 256) 0))) (= ~y$w_buff0~0_In-1885600430 |ULTIMATE.start_main_#t~ite29_Out-1885600430|) (= |ULTIMATE.start_main_#t~ite29_Out-1885600430| |ULTIMATE.start_main_#t~ite30_Out-1885600430|)) (and (= ~y$w_buff0~0_In-1885600430 |ULTIMATE.start_main_#t~ite30_Out-1885600430|) (= |ULTIMATE.start_main_#t~ite29_In-1885600430| |ULTIMATE.start_main_#t~ite29_Out-1885600430|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1885600430, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-1885600430|, ~y$w_buff0~0=~y$w_buff0~0_In-1885600430, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1885600430, ~weak$$choice2~0=~weak$$choice2~0_In-1885600430, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1885600430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1885600430} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-1885600430|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1885600430, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1885600430|, ~y$w_buff0~0=~y$w_buff0~0_In-1885600430, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1885600430, ~weak$$choice2~0=~weak$$choice2~0_In-1885600430, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1885600430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1885600430} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 21:25:17,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L836-->L836-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-54969468 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-54969468 256)))) (or (= (mod ~y$w_buff0_used~0_In-54969468 256) 0) (and (= (mod ~y$w_buff1_used~0_In-54969468 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-54969468 256))))) (= ~y$w_buff0_used~0_In-54969468 |ULTIMATE.start_main_#t~ite35_Out-54969468|) (= |ULTIMATE.start_main_#t~ite36_Out-54969468| |ULTIMATE.start_main_#t~ite35_Out-54969468|)) (and (= |ULTIMATE.start_main_#t~ite35_In-54969468| |ULTIMATE.start_main_#t~ite35_Out-54969468|) (= ~y$w_buff0_used~0_In-54969468 |ULTIMATE.start_main_#t~ite36_Out-54969468|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-54969468, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-54969468, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-54969468|, ~weak$$choice2~0=~weak$$choice2~0_In-54969468, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-54969468, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-54969468} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-54969468, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-54969468, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-54969468|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-54969468|, ~weak$$choice2~0=~weak$$choice2~0_In-54969468, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-54969468, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-54969468} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 21:25:17,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L837-->L837-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1750799436 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1750799436 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1750799436 256) 0) (and (= 0 (mod ~y$r_buff1_thd0~0_In1750799436 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In1750799436 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite38_Out1750799436| ~y$w_buff1_used~0_In1750799436) (= |ULTIMATE.start_main_#t~ite38_Out1750799436| |ULTIMATE.start_main_#t~ite39_Out1750799436|)) (and (= |ULTIMATE.start_main_#t~ite38_In1750799436| |ULTIMATE.start_main_#t~ite38_Out1750799436|) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out1750799436| ~y$w_buff1_used~0_In1750799436)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1750799436, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1750799436, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1750799436|, ~weak$$choice2~0=~weak$$choice2~0_In1750799436, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1750799436, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1750799436} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1750799436, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1750799436|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1750799436, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1750799436|, ~weak$$choice2~0=~weak$$choice2~0_In1750799436, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1750799436, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1750799436} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:25:17,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (= v_~y$r_buff0_thd0~0_61 v_~y$r_buff0_thd0~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:25:17,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L839-->L839-8: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite45_Out-14938633| |ULTIMATE.start_main_#t~ite44_Out-14938633|)) (.cse1 (= 0 (mod ~weak$$choice2~0_In-14938633 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-14938633 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-14938633 256))) (.cse5 (= (mod ~y$w_buff1_used~0_In-14938633 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd0~0_In-14938633 256)))) (or (let ((.cse4 (not .cse6))) (and .cse0 .cse1 (= 0 |ULTIMATE.start_main_#t~ite43_Out-14938633|) (not .cse2) (or (not .cse3) .cse4) (= |ULTIMATE.start_main_#t~ite44_Out-14938633| |ULTIMATE.start_main_#t~ite43_Out-14938633|) (or .cse4 (not .cse5)))) (and (= |ULTIMATE.start_main_#t~ite43_In-14938633| |ULTIMATE.start_main_#t~ite43_Out-14938633|) (or (and (not .cse1) (= ~y$r_buff1_thd0~0_In-14938633 |ULTIMATE.start_main_#t~ite45_Out-14938633|) (= |ULTIMATE.start_main_#t~ite44_In-14938633| |ULTIMATE.start_main_#t~ite44_Out-14938633|)) (and .cse0 .cse1 (or .cse2 (and .cse3 .cse6) (and .cse5 .cse6)) (= ~y$r_buff1_thd0~0_In-14938633 |ULTIMATE.start_main_#t~ite44_Out-14938633|)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-14938633, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-14938633, ~weak$$choice2~0=~weak$$choice2~0_In-14938633, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In-14938633|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-14938633, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-14938633, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-14938633|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-14938633, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-14938633, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-14938633|, ~weak$$choice2~0=~weak$$choice2~0_In-14938633, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-14938633, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-14938633|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-14938633|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-14938633} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:25:17,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L841-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_22 v_~y$mem_tmp~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:25:17,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:25:17,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:25:17 BasicIcfg [2019-12-18 21:25:17,750 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:25:17,752 INFO L168 Benchmark]: Toolchain (without parser) took 24766.52 ms. Allocated memory was 144.7 MB in the beginning and 1.0 GB in the end (delta: 903.3 MB). Free memory was 100.1 MB in the beginning and 332.6 MB in the end (delta: -232.6 MB). Peak memory consumption was 670.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:17,753 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 21:25:17,754 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.57 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.6 MB in the beginning and 155.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:17,754 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.63 ms. Allocated memory is still 201.9 MB. Free memory was 155.4 MB in the beginning and 151.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:17,755 INFO L168 Benchmark]: Boogie Preprocessor took 51.40 ms. Allocated memory is still 201.9 MB. Free memory was 151.9 MB in the beginning and 150.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:17,756 INFO L168 Benchmark]: RCFGBuilder took 812.92 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 103.0 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:17,756 INFO L168 Benchmark]: TraceAbstraction took 23061.76 ms. Allocated memory was 201.9 MB in the beginning and 1.0 GB in the end (delta: 846.2 MB). Free memory was 102.3 MB in the beginning and 332.6 MB in the end (delta: -230.3 MB). Peak memory consumption was 615.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:17,760 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.20 ms. Allocated memory is still 144.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.57 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 99.6 MB in the beginning and 155.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.63 ms. Allocated memory is still 201.9 MB. Free memory was 155.4 MB in the beginning and 151.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.40 ms. Allocated memory is still 201.9 MB. Free memory was 151.9 MB in the beginning and 150.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 812.92 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 103.0 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23061.76 ms. Allocated memory was 201.9 MB in the beginning and 1.0 GB in the end (delta: 846.2 MB). Free memory was 102.3 MB in the beginning and 332.6 MB in the end (delta: -230.3 MB). Peak memory consumption was 615.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 85 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 4245 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50879 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1120, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1121, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1122, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.8s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2275 SDtfs, 2809 SDslu, 6233 SDs, 0 SdLazy, 4351 SolverSat, 252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 31 SyntacticMatches, 15 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22014occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 20281 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 813 NumberOfCodeBlocks, 813 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 737 ConstructedInterpolants, 0 QuantifiedInterpolants, 168051 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...