/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:21:11,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:21:11,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:21:11,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:21:11,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:21:11,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:21:11,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:21:11,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:21:11,751 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:21:11,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:21:11,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:21:11,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:21:11,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:21:11,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:21:11,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:21:11,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:21:11,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:21:11,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:21:11,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:21:11,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:21:11,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:21:11,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:21:11,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:21:11,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:21:11,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:21:11,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:21:11,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:21:11,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:21:11,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:21:11,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:21:11,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:21:11,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:21:11,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:21:11,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:21:11,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:21:11,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:21:11,778 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:21:11,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:21:11,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:21:11,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:21:11,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:21:11,784 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:21:11,808 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:21:11,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:21:11,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:21:11,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:21:11,810 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:21:11,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:21:11,811 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:21:11,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:21:11,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:21:11,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:21:11,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:21:11,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:21:11,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:21:11,813 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:21:11,814 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:21:11,814 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:21:11,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:21:11,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:21:11,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:21:11,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:21:11,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:21:11,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:21:11,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:21:11,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:21:11,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:21:11,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:21:11,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:21:11,816 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:21:11,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:21:11,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:21:12,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:21:12,105 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:21:12,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:21:12,112 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:21:12,113 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:21:12,114 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i [2019-12-27 06:21:12,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19986c99/55dabb834c0a470f9dffa7127c7e1b80/FLAG3efecde8e [2019-12-27 06:21:12,751 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:21:12,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_rmo.opt.i [2019-12-27 06:21:12,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19986c99/55dabb834c0a470f9dffa7127c7e1b80/FLAG3efecde8e [2019-12-27 06:21:13,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e19986c99/55dabb834c0a470f9dffa7127c7e1b80 [2019-12-27 06:21:13,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:21:13,091 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:21:13,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:21:13,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:21:13,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:21:13,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:21:13" (1/1) ... [2019-12-27 06:21:13,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b973043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:21:13, skipping insertion in model container [2019-12-27 06:21:13,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:21:13" (1/1) ... [2019-12-27 06:21:13,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:21:13,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:21:13,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:21:13,638 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:21:13,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:21:13,816 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:21:13,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:21:13 WrapperNode [2019-12-27 06:21:13,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:21:13,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:21:13,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:21:13,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:21:13,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:21:13" (1/1) ... [2019-12-27 06:21:13,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:21:13" (1/1) ... [2019-12-27 06:21:13,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:21:13,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:21:13,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:21:13,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:21:13,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:21:13" (1/1) ... [2019-12-27 06:21:13,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:21:13" (1/1) ... [2019-12-27 06:21:13,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:21:13" (1/1) ... [2019-12-27 06:21:13,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:21:13" (1/1) ... [2019-12-27 06:21:13,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:21:13" (1/1) ... [2019-12-27 06:21:13,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:21:13" (1/1) ... [2019-12-27 06:21:13,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:21:13" (1/1) ... [2019-12-27 06:21:13,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:21:13,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:21:13,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:21:13,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:21:13,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:21:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:21:13,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:21:13,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:21:13,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:21:13,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:21:13,990 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:21:13,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:21:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:21:13,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:21:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:21:13,991 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:21:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 06:21:13,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 06:21:13,992 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:21:13,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:21:13,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:21:13,994 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:21:14,705 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:21:14,706 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:21:14,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:21:14 BoogieIcfgContainer [2019-12-27 06:21:14,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:21:14,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:21:14,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:21:14,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:21:14,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:21:13" (1/3) ... [2019-12-27 06:21:14,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ec44c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:21:14, skipping insertion in model container [2019-12-27 06:21:14,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:21:13" (2/3) ... [2019-12-27 06:21:14,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ec44c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:21:14, skipping insertion in model container [2019-12-27 06:21:14,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:21:14" (3/3) ... [2019-12-27 06:21:14,718 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_rmo.opt.i [2019-12-27 06:21:14,730 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:21:14,731 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:21:14,739 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:21:14,740 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:21:14,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,784 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,785 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,788 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,788 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,793 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,793 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,810 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,813 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,814 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,842 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,842 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,842 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,842 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,842 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,843 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,843 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,843 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,843 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,846 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,846 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,846 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,846 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,852 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,853 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,858 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,859 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,864 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,864 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,865 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,865 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,865 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,865 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,865 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,866 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,866 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,866 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,866 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,866 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,869 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,870 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:21:14,885 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 06:21:14,906 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:21:14,906 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:21:14,906 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:21:14,906 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:21:14,907 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:21:14,907 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:21:14,907 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:21:14,907 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:21:14,924 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-27 06:21:14,926 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 06:21:15,022 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 06:21:15,023 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:21:15,037 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 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/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 06:21:15,058 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-27 06:21:15,109 INFO L132 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-27 06:21:15,110 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:21:15,116 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 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/151 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 06:21:15,133 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 06:21:15,134 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:21:19,051 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-27 06:21:19,196 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-27 06:21:19,214 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45931 [2019-12-27 06:21:19,214 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-27 06:21:19,218 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 79 transitions [2019-12-27 06:21:20,435 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22190 states. [2019-12-27 06:21:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 22190 states. [2019-12-27 06:21:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 06:21:20,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:20,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:21:20,447 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 06:21:20,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1275249875, now seen corresponding path program 1 times [2019-12-27 06:21:20,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:20,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806726288] [2019-12-27 06:21:20,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:20,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806726288] [2019-12-27 06:21:20,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:20,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:21:20,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298561132] [2019-12-27 06:21:20,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:21:20,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:20,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:21:20,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:21:20,769 INFO L87 Difference]: Start difference. First operand 22190 states. Second operand 3 states. [2019-12-27 06:21:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:21,910 INFO L93 Difference]: Finished difference Result 21750 states and 93576 transitions. [2019-12-27 06:21:21,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:21:21,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 06:21:21,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:22,152 INFO L225 Difference]: With dead ends: 21750 [2019-12-27 06:21:22,153 INFO L226 Difference]: Without dead ends: 20406 [2019-12-27 06:21:22,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:21:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20406 states. [2019-12-27 06:21:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20406 to 20406. [2019-12-27 06:21:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20406 states. [2019-12-27 06:21:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20406 states to 20406 states and 87656 transitions. [2019-12-27 06:21:23,240 INFO L78 Accepts]: Start accepts. Automaton has 20406 states and 87656 transitions. Word has length 9 [2019-12-27 06:21:23,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:23,241 INFO L462 AbstractCegarLoop]: Abstraction has 20406 states and 87656 transitions. [2019-12-27 06:21:23,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:21:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 20406 states and 87656 transitions. [2019-12-27 06:21:23,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 06:21:23,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:23,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:21:23,249 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 06:21:23,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:23,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1986305756, now seen corresponding path program 1 times [2019-12-27 06:21:23,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:23,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654387837] [2019-12-27 06:21:23,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:23,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654387837] [2019-12-27 06:21:23,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:23,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:21:23,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230754429] [2019-12-27 06:21:23,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:21:23,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:23,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:21:23,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:21:23,379 INFO L87 Difference]: Start difference. First operand 20406 states and 87656 transitions. Second operand 4 states. [2019-12-27 06:21:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:24,315 INFO L93 Difference]: Finished difference Result 31694 states and 131120 transitions. [2019-12-27 06:21:24,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:21:24,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 06:21:24,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:24,484 INFO L225 Difference]: With dead ends: 31694 [2019-12-27 06:21:24,485 INFO L226 Difference]: Without dead ends: 31634 [2019-12-27 06:21:24,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:21:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31634 states. [2019-12-27 06:21:26,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31634 to 28582. [2019-12-27 06:21:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28582 states. [2019-12-27 06:21:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28582 states to 28582 states and 119644 transitions. [2019-12-27 06:21:26,991 INFO L78 Accepts]: Start accepts. Automaton has 28582 states and 119644 transitions. Word has length 15 [2019-12-27 06:21:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:26,992 INFO L462 AbstractCegarLoop]: Abstraction has 28582 states and 119644 transitions. [2019-12-27 06:21:26,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:21:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 28582 states and 119644 transitions. [2019-12-27 06:21:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 06:21:26,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:26,999 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 06:21:26,999 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 06:21:26,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:26,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2051676058, now seen corresponding path program 1 times [2019-12-27 06:21:27,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:27,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553748858] [2019-12-27 06:21:27,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:27,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553748858] [2019-12-27 06:21:27,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:27,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:21:27,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583078588] [2019-12-27 06:21:27,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:21:27,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:27,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:21:27,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:21:27,092 INFO L87 Difference]: Start difference. First operand 28582 states and 119644 transitions. Second operand 4 states. [2019-12-27 06:21:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:27,522 INFO L93 Difference]: Finished difference Result 35982 states and 149300 transitions. [2019-12-27 06:21:27,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:21:27,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 06:21:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:27,753 INFO L225 Difference]: With dead ends: 35982 [2019-12-27 06:21:27,754 INFO L226 Difference]: Without dead ends: 35934 [2019-12-27 06:21:27,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:21:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35934 states. [2019-12-27 06:21:30,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35934 to 31130. [2019-12-27 06:21:30,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31130 states. [2019-12-27 06:21:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31130 states to 31130 states and 130164 transitions. [2019-12-27 06:21:30,544 INFO L78 Accepts]: Start accepts. Automaton has 31130 states and 130164 transitions. Word has length 18 [2019-12-27 06:21:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:30,545 INFO L462 AbstractCegarLoop]: Abstraction has 31130 states and 130164 transitions. [2019-12-27 06:21:30,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:21:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 31130 states and 130164 transitions. [2019-12-27 06:21:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 06:21:30,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:30,556 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 06:21:30,557 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 06:21:30,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:30,557 INFO L82 PathProgramCache]: Analyzing trace with hash 94366494, now seen corresponding path program 1 times [2019-12-27 06:21:30,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:30,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60279655] [2019-12-27 06:21:30,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:30,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60279655] [2019-12-27 06:21:30,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:30,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:21:30,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730278866] [2019-12-27 06:21:30,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:21:30,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:30,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:21:30,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:21:30,637 INFO L87 Difference]: Start difference. First operand 31130 states and 130164 transitions. Second operand 3 states. [2019-12-27 06:21:30,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:30,793 INFO L93 Difference]: Finished difference Result 30483 states and 126804 transitions. [2019-12-27 06:21:30,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:21:30,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 06:21:30,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:30,901 INFO L225 Difference]: With dead ends: 30483 [2019-12-27 06:21:30,901 INFO L226 Difference]: Without dead ends: 30483 [2019-12-27 06:21:30,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:21:31,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30483 states. [2019-12-27 06:21:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30483 to 30483. [2019-12-27 06:21:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30483 states. [2019-12-27 06:21:32,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30483 states to 30483 states and 126804 transitions. [2019-12-27 06:21:32,069 INFO L78 Accepts]: Start accepts. Automaton has 30483 states and 126804 transitions. Word has length 20 [2019-12-27 06:21:32,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:32,069 INFO L462 AbstractCegarLoop]: Abstraction has 30483 states and 126804 transitions. [2019-12-27 06:21:32,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:21:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 30483 states and 126804 transitions. [2019-12-27 06:21:32,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 06:21:32,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:32,083 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 06:21:32,083 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 06:21:32,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:32,084 INFO L82 PathProgramCache]: Analyzing trace with hash -300921262, now seen corresponding path program 1 times [2019-12-27 06:21:32,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:32,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182229496] [2019-12-27 06:21:32,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:32,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182229496] [2019-12-27 06:21:32,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:32,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:21:32,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617136251] [2019-12-27 06:21:32,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:21:32,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:32,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:21:32,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:21:32,142 INFO L87 Difference]: Start difference. First operand 30483 states and 126804 transitions. Second operand 3 states. [2019-12-27 06:21:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:32,834 INFO L93 Difference]: Finished difference Result 30156 states and 125536 transitions. [2019-12-27 06:21:32,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:21:32,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 06:21:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:32,921 INFO L225 Difference]: With dead ends: 30156 [2019-12-27 06:21:32,922 INFO L226 Difference]: Without dead ends: 30156 [2019-12-27 06:21:32,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:21:33,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30156 states. [2019-12-27 06:21:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30156 to 30156. [2019-12-27 06:21:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30156 states. [2019-12-27 06:21:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30156 states to 30156 states and 125536 transitions. [2019-12-27 06:21:35,578 INFO L78 Accepts]: Start accepts. Automaton has 30156 states and 125536 transitions. Word has length 21 [2019-12-27 06:21:35,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:35,578 INFO L462 AbstractCegarLoop]: Abstraction has 30156 states and 125536 transitions. [2019-12-27 06:21:35,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:21:35,578 INFO L276 IsEmpty]: Start isEmpty. Operand 30156 states and 125536 transitions. [2019-12-27 06:21:35,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:21:35,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:35,591 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 06:21:35,591 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 06:21:35,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:35,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1462742231, now seen corresponding path program 1 times [2019-12-27 06:21:35,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:35,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076449566] [2019-12-27 06:21:35,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:35,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076449566] [2019-12-27 06:21:35,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:35,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:21:35,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367766269] [2019-12-27 06:21:35,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:21:35,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:35,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:21:35,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:21:35,710 INFO L87 Difference]: Start difference. First operand 30156 states and 125536 transitions. Second operand 3 states. [2019-12-27 06:21:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:35,875 INFO L93 Difference]: Finished difference Result 30156 states and 124144 transitions. [2019-12-27 06:21:35,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:21:35,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-27 06:21:35,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:35,951 INFO L225 Difference]: With dead ends: 30156 [2019-12-27 06:21:35,951 INFO L226 Difference]: Without dead ends: 30156 [2019-12-27 06:21:35,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:21:36,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30156 states. [2019-12-27 06:21:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30156 to 29756. [2019-12-27 06:21:36,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29756 states. [2019-12-27 06:21:36,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29756 states to 29756 states and 122584 transitions. [2019-12-27 06:21:36,754 INFO L78 Accepts]: Start accepts. Automaton has 29756 states and 122584 transitions. Word has length 22 [2019-12-27 06:21:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:36,754 INFO L462 AbstractCegarLoop]: Abstraction has 29756 states and 122584 transitions. [2019-12-27 06:21:36,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:21:36,755 INFO L276 IsEmpty]: Start isEmpty. Operand 29756 states and 122584 transitions. [2019-12-27 06:21:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 06:21:36,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:36,769 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] [2019-12-27 06:21:36,769 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 06:21:36,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:36,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1925311680, now seen corresponding path program 1 times [2019-12-27 06:21:36,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:36,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532492767] [2019-12-27 06:21:36,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:36,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532492767] [2019-12-27 06:21:36,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:36,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:21:36,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663153112] [2019-12-27 06:21:36,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:21:36,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:21:36,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:21:36,869 INFO L87 Difference]: Start difference. First operand 29756 states and 122584 transitions. Second operand 5 states. [2019-12-27 06:21:37,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:37,014 INFO L93 Difference]: Finished difference Result 12356 states and 41371 transitions. [2019-12-27 06:21:37,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:21:37,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 06:21:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:37,036 INFO L225 Difference]: With dead ends: 12356 [2019-12-27 06:21:37,036 INFO L226 Difference]: Without dead ends: 10556 [2019-12-27 06:21:37,037 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 06:21:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10556 states. [2019-12-27 06:21:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10556 to 10556. [2019-12-27 06:21:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10556 states. [2019-12-27 06:21:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 34237 transitions. [2019-12-27 06:21:37,246 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 34237 transitions. Word has length 23 [2019-12-27 06:21:37,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:37,246 INFO L462 AbstractCegarLoop]: Abstraction has 10556 states and 34237 transitions. [2019-12-27 06:21:37,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:21:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 34237 transitions. [2019-12-27 06:21:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 06:21:37,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:37,252 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] [2019-12-27 06:21:37,252 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 06:21:37,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:37,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1601638180, now seen corresponding path program 1 times [2019-12-27 06:21:37,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:37,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510069439] [2019-12-27 06:21:37,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:37,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510069439] [2019-12-27 06:21:37,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:37,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:21:37,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662899675] [2019-12-27 06:21:37,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:21:37,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:37,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:21:37,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:21:37,311 INFO L87 Difference]: Start difference. First operand 10556 states and 34237 transitions. Second operand 3 states. [2019-12-27 06:21:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:37,393 INFO L93 Difference]: Finished difference Result 17590 states and 56181 transitions. [2019-12-27 06:21:37,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:21:37,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-27 06:21:37,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:37,416 INFO L225 Difference]: With dead ends: 17590 [2019-12-27 06:21:37,416 INFO L226 Difference]: Without dead ends: 10990 [2019-12-27 06:21:37,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:21:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10990 states. [2019-12-27 06:21:37,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10990 to 10806. [2019-12-27 06:21:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10806 states. [2019-12-27 06:21:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10806 states to 10806 states and 33714 transitions. [2019-12-27 06:21:37,606 INFO L78 Accepts]: Start accepts. Automaton has 10806 states and 33714 transitions. Word has length 24 [2019-12-27 06:21:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:37,607 INFO L462 AbstractCegarLoop]: Abstraction has 10806 states and 33714 transitions. [2019-12-27 06:21:37,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:21:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 10806 states and 33714 transitions. [2019-12-27 06:21:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 06:21:37,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:37,612 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] [2019-12-27 06:21:37,612 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 06:21:37,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash 702094496, now seen corresponding path program 2 times [2019-12-27 06:21:37,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:37,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286277277] [2019-12-27 06:21:37,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:37,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286277277] [2019-12-27 06:21:37,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:37,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:21:37,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322520601] [2019-12-27 06:21:37,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:21:37,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:37,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:21:37,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:21:37,662 INFO L87 Difference]: Start difference. First operand 10806 states and 33714 transitions. Second operand 4 states. [2019-12-27 06:21:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:37,857 INFO L93 Difference]: Finished difference Result 16343 states and 51703 transitions. [2019-12-27 06:21:37,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:21:37,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-27 06:21:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:37,880 INFO L225 Difference]: With dead ends: 16343 [2019-12-27 06:21:37,881 INFO L226 Difference]: Without dead ends: 8666 [2019-12-27 06:21:37,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:21:37,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8666 states. [2019-12-27 06:21:38,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8666 to 8361. [2019-12-27 06:21:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8361 states. [2019-12-27 06:21:38,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8361 states to 8361 states and 26206 transitions. [2019-12-27 06:21:38,030 INFO L78 Accepts]: Start accepts. Automaton has 8361 states and 26206 transitions. Word has length 24 [2019-12-27 06:21:38,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:38,030 INFO L462 AbstractCegarLoop]: Abstraction has 8361 states and 26206 transitions. [2019-12-27 06:21:38,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:21:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 8361 states and 26206 transitions. [2019-12-27 06:21:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 06:21:38,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:38,034 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] [2019-12-27 06:21:38,034 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 06:21:38,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:38,034 INFO L82 PathProgramCache]: Analyzing trace with hash 238221496, now seen corresponding path program 3 times [2019-12-27 06:21:38,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:38,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336070800] [2019-12-27 06:21:38,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:38,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336070800] [2019-12-27 06:21:38,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:38,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:21:38,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798786969] [2019-12-27 06:21:38,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:21:38,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:38,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:21:38,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:21:38,121 INFO L87 Difference]: Start difference. First operand 8361 states and 26206 transitions. Second operand 6 states. [2019-12-27 06:21:38,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:38,233 INFO L93 Difference]: Finished difference Result 3182 states and 9111 transitions. [2019-12-27 06:21:38,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:21:38,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 06:21:38,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:38,238 INFO L225 Difference]: With dead ends: 3182 [2019-12-27 06:21:38,239 INFO L226 Difference]: Without dead ends: 2648 [2019-12-27 06:21:38,239 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 06:21:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2019-12-27 06:21:38,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2648. [2019-12-27 06:21:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2648 states. [2019-12-27 06:21:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2648 states to 2648 states and 7485 transitions. [2019-12-27 06:21:38,281 INFO L78 Accepts]: Start accepts. Automaton has 2648 states and 7485 transitions. Word has length 24 [2019-12-27 06:21:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:38,281 INFO L462 AbstractCegarLoop]: Abstraction has 2648 states and 7485 transitions. [2019-12-27 06:21:38,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:21:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2648 states and 7485 transitions. [2019-12-27 06:21:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:21:38,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:38,285 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] [2019-12-27 06:21:38,285 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 06:21:38,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:38,286 INFO L82 PathProgramCache]: Analyzing trace with hash 923857396, now seen corresponding path program 1 times [2019-12-27 06:21:38,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:38,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494014723] [2019-12-27 06:21:38,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:38,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494014723] [2019-12-27 06:21:38,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:38,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:21:38,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143420779] [2019-12-27 06:21:38,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:21:38,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:38,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:21:38,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:21:38,323 INFO L87 Difference]: Start difference. First operand 2648 states and 7485 transitions. Second operand 3 states. [2019-12-27 06:21:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:38,385 INFO L93 Difference]: Finished difference Result 3966 states and 11148 transitions. [2019-12-27 06:21:38,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:21:38,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 06:21:38,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:38,390 INFO L225 Difference]: With dead ends: 3966 [2019-12-27 06:21:38,390 INFO L226 Difference]: Without dead ends: 3966 [2019-12-27 06:21:38,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:21:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3966 states. [2019-12-27 06:21:38,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3966 to 3124. [2019-12-27 06:21:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3124 states. [2019-12-27 06:21:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 8947 transitions. [2019-12-27 06:21:38,431 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 8947 transitions. Word has length 32 [2019-12-27 06:21:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:38,431 INFO L462 AbstractCegarLoop]: Abstraction has 3124 states and 8947 transitions. [2019-12-27 06:21:38,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:21:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 8947 transitions. [2019-12-27 06:21:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 06:21:38,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:38,435 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] [2019-12-27 06:21:38,435 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 06:21:38,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:38,436 INFO L82 PathProgramCache]: Analyzing trace with hash 386347120, now seen corresponding path program 1 times [2019-12-27 06:21:38,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:38,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558402267] [2019-12-27 06:21:38,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:38,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558402267] [2019-12-27 06:21:38,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:38,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:21:38,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122118502] [2019-12-27 06:21:38,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:21:38,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:38,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:21:38,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:21:38,530 INFO L87 Difference]: Start difference. First operand 3124 states and 8947 transitions. Second operand 6 states. [2019-12-27 06:21:39,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:39,032 INFO L93 Difference]: Finished difference Result 6556 states and 17848 transitions. [2019-12-27 06:21:39,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:21:39,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 06:21:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:39,041 INFO L225 Difference]: With dead ends: 6556 [2019-12-27 06:21:39,042 INFO L226 Difference]: Without dead ends: 6418 [2019-12-27 06:21:39,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:21:39,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6418 states. [2019-12-27 06:21:39,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6418 to 3254. [2019-12-27 06:21:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3254 states. [2019-12-27 06:21:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 9275 transitions. [2019-12-27 06:21:39,094 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 9275 transitions. Word has length 32 [2019-12-27 06:21:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:39,095 INFO L462 AbstractCegarLoop]: Abstraction has 3254 states and 9275 transitions. [2019-12-27 06:21:39,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:21:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 9275 transitions. [2019-12-27 06:21:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:21:39,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:39,099 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] [2019-12-27 06:21:39,099 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 06:21:39,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash 390952001, now seen corresponding path program 1 times [2019-12-27 06:21:39,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:39,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919803610] [2019-12-27 06:21:39,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:39,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:39,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919803610] [2019-12-27 06:21:39,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:39,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:21:39,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030504572] [2019-12-27 06:21:39,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:21:39,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:39,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:21:39,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:21:39,216 INFO L87 Difference]: Start difference. First operand 3254 states and 9275 transitions. Second operand 6 states. [2019-12-27 06:21:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:39,670 INFO L93 Difference]: Finished difference Result 6239 states and 16879 transitions. [2019-12-27 06:21:39,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:21:39,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 06:21:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:39,682 INFO L225 Difference]: With dead ends: 6239 [2019-12-27 06:21:39,682 INFO L226 Difference]: Without dead ends: 6095 [2019-12-27 06:21:39,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:21:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6095 states. [2019-12-27 06:21:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6095 to 3058. [2019-12-27 06:21:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3058 states. [2019-12-27 06:21:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 8767 transitions. [2019-12-27 06:21:39,761 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 8767 transitions. Word has length 33 [2019-12-27 06:21:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:39,761 INFO L462 AbstractCegarLoop]: Abstraction has 3058 states and 8767 transitions. [2019-12-27 06:21:39,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:21:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 8767 transitions. [2019-12-27 06:21:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:21:39,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:39,767 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] [2019-12-27 06:21:39,767 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 06:21:39,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:39,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2023232687, now seen corresponding path program 1 times [2019-12-27 06:21:39,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:39,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639293113] [2019-12-27 06:21:39,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:39,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639293113] [2019-12-27 06:21:39,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:39,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:21:39,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582993613] [2019-12-27 06:21:39,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:21:39,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:39,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:21:39,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:21:39,908 INFO L87 Difference]: Start difference. First operand 3058 states and 8767 transitions. Second operand 7 states. [2019-12-27 06:21:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:40,018 INFO L93 Difference]: Finished difference Result 2310 states and 6941 transitions. [2019-12-27 06:21:40,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:21:40,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:21:40,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:40,021 INFO L225 Difference]: With dead ends: 2310 [2019-12-27 06:21:40,022 INFO L226 Difference]: Without dead ends: 1641 [2019-12-27 06:21:40,022 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 06:21:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-12-27 06:21:40,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1587. [2019-12-27 06:21:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-12-27 06:21:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 4626 transitions. [2019-12-27 06:21:40,048 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 4626 transitions. Word has length 33 [2019-12-27 06:21:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:40,049 INFO L462 AbstractCegarLoop]: Abstraction has 1587 states and 4626 transitions. [2019-12-27 06:21:40,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:21:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 4626 transitions. [2019-12-27 06:21:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:21:40,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:40,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:21:40,053 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 06:21:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:40,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1690133927, now seen corresponding path program 1 times [2019-12-27 06:21:40,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:40,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294851803] [2019-12-27 06:21:40,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:40,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294851803] [2019-12-27 06:21:40,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:40,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:21:40,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063394452] [2019-12-27 06:21:40,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:21:40,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:40,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:21:40,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:21:40,158 INFO L87 Difference]: Start difference. First operand 1587 states and 4626 transitions. Second operand 4 states. [2019-12-27 06:21:40,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:40,178 INFO L93 Difference]: Finished difference Result 2023 states and 5628 transitions. [2019-12-27 06:21:40,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:21:40,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-27 06:21:40,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:40,180 INFO L225 Difference]: With dead ends: 2023 [2019-12-27 06:21:40,180 INFO L226 Difference]: Without dead ends: 481 [2019-12-27 06:21:40,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:21:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-12-27 06:21:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2019-12-27 06:21:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-27 06:21:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1081 transitions. [2019-12-27 06:21:40,188 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1081 transitions. Word has length 48 [2019-12-27 06:21:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:40,189 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 1081 transitions. [2019-12-27 06:21:40,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:21:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1081 transitions. [2019-12-27 06:21:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:21:40,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:40,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:21:40,190 INFO L410 AbstractCegarLoop]: === Iteration 16 === [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 06:21:40,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:40,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1659981285, now seen corresponding path program 2 times [2019-12-27 06:21:40,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:40,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14861802] [2019-12-27 06:21:40,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:21:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:21:40,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14861802] [2019-12-27 06:21:40,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:21:40,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:21:40,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482343771] [2019-12-27 06:21:40,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:21:40,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:21:40,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:21:40,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:21:40,319 INFO L87 Difference]: Start difference. First operand 481 states and 1081 transitions. Second operand 7 states. [2019-12-27 06:21:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:21:40,501 INFO L93 Difference]: Finished difference Result 912 states and 2005 transitions. [2019-12-27 06:21:40,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:21:40,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-27 06:21:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:21:40,502 INFO L225 Difference]: With dead ends: 912 [2019-12-27 06:21:40,502 INFO L226 Difference]: Without dead ends: 606 [2019-12-27 06:21:40,503 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 06:21:40,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-12-27 06:21:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 548. [2019-12-27 06:21:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-27 06:21:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1194 transitions. [2019-12-27 06:21:40,511 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1194 transitions. Word has length 48 [2019-12-27 06:21:40,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:21:40,511 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 1194 transitions. [2019-12-27 06:21:40,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:21:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1194 transitions. [2019-12-27 06:21:40,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 06:21:40,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:21:40,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:21:40,513 INFO L410 AbstractCegarLoop]: === Iteration 17 === [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 06:21:40,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:21:40,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1305532347, now seen corresponding path program 3 times [2019-12-27 06:21:40,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:21:40,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283749439] [2019-12-27 06:21:40,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:21:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:21:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:21:40,739 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:21:40,739 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:21:40,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= v_~b~0_13 0) (= 0 v_~z$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_25) (= v_~z$w_buff0_used~0_92 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t989~0.base_29| 1)) (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_15) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_12 0) (= 0 v_~z$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$w_buff0~0_24) (= v_~z$read_delayed_var~0.offset_5 0) (= 0 |v_ULTIMATE.start_main_~#t989~0.offset_22|) (= 0 v_~z$w_buff1_used~0_61) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~x~0_18 0) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_p3_EBX~0_15) (= v_~z$mem_tmp~0_10 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t989~0.base_29|) (= v_~z$r_buff0_thd3~0_66 0) (= v_~main$tmp_guard1~0_15 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t989~0.base_29|) 0) (= 0 v_~z$r_buff1_thd3~0_43) (= v_~z$r_buff0_thd2~0_9 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~z~0_20 0) (= v_~y~0_11 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t989~0.base_29| 4) |v_#length_29|) (= |v_#memory_int_25| (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t989~0.base_29| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t989~0.base_29|) |v_ULTIMATE.start_main_~#t989~0.offset_22| 0))) (= v_~z$r_buff0_thd0~0_23 0) (= 0 v_~z$r_buff1_thd4~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t991~0.offset=|v_ULTIMATE.start_main_~#t991~0.offset_16|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_15, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_61, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ULTIMATE.start_main_~#t990~0.base=|v_ULTIMATE.start_main_~#t990~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~x~0=v_~x~0_18, ULTIMATE.start_main_~#t989~0.base=|v_ULTIMATE.start_main_~#t989~0.base_29|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_~#t990~0.offset=|v_ULTIMATE.start_main_~#t990~0.offset_18|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t991~0.base=|v_ULTIMATE.start_main_~#t991~0.base_19|, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_24, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ULTIMATE.start_main_~#t992~0.base=|v_ULTIMATE.start_main_~#t992~0.base_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_15, ULTIMATE.start_main_~#t989~0.offset=|v_ULTIMATE.start_main_~#t989~0.offset_22|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ~b~0=v_~b~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ULTIMATE.start_main_~#t992~0.offset=|v_ULTIMATE.start_main_~#t992~0.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t991~0.offset, ULTIMATE.start_main_#t~nondet32, 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, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t990~0.base, ~weak$$choice0~0, 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, ULTIMATE.start_main_~#t989~0.base, ~z$r_buff1_thd4~0, 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_~#t990~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t991~0.base, ~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_~#t992~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t989~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t992~0.offset] because there is no mapped edge [2019-12-27 06:21:40,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L843-1-->L845: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t990~0.base_11| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t990~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t990~0.offset_10| 0) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t990~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t990~0.base_11|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t990~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t990~0.base_11|) |v_ULTIMATE.start_main_~#t990~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t990~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t990~0.base=|v_ULTIMATE.start_main_~#t990~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t990~0.offset=|v_ULTIMATE.start_main_~#t990~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t990~0.base, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t990~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 06:21:40,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L845-1-->L847: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t991~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t991~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t991~0.base_12|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t991~0.base_12|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t991~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t991~0.base_12|) |v_ULTIMATE.start_main_~#t991~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t991~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t991~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t991~0.offset=|v_ULTIMATE.start_main_~#t991~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t991~0.base=|v_ULTIMATE.start_main_~#t991~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t991~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t991~0.base, #length] because there is no mapped edge [2019-12-27 06:21:40,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t992~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t992~0.base_12|) |v_ULTIMATE.start_main_~#t992~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t992~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t992~0.base_12| 0)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t992~0.base_12| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t992~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t992~0.offset_10|) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t992~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_~#t992~0.base=|v_ULTIMATE.start_main_~#t992~0.base_12|, ULTIMATE.start_main_~#t992~0.offset=|v_ULTIMATE.start_main_~#t992~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, #length, ULTIMATE.start_main_~#t992~0.base, ULTIMATE.start_main_~#t992~0.offset] because there is no mapped edge [2019-12-27 06:21:40,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L4-->L820: Formula: (and (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1568224009)) (= ~a~0_Out1568224009 ~__unbuffered_p3_EAX~0_Out1568224009) (= ~z$r_buff0_thd2~0_In1568224009 ~z$r_buff1_thd2~0_Out1568224009) (= ~z$r_buff0_thd1~0_In1568224009 ~z$r_buff1_thd1~0_Out1568224009) (= ~z$r_buff1_thd4~0_Out1568224009 ~z$r_buff0_thd4~0_In1568224009) (= ~b~0_In1568224009 ~__unbuffered_p3_EBX~0_Out1568224009) (= ~a~0_Out1568224009 1) (= ~z$r_buff1_thd3~0_Out1568224009 ~z$r_buff0_thd3~0_In1568224009) (= 1 ~z$r_buff0_thd4~0_Out1568224009) (= ~z$r_buff0_thd0~0_In1568224009 ~z$r_buff1_thd0~0_Out1568224009)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1568224009, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1568224009, ~b~0=~b~0_In1568224009, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1568224009, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1568224009, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1568224009, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1568224009} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1568224009, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1568224009, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1568224009, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1568224009, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1568224009, ~a~0=~a~0_Out1568224009, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1568224009, ~b~0=~b~0_In1568224009, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1568224009, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1568224009, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1568224009, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1568224009, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1568224009, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1568224009, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1568224009} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 06:21:40,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~x~0_10 1) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= 1 v_~b~0_8) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|} OutVars{~b~0=v_~b~0_8, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_10} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-27 06:21:40,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= 2 v_~x~0_8) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_p1_EAX~0_6 v_~y~0_7) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~y~0=v_~y~0_7} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_7, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 06:21:40,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L778-->L778-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1327987676 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1327987676 256) 0))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In1327987676 256) 0)) (and (= 0 (mod ~z$r_buff1_thd3~0_In1327987676 256)) .cse0) (= (mod ~z$w_buff0_used~0_In1327987676 256) 0))) (= ~z$w_buff0~0_In1327987676 |P2Thread1of1ForFork1_#t~ite8_Out1327987676|) .cse1 (= |P2Thread1of1ForFork1_#t~ite9_Out1327987676| |P2Thread1of1ForFork1_#t~ite8_Out1327987676|)) (and (= ~z$w_buff0~0_In1327987676 |P2Thread1of1ForFork1_#t~ite9_Out1327987676|) (= |P2Thread1of1ForFork1_#t~ite8_In1327987676| |P2Thread1of1ForFork1_#t~ite8_Out1327987676|) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1327987676, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1327987676, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1327987676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1327987676, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1327987676, ~weak$$choice2~0=~weak$$choice2~0_In1327987676, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In1327987676|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1327987676, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1327987676, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1327987676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1327987676, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1327987676, ~weak$$choice2~0=~weak$$choice2~0_In1327987676, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out1327987676|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out1327987676|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:21:40,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L779-->L779-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1753613369 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite12_Out-1753613369| |P2Thread1of1ForFork1_#t~ite11_Out-1753613369|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1753613369 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1753613369 256)) (and (= 0 (mod ~z$w_buff1_used~0_In-1753613369 256)) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In-1753613369 256) 0) .cse1))) (= |P2Thread1of1ForFork1_#t~ite11_Out-1753613369| ~z$w_buff1~0_In-1753613369)) (and (= |P2Thread1of1ForFork1_#t~ite11_In-1753613369| |P2Thread1of1ForFork1_#t~ite11_Out-1753613369|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite12_Out-1753613369| ~z$w_buff1~0_In-1753613369)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1753613369, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1753613369, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-1753613369|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1753613369, ~z$w_buff1~0=~z$w_buff1~0_In-1753613369, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1753613369, ~weak$$choice2~0=~weak$$choice2~0_In-1753613369} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1753613369, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-1753613369|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1753613369, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-1753613369|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1753613369, ~z$w_buff1~0=~z$w_buff1~0_In-1753613369, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1753613369, ~weak$$choice2~0=~weak$$choice2~0_In-1753613369} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 06:21:40,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1116817107 256)))) (or (and (= ~z$w_buff0_used~0_In1116817107 |P2Thread1of1ForFork1_#t~ite15_Out1116817107|) (= |P2Thread1of1ForFork1_#t~ite14_In1116817107| |P2Thread1of1ForFork1_#t~ite14_Out1116817107|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite15_Out1116817107| |P2Thread1of1ForFork1_#t~ite14_Out1116817107|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1116817107 256)))) (or (= (mod ~z$w_buff0_used~0_In1116817107 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In1116817107 256) 0)) (and (= (mod ~z$r_buff1_thd3~0_In1116817107 256) 0) .cse1))) (= ~z$w_buff0_used~0_In1116817107 |P2Thread1of1ForFork1_#t~ite14_Out1116817107|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1116817107|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1116817107, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1116817107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1116817107, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1116817107, ~weak$$choice2~0=~weak$$choice2~0_In1116817107} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1116817107|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1116817107|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1116817107, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1116817107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1116817107, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1116817107, ~weak$$choice2~0=~weak$$choice2~0_In1116817107} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-27 06:21:40,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff0_thd3~0_47) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_20, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_8|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 06:21:40,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1616535430 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite23_In1616535430| |P2Thread1of1ForFork1_#t~ite23_Out1616535430|) (not .cse0) (= ~z$r_buff1_thd3~0_In1616535430 |P2Thread1of1ForFork1_#t~ite24_Out1616535430|)) (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1616535430 256) 0))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In1616535430 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1616535430 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1616535430 256))))) (= |P2Thread1of1ForFork1_#t~ite23_Out1616535430| |P2Thread1of1ForFork1_#t~ite24_Out1616535430|) (= ~z$r_buff1_thd3~0_In1616535430 |P2Thread1of1ForFork1_#t~ite23_Out1616535430|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1616535430, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1616535430, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In1616535430|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1616535430, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1616535430, ~weak$$choice2~0=~weak$$choice2~0_In1616535430} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out1616535430|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1616535430, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1616535430, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out1616535430|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1616535430, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1616535430, ~weak$$choice2~0=~weak$$choice2~0_In1616535430} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-27 06:21:40,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~z~0_13 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 06:21:40,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-203516133 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-203516133 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-203516133 |P3Thread1of1ForFork2_#t~ite28_Out-203516133|)) (and (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-203516133|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-203516133, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-203516133} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-203516133|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-203516133, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-203516133} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 06:21:40,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-490604717 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-490604717 256))) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-490604717 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-490604717 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite29_Out-490604717| ~z$w_buff1_used~0_In-490604717)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P3Thread1of1ForFork2_#t~ite29_Out-490604717|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-490604717, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-490604717, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-490604717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-490604717} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-490604717|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-490604717, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-490604717, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-490604717, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-490604717} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 06:21:40,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In73299470 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In73299470 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out73299470 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out73299470 ~z$r_buff0_thd4~0_In73299470)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In73299470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In73299470} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In73299470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out73299470, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out73299470|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 06:21:40,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-298569020 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-298569020 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-298569020 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-298569020 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite31_Out-298569020| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out-298569020| ~z$r_buff1_thd4~0_In-298569020)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-298569020, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-298569020, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-298569020, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-298569020} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-298569020, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-298569020, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-298569020, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-298569020, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-298569020|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 06:21:40,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L824-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_8| v_~z$r_buff1_thd4~0_16) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_8|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_7|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 06:21:40,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_63 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_63, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:21:40,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-126441130 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-126441130 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite36_Out-126441130| |ULTIMATE.start_main_#t~ite37_Out-126441130|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite36_Out-126441130| ~z$w_buff1~0_In-126441130)) (and (= ~z~0_In-126441130 |ULTIMATE.start_main_#t~ite36_Out-126441130|) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-126441130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-126441130, ~z$w_buff1~0=~z$w_buff1~0_In-126441130, ~z~0=~z~0_In-126441130} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-126441130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-126441130, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-126441130|, ~z$w_buff1~0=~z$w_buff1~0_In-126441130, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-126441130|, ~z~0=~z~0_In-126441130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 06:21:40,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-142991704 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-142991704 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out-142991704|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-142991704 |ULTIMATE.start_main_#t~ite38_Out-142991704|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-142991704, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-142991704} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-142991704, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-142991704, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-142991704|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:21:40,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In1430137268 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1430137268 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1430137268 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1430137268 256) 0))) (or (and (= ~z$w_buff1_used~0_In1430137268 |ULTIMATE.start_main_#t~ite39_Out1430137268|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out1430137268|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1430137268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1430137268, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1430137268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1430137268} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1430137268, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1430137268|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1430137268, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1430137268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1430137268} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 06:21:40,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-417765966 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-417765966 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out-417765966|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-417765966| ~z$r_buff0_thd0~0_In-417765966) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-417765966, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-417765966} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-417765966, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-417765966|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-417765966} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:21:40,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1708936433 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1708936433 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1708936433 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1708936433 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1708936433 |ULTIMATE.start_main_#t~ite41_Out1708936433|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out1708936433| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1708936433, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1708936433, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1708936433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1708936433} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1708936433|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1708936433, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1708936433, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1708936433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1708936433} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 06:21:40,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_9 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~main$tmp_guard1~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite41_11| v_~z$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p3_EBX~0_8) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= 1 v_~__unbuffered_p3_EAX~0_10) (= v_~x~0_11 2)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} 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 06:21:40,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:21:40 BasicIcfg [2019-12-27 06:21:40,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:21:40,880 INFO L168 Benchmark]: Toolchain (without parser) took 27788.59 ms. Allocated memory was 140.0 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 103.2 MB in the beginning and 1.1 GB in the end (delta: -970.2 MB). Peak memory consumption was 500.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:21:40,881 INFO L168 Benchmark]: CDTParser took 0.72 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 06:21:40,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.14 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.8 MB in the beginning and 157.4 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:21:40,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.91 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:21:40,887 INFO L168 Benchmark]: Boogie Preprocessor took 38.07 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:21:40,888 INFO L168 Benchmark]: RCFGBuilder took 784.20 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 106.7 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:21:40,889 INFO L168 Benchmark]: TraceAbstraction took 26168.58 ms. Allocated memory was 203.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 106.1 MB in the beginning and 1.1 GB in the end (delta: -967.3 MB). Peak memory consumption was 439.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:21:40,895 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.72 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 725.14 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.8 MB in the beginning and 157.4 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.91 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.07 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 784.20 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 106.7 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26168.58 ms. Allocated memory was 203.9 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 106.1 MB in the beginning and 1.1 GB in the end (delta: -967.3 MB). Peak memory consumption was 439.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 170 ProgramPointsBefore, 75 ProgramPointsAfterwards, 192 TransitionsBefore, 79 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 23 ChoiceCompositions, 5618 VarBasedMoverChecksPositive, 130 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 45931 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t989, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t990, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t991, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t992, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=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] [L770] 3 y = 1 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L777] 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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L777] 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) [L778] 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)) [L779] 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)) [L780] 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)) [L781] 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=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 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)) [L783] 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)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L820] 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) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 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 [L851] 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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 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 [L858] 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, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1707 SDtfs, 2324 SDslu, 2719 SDs, 0 SdLazy, 1053 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31130occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 15900 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 410 ConstructedInterpolants, 0 QuantifiedInterpolants, 36052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...