/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:51:38,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:51:38,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:51:38,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:51:38,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:51:38,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:51:38,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:51:38,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:51:38,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:51:38,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:51:38,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:51:38,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:51:38,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:51:38,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:51:38,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:51:38,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:51:38,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:51:38,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:51:38,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:51:38,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:51:38,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:51:38,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:51:38,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:51:38,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:51:38,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:51:38,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:51:38,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:51:38,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:51:38,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:51:38,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:51:38,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:51:38,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:51:38,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:51:38,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:51:38,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:51:38,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:51:38,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:51:38,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:51:38,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:51:38,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:51:38,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:51:38,722 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-SemanticLbe.epf [2019-12-27 02:51:38,744 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:51:38,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:51:38,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:51:38,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:51:38,746 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:51:38,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:51:38,747 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:51:38,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:51:38,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:51:38,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:51:38,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:51:38,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:51:38,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:51:38,749 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:51:38,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:51:38,749 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:51:38,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:51:38,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:51:38,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:51:38,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:51:38,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:51:38,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:51:38,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:51:38,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:51:38,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:51:38,752 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:51:38,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:51:38,752 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:51:38,752 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:51:39,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:51:39,048 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:51:39,051 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:51:39,052 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:51:39,053 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:51:39,053 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_rmo.opt.i [2019-12-27 02:51:39,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100b440ea/3ae4b5f8316e4946976b005cde1eb3d2/FLAGeb294bc55 [2019-12-27 02:51:39,686 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:51:39,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_rmo.opt.i [2019-12-27 02:51:39,701 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100b440ea/3ae4b5f8316e4946976b005cde1eb3d2/FLAGeb294bc55 [2019-12-27 02:51:39,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100b440ea/3ae4b5f8316e4946976b005cde1eb3d2 [2019-12-27 02:51:39,952 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:51:39,954 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:51:39,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:51:39,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:51:39,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:51:39,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:51:39" (1/1) ... [2019-12-27 02:51:39,963 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a953db3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:39, skipping insertion in model container [2019-12-27 02:51:39,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:51:39" (1/1) ... [2019-12-27 02:51:39,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:51:40,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:51:40,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:51:40,568 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:51:40,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:51:40,728 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:51:40,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:40 WrapperNode [2019-12-27 02:51:40,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:51:40,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:51:40,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:51:40,731 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:51:40,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:40" (1/1) ... [2019-12-27 02:51:40,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:40" (1/1) ... [2019-12-27 02:51:40,806 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:51:40,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:51:40,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:51:40,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:51:40,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:40" (1/1) ... [2019-12-27 02:51:40,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:40" (1/1) ... [2019-12-27 02:51:40,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:40" (1/1) ... [2019-12-27 02:51:40,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:40" (1/1) ... [2019-12-27 02:51:40,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:40" (1/1) ... [2019-12-27 02:51:40,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:40" (1/1) ... [2019-12-27 02:51:40,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:40" (1/1) ... [2019-12-27 02:51:40,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:51:40,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:51:40,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:51:40,844 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:51:40,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:51:40,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:51:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:51:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:51:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:51:40,916 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:51:40,916 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:51:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:51:40,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:51:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:51:40,917 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:51:40,917 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:51:40,918 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:51:40,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:51:40,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:51:40,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:51:40,921 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:51:41,623 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:51:41,624 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:51:41,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:51:41 BoogieIcfgContainer [2019-12-27 02:51:41,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:51:41,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:51:41,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:51:41,631 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:51:41,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:51:39" (1/3) ... [2019-12-27 02:51:41,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7decda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:51:41, skipping insertion in model container [2019-12-27 02:51:41,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:51:40" (2/3) ... [2019-12-27 02:51:41,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7decda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:51:41, skipping insertion in model container [2019-12-27 02:51:41,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:51:41" (3/3) ... [2019-12-27 02:51:41,635 INFO L109 eAbstractionObserver]: Analyzing ICFG mix051_rmo.opt.i [2019-12-27 02:51:41,646 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:51:41,646 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:51:41,655 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:51:41,656 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:51:41,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,698 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,698 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,700 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,700 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,702 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,703 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,710 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,726 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,727 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,727 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,727 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,727 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,728 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,728 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,728 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,729 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,729 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,729 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,729 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,730 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,730 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,747 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,748 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,749 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,755 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,757 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,762 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,763 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,764 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,769 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,769 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:51:41,784 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:51:41,802 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:51:41,803 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:51:41,803 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:51:41,803 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:51:41,803 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:51:41,803 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:51:41,803 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:51:41,803 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:51:41,821 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 190 transitions [2019-12-27 02:51:41,823 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-27 02:51:41,917 INFO L132 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-27 02:51:41,918 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:51:41,932 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:51:41,955 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-27 02:51:42,007 INFO L132 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-27 02:51:42,007 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:51:42,015 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:51:42,032 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 02:51:42,034 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:51:47,151 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-27 02:51:47,601 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 02:51:47,734 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 02:51:47,771 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46836 [2019-12-27 02:51:47,771 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 02:51:47,775 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 84 transitions [2019-12-27 02:51:49,477 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 24606 states. [2019-12-27 02:51:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 24606 states. [2019-12-27 02:51:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:51:49,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:49,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:51:49,487 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:49,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:49,492 INFO L82 PathProgramCache]: Analyzing trace with hash -112021246, now seen corresponding path program 1 times [2019-12-27 02:51:49,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:49,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890404819] [2019-12-27 02:51:49,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:51:49,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890404819] [2019-12-27 02:51:49,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:49,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:51:49,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352523217] [2019-12-27 02:51:49,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:51:49,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:49,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:51:49,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:51:49,826 INFO L87 Difference]: Start difference. First operand 24606 states. Second operand 3 states. [2019-12-27 02:51:50,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:50,251 INFO L93 Difference]: Finished difference Result 23966 states and 104480 transitions. [2019-12-27 02:51:50,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:51:50,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:51:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:51,409 INFO L225 Difference]: With dead ends: 23966 [2019-12-27 02:51:51,410 INFO L226 Difference]: Without dead ends: 22574 [2019-12-27 02:51:51,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:51:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22574 states. [2019-12-27 02:51:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22574 to 22574. [2019-12-27 02:51:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22574 states. [2019-12-27 02:51:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22574 states to 22574 states and 98268 transitions. [2019-12-27 02:51:52,556 INFO L78 Accepts]: Start accepts. Automaton has 22574 states and 98268 transitions. Word has length 9 [2019-12-27 02:51:52,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:52,557 INFO L462 AbstractCegarLoop]: Abstraction has 22574 states and 98268 transitions. [2019-12-27 02:51:52,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:51:52,557 INFO L276 IsEmpty]: Start isEmpty. Operand 22574 states and 98268 transitions. [2019-12-27 02:51:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:51:52,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:52,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:51:52,571 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:52,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:52,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1478915767, now seen corresponding path program 1 times [2019-12-27 02:51:52,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:52,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256692372] [2019-12-27 02:51:52,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:51:52,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256692372] [2019-12-27 02:51:52,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:52,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:51:52,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119093079] [2019-12-27 02:51:52,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:51:52,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:52,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:51:52,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:51:52,764 INFO L87 Difference]: Start difference. First operand 22574 states and 98268 transitions. Second operand 4 states. [2019-12-27 02:51:53,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:53,303 INFO L93 Difference]: Finished difference Result 34006 states and 143332 transitions. [2019-12-27 02:51:53,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:51:53,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:51:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:55,029 INFO L225 Difference]: With dead ends: 34006 [2019-12-27 02:51:55,029 INFO L226 Difference]: Without dead ends: 33954 [2019-12-27 02:51:55,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:51:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33954 states. [2019-12-27 02:51:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33954 to 30266. [2019-12-27 02:51:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30266 states. [2019-12-27 02:51:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30266 states to 30266 states and 129516 transitions. [2019-12-27 02:51:56,347 INFO L78 Accepts]: Start accepts. Automaton has 30266 states and 129516 transitions. Word has length 15 [2019-12-27 02:51:56,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:56,348 INFO L462 AbstractCegarLoop]: Abstraction has 30266 states and 129516 transitions. [2019-12-27 02:51:56,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:51:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 30266 states and 129516 transitions. [2019-12-27 02:51:56,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:51:56,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:56,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:51:56,357 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:56,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1507356133, now seen corresponding path program 1 times [2019-12-27 02:51:56,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:56,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771473662] [2019-12-27 02:51:56,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:51:56,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771473662] [2019-12-27 02:51:56,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:56,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:51:56,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442693098] [2019-12-27 02:51:56,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:51:56,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:56,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:51:56,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:51:56,421 INFO L87 Difference]: Start difference. First operand 30266 states and 129516 transitions. Second operand 3 states. [2019-12-27 02:51:56,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:51:56,722 INFO L93 Difference]: Finished difference Result 39490 states and 165892 transitions. [2019-12-27 02:51:56,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:51:56,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 02:51:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:51:56,843 INFO L225 Difference]: With dead ends: 39490 [2019-12-27 02:51:56,843 INFO L226 Difference]: Without dead ends: 39490 [2019-12-27 02:51:56,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:51:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39490 states. [2019-12-27 02:51:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39490 to 32622. [2019-12-27 02:51:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32622 states. [2019-12-27 02:51:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32622 states to 32622 states and 139128 transitions. [2019-12-27 02:51:59,850 INFO L78 Accepts]: Start accepts. Automaton has 32622 states and 139128 transitions. Word has length 18 [2019-12-27 02:51:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:51:59,850 INFO L462 AbstractCegarLoop]: Abstraction has 32622 states and 139128 transitions. [2019-12-27 02:51:59,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:51:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 32622 states and 139128 transitions. [2019-12-27 02:51:59,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:51:59,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:51:59,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:51:59,861 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:51:59,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:51:59,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1390873323, now seen corresponding path program 1 times [2019-12-27 02:51:59,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:51:59,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125895156] [2019-12-27 02:51:59,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:51:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:51:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:51:59,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125895156] [2019-12-27 02:51:59,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:51:59,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:51:59,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818812881] [2019-12-27 02:51:59,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:51:59,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:51:59,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:51:59,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:51:59,956 INFO L87 Difference]: Start difference. First operand 32622 states and 139128 transitions. Second operand 4 states. [2019-12-27 02:52:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:00,320 INFO L93 Difference]: Finished difference Result 39306 states and 164888 transitions. [2019-12-27 02:52:00,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:52:00,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 02:52:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:00,417 INFO L225 Difference]: With dead ends: 39306 [2019-12-27 02:52:00,417 INFO L226 Difference]: Without dead ends: 39270 [2019-12-27 02:52:00,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:52:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39270 states. [2019-12-27 02:52:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39270 to 34278. [2019-12-27 02:52:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34278 states. [2019-12-27 02:52:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34278 states to 34278 states and 145700 transitions. [2019-12-27 02:52:01,754 INFO L78 Accepts]: Start accepts. Automaton has 34278 states and 145700 transitions. Word has length 18 [2019-12-27 02:52:01,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:01,754 INFO L462 AbstractCegarLoop]: Abstraction has 34278 states and 145700 transitions. [2019-12-27 02:52:01,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:52:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 34278 states and 145700 transitions. [2019-12-27 02:52:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:52:01,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:01,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:52:01,763 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:01,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:01,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1775846621, now seen corresponding path program 1 times [2019-12-27 02:52:01,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:01,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062383300] [2019-12-27 02:52:01,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:01,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:01,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062383300] [2019-12-27 02:52:01,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:01,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:52:01,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049678827] [2019-12-27 02:52:01,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:52:01,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:01,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:52:01,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:52:01,837 INFO L87 Difference]: Start difference. First operand 34278 states and 145700 transitions. Second operand 4 states. [2019-12-27 02:52:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:03,964 INFO L93 Difference]: Finished difference Result 43030 states and 180576 transitions. [2019-12-27 02:52:03,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:52:03,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 02:52:03,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:04,081 INFO L225 Difference]: With dead ends: 43030 [2019-12-27 02:52:04,081 INFO L226 Difference]: Without dead ends: 42978 [2019-12-27 02:52:04,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:52:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42978 states. [2019-12-27 02:52:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42978 to 35550. [2019-12-27 02:52:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35550 states. [2019-12-27 02:52:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35550 states to 35550 states and 151224 transitions. [2019-12-27 02:52:05,238 INFO L78 Accepts]: Start accepts. Automaton has 35550 states and 151224 transitions. Word has length 18 [2019-12-27 02:52:05,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:05,238 INFO L462 AbstractCegarLoop]: Abstraction has 35550 states and 151224 transitions. [2019-12-27 02:52:05,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:52:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 35550 states and 151224 transitions. [2019-12-27 02:52:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 02:52:05,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:05,257 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] [2019-12-27 02:52:05,257 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:05,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1801202898, now seen corresponding path program 1 times [2019-12-27 02:52:05,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:05,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979522006] [2019-12-27 02:52:05,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:05,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979522006] [2019-12-27 02:52:05,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:05,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:52:05,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549211908] [2019-12-27 02:52:05,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:52:05,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:05,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:52:05,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:05,306 INFO L87 Difference]: Start difference. First operand 35550 states and 151224 transitions. Second operand 3 states. [2019-12-27 02:52:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:05,500 INFO L93 Difference]: Finished difference Result 34861 states and 147588 transitions. [2019-12-27 02:52:05,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:52:05,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 02:52:05,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:05,586 INFO L225 Difference]: With dead ends: 34861 [2019-12-27 02:52:05,587 INFO L226 Difference]: Without dead ends: 34861 [2019-12-27 02:52:05,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:05,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34861 states. [2019-12-27 02:52:06,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34861 to 34861. [2019-12-27 02:52:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34861 states. [2019-12-27 02:52:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34861 states to 34861 states and 147588 transitions. [2019-12-27 02:52:06,768 INFO L78 Accepts]: Start accepts. Automaton has 34861 states and 147588 transitions. Word has length 20 [2019-12-27 02:52:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:06,768 INFO L462 AbstractCegarLoop]: Abstraction has 34861 states and 147588 transitions. [2019-12-27 02:52:06,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:52:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 34861 states and 147588 transitions. [2019-12-27 02:52:06,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:52:06,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:06,783 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] [2019-12-27 02:52:06,783 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:06,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:06,784 INFO L82 PathProgramCache]: Analyzing trace with hash -348621301, now seen corresponding path program 1 times [2019-12-27 02:52:06,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:06,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975354424] [2019-12-27 02:52:06,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:06,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975354424] [2019-12-27 02:52:06,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:06,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:52:06,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128519888] [2019-12-27 02:52:06,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:52:06,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:06,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:52:06,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:06,825 INFO L87 Difference]: Start difference. First operand 34861 states and 147588 transitions. Second operand 3 states. [2019-12-27 02:52:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:07,022 INFO L93 Difference]: Finished difference Result 43058 states and 172870 transitions. [2019-12-27 02:52:07,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:52:07,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 02:52:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:07,108 INFO L225 Difference]: With dead ends: 43058 [2019-12-27 02:52:07,108 INFO L226 Difference]: Without dead ends: 35385 [2019-12-27 02:52:07,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35385 states. [2019-12-27 02:52:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35385 to 34652. [2019-12-27 02:52:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34652 states. [2019-12-27 02:52:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34652 states to 34652 states and 138117 transitions. [2019-12-27 02:52:08,177 INFO L78 Accepts]: Start accepts. Automaton has 34652 states and 138117 transitions. Word has length 21 [2019-12-27 02:52:08,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:08,177 INFO L462 AbstractCegarLoop]: Abstraction has 34652 states and 138117 transitions. [2019-12-27 02:52:08,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:52:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand 34652 states and 138117 transitions. [2019-12-27 02:52:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 02:52:08,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:08,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:52:08,189 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:08,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:08,190 INFO L82 PathProgramCache]: Analyzing trace with hash 281464718, now seen corresponding path program 1 times [2019-12-27 02:52:08,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:08,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765100113] [2019-12-27 02:52:08,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:08,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765100113] [2019-12-27 02:52:08,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:08,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:52:08,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030275983] [2019-12-27 02:52:08,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:52:08,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:08,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:52:08,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:52:08,269 INFO L87 Difference]: Start difference. First operand 34652 states and 138117 transitions. Second operand 5 states. [2019-12-27 02:52:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:08,387 INFO L93 Difference]: Finished difference Result 15467 states and 50655 transitions. [2019-12-27 02:52:08,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:52:08,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 02:52:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:08,407 INFO L225 Difference]: With dead ends: 15467 [2019-12-27 02:52:08,408 INFO L226 Difference]: Without dead ends: 13028 [2019-12-27 02:52:08,408 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-27 02:52:08,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13028 states. [2019-12-27 02:52:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13028 to 13028. [2019-12-27 02:52:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13028 states. [2019-12-27 02:52:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13028 states to 13028 states and 41754 transitions. [2019-12-27 02:52:08,887 INFO L78 Accepts]: Start accepts. Automaton has 13028 states and 41754 transitions. Word has length 21 [2019-12-27 02:52:08,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:08,887 INFO L462 AbstractCegarLoop]: Abstraction has 13028 states and 41754 transitions. [2019-12-27 02:52:08,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:52:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 13028 states and 41754 transitions. [2019-12-27 02:52:08,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:52:08,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:08,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:52:08,892 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:08,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:08,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1933146031, now seen corresponding path program 1 times [2019-12-27 02:52:08,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:08,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959100610] [2019-12-27 02:52:08,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:08,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959100610] [2019-12-27 02:52:08,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:08,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:52:08,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917583194] [2019-12-27 02:52:08,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:52:08,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:08,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:52:08,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:52:08,981 INFO L87 Difference]: Start difference. First operand 13028 states and 41754 transitions. Second operand 6 states. [2019-12-27 02:52:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:09,111 INFO L93 Difference]: Finished difference Result 4493 states and 12952 transitions. [2019-12-27 02:52:09,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:52:09,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 02:52:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:09,119 INFO L225 Difference]: With dead ends: 4493 [2019-12-27 02:52:09,119 INFO L226 Difference]: Without dead ends: 3671 [2019-12-27 02:52:09,120 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-27 02:52:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2019-12-27 02:52:09,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3631. [2019-12-27 02:52:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3631 states. [2019-12-27 02:52:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3631 states to 3631 states and 10398 transitions. [2019-12-27 02:52:09,184 INFO L78 Accepts]: Start accepts. Automaton has 3631 states and 10398 transitions. Word has length 22 [2019-12-27 02:52:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:09,185 INFO L462 AbstractCegarLoop]: Abstraction has 3631 states and 10398 transitions. [2019-12-27 02:52:09,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:52:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3631 states and 10398 transitions. [2019-12-27 02:52:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 02:52:09,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:09,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:52:09,193 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:09,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:09,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1547062574, now seen corresponding path program 1 times [2019-12-27 02:52:09,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:09,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729122615] [2019-12-27 02:52:09,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:09,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729122615] [2019-12-27 02:52:09,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:09,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:52:09,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535723428] [2019-12-27 02:52:09,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:52:09,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:09,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:52:09,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:52:09,308 INFO L87 Difference]: Start difference. First operand 3631 states and 10398 transitions. Second operand 7 states. [2019-12-27 02:52:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:09,449 INFO L93 Difference]: Finished difference Result 2817 states and 8323 transitions. [2019-12-27 02:52:09,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:52:09,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-12-27 02:52:09,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:09,454 INFO L225 Difference]: With dead ends: 2817 [2019-12-27 02:52:09,454 INFO L226 Difference]: Without dead ends: 2011 [2019-12-27 02:52:09,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:52:09,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2019-12-27 02:52:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 1891. [2019-12-27 02:52:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2019-12-27 02:52:09,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 5474 transitions. [2019-12-27 02:52:09,488 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 5474 transitions. Word has length 31 [2019-12-27 02:52:09,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:09,488 INFO L462 AbstractCegarLoop]: Abstraction has 1891 states and 5474 transitions. [2019-12-27 02:52:09,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:52:09,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 5474 transitions. [2019-12-27 02:52:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 02:52:09,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:09,494 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] [2019-12-27 02:52:09,494 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:09,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:09,495 INFO L82 PathProgramCache]: Analyzing trace with hash 84854841, now seen corresponding path program 1 times [2019-12-27 02:52:09,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:09,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563591133] [2019-12-27 02:52:09,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:09,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563591133] [2019-12-27 02:52:09,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:09,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:52:09,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054351196] [2019-12-27 02:52:09,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:52:09,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:09,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:52:09,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:52:09,605 INFO L87 Difference]: Start difference. First operand 1891 states and 5474 transitions. Second operand 4 states. [2019-12-27 02:52:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:09,629 INFO L93 Difference]: Finished difference Result 2893 states and 8217 transitions. [2019-12-27 02:52:09,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:52:09,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-27 02:52:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:09,632 INFO L225 Difference]: With dead ends: 2893 [2019-12-27 02:52:09,632 INFO L226 Difference]: Without dead ends: 1627 [2019-12-27 02:52:09,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:52:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2019-12-27 02:52:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1627. [2019-12-27 02:52:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1627 states. [2019-12-27 02:52:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 4632 transitions. [2019-12-27 02:52:09,653 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 4632 transitions. Word has length 46 [2019-12-27 02:52:09,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:09,653 INFO L462 AbstractCegarLoop]: Abstraction has 1627 states and 4632 transitions. [2019-12-27 02:52:09,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:52:09,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 4632 transitions. [2019-12-27 02:52:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 02:52:09,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:09,656 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] [2019-12-27 02:52:09,656 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:09,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:09,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1054276201, now seen corresponding path program 2 times [2019-12-27 02:52:09,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:09,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787275907] [2019-12-27 02:52:09,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:09,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787275907] [2019-12-27 02:52:09,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:09,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:52:09,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821282357] [2019-12-27 02:52:09,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:52:09,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:52:09,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:52:09,748 INFO L87 Difference]: Start difference. First operand 1627 states and 4632 transitions. Second operand 4 states. [2019-12-27 02:52:09,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:09,772 INFO L93 Difference]: Finished difference Result 2003 states and 5495 transitions. [2019-12-27 02:52:09,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:52:09,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-27 02:52:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:09,776 INFO L225 Difference]: With dead ends: 2003 [2019-12-27 02:52:09,776 INFO L226 Difference]: Without dead ends: 421 [2019-12-27 02:52:09,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:52:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-12-27 02:52:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-12-27 02:52:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-27 02:52:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 942 transitions. [2019-12-27 02:52:09,783 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 942 transitions. Word has length 46 [2019-12-27 02:52:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:09,783 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 942 transitions. [2019-12-27 02:52:09,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:52:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 942 transitions. [2019-12-27 02:52:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 02:52:09,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:09,784 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] [2019-12-27 02:52:09,785 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:09,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:09,785 INFO L82 PathProgramCache]: Analyzing trace with hash 401636329, now seen corresponding path program 3 times [2019-12-27 02:52:09,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:09,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086221571] [2019-12-27 02:52:09,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:09,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086221571] [2019-12-27 02:52:09,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:09,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:52:09,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421919877] [2019-12-27 02:52:09,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:52:09,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:09,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:52:09,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:52:09,918 INFO L87 Difference]: Start difference. First operand 421 states and 942 transitions. Second operand 7 states. [2019-12-27 02:52:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:10,080 INFO L93 Difference]: Finished difference Result 808 states and 1765 transitions. [2019-12-27 02:52:10,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:52:10,081 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-12-27 02:52:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:10,082 INFO L225 Difference]: With dead ends: 808 [2019-12-27 02:52:10,082 INFO L226 Difference]: Without dead ends: 544 [2019-12-27 02:52:10,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:52:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-27 02:52:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 484. [2019-12-27 02:52:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-27 02:52:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1050 transitions. [2019-12-27 02:52:10,090 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1050 transitions. Word has length 46 [2019-12-27 02:52:10,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:10,090 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1050 transitions. [2019-12-27 02:52:10,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:52:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1050 transitions. [2019-12-27 02:52:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 02:52:10,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:10,092 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] [2019-12-27 02:52:10,092 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:10,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:10,092 INFO L82 PathProgramCache]: Analyzing trace with hash -683037313, now seen corresponding path program 4 times [2019-12-27 02:52:10,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:10,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511359191] [2019-12-27 02:52:10,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:52:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:52:10,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511359191] [2019-12-27 02:52:10,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:52:10,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:52:10,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727309785] [2019-12-27 02:52:10,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:52:10,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:52:10,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:52:10,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:10,210 INFO L87 Difference]: Start difference. First operand 484 states and 1050 transitions. Second operand 3 states. [2019-12-27 02:52:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:52:10,223 INFO L93 Difference]: Finished difference Result 482 states and 1045 transitions. [2019-12-27 02:52:10,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:52:10,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-27 02:52:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:52:10,224 INFO L225 Difference]: With dead ends: 482 [2019-12-27 02:52:10,224 INFO L226 Difference]: Without dead ends: 482 [2019-12-27 02:52:10,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:52:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-27 02:52:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-12-27 02:52:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-27 02:52:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1045 transitions. [2019-12-27 02:52:10,232 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1045 transitions. Word has length 46 [2019-12-27 02:52:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:52:10,232 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 1045 transitions. [2019-12-27 02:52:10,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:52:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1045 transitions. [2019-12-27 02:52:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:52:10,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:52:10,234 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] [2019-12-27 02:52:10,234 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:52:10,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:52:10,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1677183059, now seen corresponding path program 1 times [2019-12-27 02:52:10,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:52:10,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950436829] [2019-12-27 02:52:10,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:52:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:52:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:52:10,390 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:52:10,390 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:52:10,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= (store .cse0 |v_ULTIMATE.start_main_~#t1373~0.base_36| 1) |v_#valid_83|) (= 0 v_~z$r_buff0_thd4~0_184) (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~z$mem_tmp~0_33 0) (= 0 v_~z$r_buff0_thd3~0_318) (= 0 v_~z$r_buff1_thd4~0_160) (= v_~weak$$choice2~0_130 0) (= v_~z$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~z$r_buff1_thd1~0_92) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p1_EAX~0_54) (= v_~z$r_buff1_thd0~0_160 0) (= 0 v_~z$r_buff1_thd2~0_92) (= 0 v_~weak$$choice0~0_21) (= 0 |v_ULTIMATE.start_main_~#t1373~0.offset_23|) (= 0 v_~z$r_buff1_thd3~0_237) (= v_~__unbuffered_p3_EAX~0_110 0) (= 0 v_~z$flush_delayed~0_68) (= (select .cse0 |v_ULTIMATE.start_main_~#t1373~0.base_36|) 0) (= v_~z$w_buff1_used~0_386 0) (= v_~x~0_77 0) (= v_~z~0_154 0) (= v_~y~0_44 0) (= |v_#NULL.offset_5| 0) (= v_~a~0_69 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1373~0.base_36|) (= v_~__unbuffered_cnt~0_186 0) (= v_~z$r_buff0_thd1~0_47 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1373~0.base_36| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1373~0.base_36|) |v_ULTIMATE.start_main_~#t1373~0.offset_23| 0)) |v_#memory_int_19|) (= v_~z$w_buff0~0_354 0) (= v_~z$w_buff1~0_215 0) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t1373~0.base_36| 4) |v_#length_27|) (= v_~z$w_buff0_used~0_630 0) (= v_~z$r_buff0_thd2~0_47 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_122 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_20|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_~#t1375~0.base=|v_ULTIMATE.start_main_~#t1375~0.base_37|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_69, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_122, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_184, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_110, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ULTIMATE.start_main_~#t1375~0.offset=|v_ULTIMATE.start_main_~#t1375~0.offset_24|, ~z$mem_tmp~0=v_~z$mem_tmp~0_33, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ULTIMATE.start_main_~#t1376~0.base=|v_ULTIMATE.start_main_~#t1376~0.base_17|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_54|, ~z$flush_delayed~0=v_~z$flush_delayed~0_68, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t1374~0.offset=|v_ULTIMATE.start_main_~#t1374~0.offset_24|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_92, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_318, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_186, ~x~0=v_~x~0_77, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_160, ULTIMATE.start_main_~#t1373~0.offset=|v_ULTIMATE.start_main_~#t1373~0.offset_23|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_14|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_215, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t1376~0.offset=|v_ULTIMATE.start_main_~#t1376~0.offset_14|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_160, ~y~0=v_~y~0_44, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_630, ~z$w_buff0~0=v_~z$w_buff0~0_354, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ULTIMATE.start_main_~#t1373~0.base=|v_ULTIMATE.start_main_~#t1373~0.base_36|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_72|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_154, ULTIMATE.start_main_~#t1374~0.base=|v_ULTIMATE.start_main_~#t1374~0.base_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_47} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1375~0.base, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1375~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1376~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1374~0.offset, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_~#t1373~0.offset, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1376~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1373~0.base, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1374~0.base, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:52:10,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L833-1-->L835: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1374~0.offset_10|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t1374~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t1374~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1374~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1374~0.base_11|) |v_ULTIMATE.start_main_~#t1374~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1374~0.base_11| 4) |v_#length_21|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1374~0.base_11|) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t1374~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1374~0.offset=|v_ULTIMATE.start_main_~#t1374~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1374~0.base=|v_ULTIMATE.start_main_~#t1374~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1374~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1374~0.base] because there is no mapped edge [2019-12-27 02:52:10,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L835-1-->L837: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1375~0.base_11| 4)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1375~0.base_11| 1) |v_#valid_41|) (not (= |v_ULTIMATE.start_main_~#t1375~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1375~0.offset_10|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1375~0.base_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1375~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1375~0.base_11|) |v_ULTIMATE.start_main_~#t1375~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1375~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1375~0.offset=|v_ULTIMATE.start_main_~#t1375~0.offset_10|, ULTIMATE.start_main_~#t1375~0.base=|v_ULTIMATE.start_main_~#t1375~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1375~0.offset, ULTIMATE.start_main_~#t1375~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 02:52:10,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-1-->L839: Formula: (and (= |v_ULTIMATE.start_main_~#t1376~0.offset_11| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1376~0.base_13| 4)) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1376~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t1376~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1376~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1376~0.base_13|) |v_ULTIMATE.start_main_~#t1376~0.offset_11| 3)) |v_#memory_int_15|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1376~0.base_13| 1) |v_#valid_50|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1376~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1376~0.offset=|v_ULTIMATE.start_main_~#t1376~0.offset_11|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1376~0.base=|v_ULTIMATE.start_main_~#t1376~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1376~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1376~0.base, #length] because there is no mapped edge [2019-12-27 02:52:10,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_40 v_~z$r_buff1_thd0~0_25) (= v_~z$r_buff1_thd2~0_6 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22)) (= v_~a~0_15 v_~__unbuffered_p3_EAX~0_9) (= v_~z$r_buff0_thd4~0_25 1) (= v_~z$r_buff0_thd4~0_26 v_~z$r_buff1_thd4~0_17) (= v_~z$r_buff0_thd3~0_59 v_~z$r_buff1_thd3~0_33)) InVars {~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_6, ~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_25, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 02:52:10,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_44 1) (= v_P0Thread1of1ForFork2_~arg.base_23 |v_P0Thread1of1ForFork2_#in~arg.base_23|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_23| v_P0Thread1of1ForFork2_~arg.offset_23) (= 0 |v_P0Thread1of1ForFork2_#res.offset_13|) (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= v_~x~0_51 1) (= |v_P0Thread1of1ForFork2_#res.base_13| 0)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|} OutVars{~a~0=v_~a~0_44, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_23, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_13|, ~x~0=v_~x~0_51, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 02:52:10,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_7|) (= |v_P1Thread1of1ForFork3_#in~arg.offset_17| v_P1Thread1of1ForFork3_~arg.offset_17) (= |v_P1Thread1of1ForFork3_#in~arg.base_17| v_P1Thread1of1ForFork3_~arg.base_17) (= v_~y~0_22 v_~__unbuffered_p1_EAX~0_21) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= 0 |v_P1Thread1of1ForFork3_#res.offset_7|) (= v_~x~0_33 2)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_17, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 02:52:10,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1898738507 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1898738507 256)))) (or (and (= |P3Thread1of1ForFork1_#t~ite28_Out-1898738507| 0) (not .cse0) (not .cse1)) (and (= |P3Thread1of1ForFork1_#t~ite28_Out-1898738507| ~z$w_buff0_used~0_In-1898738507) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1898738507, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1898738507} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1898738507, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-1898738507|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1898738507} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 02:52:10,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-325875557 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-325875557 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-325875557 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-325875557 256) 0))) (or (and (= |P3Thread1of1ForFork1_#t~ite29_Out-325875557| ~z$w_buff1_used~0_In-325875557) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork1_#t~ite29_Out-325875557| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-325875557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-325875557, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-325875557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-325875557} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-325875557, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-325875557|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-325875557, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-325875557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-325875557} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 02:52:10,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L813-->L814: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1953267218 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1953267218 256)))) (or (and (= ~z$r_buff0_thd4~0_In-1953267218 ~z$r_buff0_thd4~0_Out-1953267218) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd4~0_Out-1953267218) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1953267218, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1953267218} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1953267218, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1953267218, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1953267218|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 02:52:10,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In645107008 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In645107008 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In645107008 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In645107008 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite31_Out645107008|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In645107008 |P3Thread1of1ForFork1_#t~ite31_Out645107008|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In645107008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In645107008, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In645107008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In645107008} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In645107008, ~z$w_buff0_used~0=~z$w_buff0_used~0_In645107008, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In645107008, ~z$w_buff1_used~0=~z$w_buff1_used~0_In645107008, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out645107008|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 02:52:10,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= |v_P3Thread1of1ForFork1_#t~ite31_62| v_~z$r_buff1_thd4~0_109) (= v_~__unbuffered_cnt~0_133 (+ v_~__unbuffered_cnt~0_134 1)) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_62|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_109, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_61|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 02:52:10,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L778-->L779-8: Formula: (and (= |v_P2Thread1of1ForFork0_#t~ite22_31| |v_P2Thread1of1ForFork0_#t~ite22_30|) (= |v_P2Thread1of1ForFork0_#t~ite23_33| |v_P2Thread1of1ForFork0_#t~ite23_32|) (= v_~z$r_buff0_thd3~0_290 v_~z$r_buff0_thd3~0_289) (not (= (mod v_~weak$$choice2~0_121 256) 0)) (= v_~z$r_buff1_thd3~0_210 |v_P2Thread1of1ForFork0_#t~ite24_46|)) InVars {P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_31|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_290, ~weak$$choice2~0=v_~weak$$choice2~0_121} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_15|, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_30|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_32|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_46|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_289, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_31|, ~weak$$choice2~0=v_~weak$$choice2~0_121, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_29|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 02:52:10,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L781-->L789: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:52:10,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L843-->L845-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_106 256)) (= (mod v_~z$r_buff0_thd0~0_21 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 02:52:10,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L845-2-->L845-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In123249758 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In123249758 256) 0))) (or (and (= ~z~0_In123249758 |ULTIMATE.start_main_#t~ite36_Out123249758|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In123249758 |ULTIMATE.start_main_#t~ite36_Out123249758|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In123249758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In123249758, ~z$w_buff1~0=~z$w_buff1~0_In123249758, ~z~0=~z~0_In123249758} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In123249758, ~z$w_buff1_used~0=~z$w_buff1_used~0_In123249758, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out123249758|, ~z$w_buff1~0=~z$w_buff1~0_In123249758, ~z~0=~z~0_In123249758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 02:52:10,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-27 02:52:10,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-2128192340 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2128192340 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-2128192340| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-2128192340| ~z$w_buff0_used~0_In-2128192340) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2128192340, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2128192340} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2128192340, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2128192340, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-2128192340|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:52:10,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L847-->L847-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In192100040 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In192100040 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In192100040 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In192100040 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out192100040|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In192100040 |ULTIMATE.start_main_#t~ite39_Out192100040|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In192100040, ~z$w_buff0_used~0=~z$w_buff0_used~0_In192100040, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In192100040, ~z$w_buff1_used~0=~z$w_buff1_used~0_In192100040} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In192100040, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out192100040|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In192100040, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In192100040, ~z$w_buff1_used~0=~z$w_buff1_used~0_In192100040} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:52:10,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In532062056 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In532062056 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out532062056| ~z$r_buff0_thd0~0_In532062056) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out532062056| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In532062056, ~z$w_buff0_used~0=~z$w_buff0_used~0_In532062056} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In532062056, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out532062056|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In532062056} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:52:10,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L849-->L849-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In638530717 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In638530717 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In638530717 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In638530717 256)))) (or (and (= ~z$r_buff1_thd0~0_In638530717 |ULTIMATE.start_main_#t~ite41_Out638530717|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite41_Out638530717|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In638530717, ~z$w_buff0_used~0=~z$w_buff0_used~0_In638530717, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In638530717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In638530717} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out638530717|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In638530717, ~z$w_buff0_used~0=~z$w_buff0_used~0_In638530717, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In638530717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In638530717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 02:52:10,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_27) (= v_~x~0_63 2) (= v_~main$tmp_guard1~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~z$r_buff1_thd0~0_120 |v_ULTIMATE.start_main_#t~ite41_44|) (= 0 v_~__unbuffered_p3_EAX~0_80) (= 0 v_~__unbuffered_p1_EAX~0_40) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_120, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:52:10,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:52:10 BasicIcfg [2019-12-27 02:52:10,523 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:52:10,525 INFO L168 Benchmark]: Toolchain (without parser) took 30571.66 ms. Allocated memory was 137.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 99.3 MB in the beginning and 715.9 MB in the end (delta: -616.6 MB). Peak memory consumption was 908.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:10,526 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 02:52:10,527 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.77 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 98.9 MB in the beginning and 155.3 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:10,527 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.05 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 152.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:10,528 INFO L168 Benchmark]: Boogie Preprocessor took 36.63 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:10,529 INFO L168 Benchmark]: RCFGBuilder took 782.69 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 104.7 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:10,530 INFO L168 Benchmark]: TraceAbstraction took 28896.00 ms. Allocated memory was 202.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 104.1 MB in the beginning and 715.9 MB in the end (delta: -611.8 MB). Peak memory consumption was 848.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:52:10,533 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.44 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.77 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 98.9 MB in the beginning and 155.3 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.05 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 152.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.63 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 782.69 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 104.7 MB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28896.00 ms. Allocated memory was 202.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 104.1 MB in the beginning and 715.9 MB in the end (delta: -611.8 MB). Peak memory consumption was 848.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 168 ProgramPointsBefore, 77 ProgramPointsAfterwards, 190 TransitionsBefore, 84 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 20 ChoiceCompositions, 5577 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 168 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 46836 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1373, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1374, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1375, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1376, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 4 z$w_buff1 = z$w_buff0 [L795] 4 z$w_buff0 = 1 [L796] 4 z$w_buff1_used = z$w_buff0_used [L797] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 1 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L773] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L774] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L779] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1536 SDtfs, 2171 SDslu, 2255 SDs, 0 SdLazy, 621 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35550occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 23929 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 363 ConstructedInterpolants, 0 QuantifiedInterpolants, 54577 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...