/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:35:30,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:35:30,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:35:30,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:35:30,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:35:30,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:35:30,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:35:30,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:35:30,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:35:30,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:35:30,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:35:30,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:35:30,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:35:30,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:35:30,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:35:30,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:35:30,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:35:30,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:35:30,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:35:30,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:35:30,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:35:30,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:35:30,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:35:30,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:35:30,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:35:30,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:35:30,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:35:30,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:35:30,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:35:30,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:35:30,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:35:30,592 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:35:30,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:35:30,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:35:30,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:35:30,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:35:30,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:35:30,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:35:30,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:35:30,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:35:30,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:35:30,599 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:35:30,623 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:35:30,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:35:30,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:35:30,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:35:30,625 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:35:30,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:35:30,625 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:35:30,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:35:30,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:35:30,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:35:30,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:35:30,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:35:30,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:35:30,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:35:30,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:35:30,627 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:35:30,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:35:30,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:35:30,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:35:30,628 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:35:30,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:35:30,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:35:30,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:35:30,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:35:30,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:35:30,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:35:30,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:35:30,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:35:30,630 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:35:30,630 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:35:30,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:35:30,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:35:30,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:35:30,927 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:35:30,927 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:35:30,928 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2019-12-26 22:35:31,008 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/935d852aa/a439a51e3d2c47b1a65d8607729e5777/FLAG096362b8e [2019-12-26 22:35:31,603 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:35:31,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2019-12-26 22:35:31,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/935d852aa/a439a51e3d2c47b1a65d8607729e5777/FLAG096362b8e [2019-12-26 22:35:31,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/935d852aa/a439a51e3d2c47b1a65d8607729e5777 [2019-12-26 22:35:31,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:35:31,912 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:35:31,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:35:31,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:35:31,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:35:31,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:35:31" (1/1) ... [2019-12-26 22:35:31,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b25d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:31, skipping insertion in model container [2019-12-26 22:35:31,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:35:31" (1/1) ... [2019-12-26 22:35:31,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:35:31,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:35:32,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:35:32,533 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:35:32,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:35:32,695 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:35:32,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:32 WrapperNode [2019-12-26 22:35:32,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:35:32,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:35:32,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:35:32,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:35:32,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:32" (1/1) ... [2019-12-26 22:35:32,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:32" (1/1) ... [2019-12-26 22:35:32,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:35:32,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:35:32,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:35:32,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:35:32,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:32" (1/1) ... [2019-12-26 22:35:32,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:32" (1/1) ... [2019-12-26 22:35:32,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:32" (1/1) ... [2019-12-26 22:35:32,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:32" (1/1) ... [2019-12-26 22:35:32,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:32" (1/1) ... [2019-12-26 22:35:32,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:32" (1/1) ... [2019-12-26 22:35:32,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:32" (1/1) ... [2019-12-26 22:35:32,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:35:32,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:35:32,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:35:32,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:35:32,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:35:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:35:32,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:35:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:35:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:35:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:35:32,888 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:35:32,888 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:35:32,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:35:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:35:32,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:35:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:35:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:35:32,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:35:32,892 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:35:33,615 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:35:33,616 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:35:33,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:35:33 BoogieIcfgContainer [2019-12-26 22:35:33,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:35:33,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:35:33,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:35:33,623 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:35:33,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:35:31" (1/3) ... [2019-12-26 22:35:33,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29295f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:35:33, skipping insertion in model container [2019-12-26 22:35:33,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:32" (2/3) ... [2019-12-26 22:35:33,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29295f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:35:33, skipping insertion in model container [2019-12-26 22:35:33,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:35:33" (3/3) ... [2019-12-26 22:35:33,627 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_pso.opt.i [2019-12-26 22:35:33,639 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:35:33,639 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:35:33,648 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:35:33,649 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:35:33,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,686 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,686 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,688 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,688 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,697 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,697 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,697 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,698 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,698 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,708 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,709 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,713 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,714 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,715 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,716 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,718 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,719 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:33,735 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:35:33,756 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:35:33,756 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:35:33,756 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:35:33,757 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:35:33,757 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:35:33,757 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:35:33,757 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:35:33,757 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:35:33,774 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-26 22:35:33,776 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-26 22:35:33,888 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-26 22:35:33,888 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:35:33,905 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 22:35:33,921 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-26 22:35:34,016 INFO L132 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-26 22:35:34,016 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:35:34,026 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 0/150 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 22:35:34,044 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-26 22:35:34,045 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:35:38,978 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-26 22:35:39,105 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 22:35:39,126 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50142 [2019-12-26 22:35:39,126 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-26 22:35:39,130 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 86 transitions [2019-12-26 22:35:39,854 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-26 22:35:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-26 22:35:39,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 22:35:39,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:39,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:39,862 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:39,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:39,866 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-26 22:35:39,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:39,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237823957] [2019-12-26 22:35:39,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:40,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237823957] [2019-12-26 22:35:40,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:40,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:35:40,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428972163] [2019-12-26 22:35:40,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:35:40,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:40,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:35:40,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:40,201 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-26 22:35:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:40,505 INFO L93 Difference]: Finished difference Result 14182 states and 53160 transitions. [2019-12-26 22:35:40,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:35:40,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 22:35:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:40,687 INFO L225 Difference]: With dead ends: 14182 [2019-12-26 22:35:40,687 INFO L226 Difference]: Without dead ends: 13870 [2019-12-26 22:35:40,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:41,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-26 22:35:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-26 22:35:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-26 22:35:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 52042 transitions. [2019-12-26 22:35:41,952 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 52042 transitions. Word has length 7 [2019-12-26 22:35:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:41,953 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 52042 transitions. [2019-12-26 22:35:41,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:35:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 52042 transitions. [2019-12-26 22:35:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:35:41,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:41,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:41,959 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:41,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:41,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-26 22:35:41,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:41,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918107708] [2019-12-26 22:35:41,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:42,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:42,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918107708] [2019-12-26 22:35:42,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:42,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:35:42,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9655732] [2019-12-26 22:35:42,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:35:42,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:42,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:35:42,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:35:42,063 INFO L87 Difference]: Start difference. First operand 13870 states and 52042 transitions. Second operand 4 states. [2019-12-26 22:35:42,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:42,528 INFO L93 Difference]: Finished difference Result 19034 states and 69248 transitions. [2019-12-26 22:35:42,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:35:42,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:35:42,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:42,644 INFO L225 Difference]: With dead ends: 19034 [2019-12-26 22:35:42,645 INFO L226 Difference]: Without dead ends: 19034 [2019-12-26 22:35:42,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:42,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-26 22:35:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-26 22:35:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-26 22:35:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68487 transitions. [2019-12-26 22:35:43,368 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68487 transitions. Word has length 13 [2019-12-26 22:35:43,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:43,368 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68487 transitions. [2019-12-26 22:35:43,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:35:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68487 transitions. [2019-12-26 22:35:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:35:43,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:43,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:43,372 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:43,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-26 22:35:43,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:43,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623098464] [2019-12-26 22:35:43,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:43,629 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-26 22:35:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:43,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623098464] [2019-12-26 22:35:43,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:43,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:35:43,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985191135] [2019-12-26 22:35:43,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:35:43,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:43,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:35:43,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:35:43,640 INFO L87 Difference]: Start difference. First operand 18800 states and 68487 transitions. Second operand 4 states. [2019-12-26 22:35:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:44,016 INFO L93 Difference]: Finished difference Result 27022 states and 96312 transitions. [2019-12-26 22:35:44,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:35:44,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:35:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:44,169 INFO L225 Difference]: With dead ends: 27022 [2019-12-26 22:35:44,169 INFO L226 Difference]: Without dead ends: 27008 [2019-12-26 22:35:44,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:44,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-26 22:35:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22366. [2019-12-26 22:35:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22366 states. [2019-12-26 22:35:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22366 states to 22366 states and 80994 transitions. [2019-12-26 22:35:45,880 INFO L78 Accepts]: Start accepts. Automaton has 22366 states and 80994 transitions. Word has length 13 [2019-12-26 22:35:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:45,880 INFO L462 AbstractCegarLoop]: Abstraction has 22366 states and 80994 transitions. [2019-12-26 22:35:45,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:35:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 22366 states and 80994 transitions. [2019-12-26 22:35:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 22:35:45,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:45,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:45,888 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:45,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-26 22:35:45,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:45,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251209724] [2019-12-26 22:35:45,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:46,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251209724] [2019-12-26 22:35:46,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:46,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:35:46,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755908309] [2019-12-26 22:35:46,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:35:46,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:46,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:35:46,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:35:46,023 INFO L87 Difference]: Start difference. First operand 22366 states and 80994 transitions. Second operand 4 states. [2019-12-26 22:35:46,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:46,114 INFO L93 Difference]: Finished difference Result 13191 states and 41157 transitions. [2019-12-26 22:35:46,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:35:46,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 22:35:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:46,137 INFO L225 Difference]: With dead ends: 13191 [2019-12-26 22:35:46,137 INFO L226 Difference]: Without dead ends: 12661 [2019-12-26 22:35:46,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12661 states. [2019-12-26 22:35:46,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12661 to 12661. [2019-12-26 22:35:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12661 states. [2019-12-26 22:35:46,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12661 states to 12661 states and 39651 transitions. [2019-12-26 22:35:46,537 INFO L78 Accepts]: Start accepts. Automaton has 12661 states and 39651 transitions. Word has length 19 [2019-12-26 22:35:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:46,538 INFO L462 AbstractCegarLoop]: Abstraction has 12661 states and 39651 transitions. [2019-12-26 22:35:46,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:35:46,538 INFO L276 IsEmpty]: Start isEmpty. Operand 12661 states and 39651 transitions. [2019-12-26 22:35:46,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-26 22:35:46,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:46,546 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-26 22:35:46,546 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:46,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:46,547 INFO L82 PathProgramCache]: Analyzing trace with hash -21144877, now seen corresponding path program 1 times [2019-12-26 22:35:46,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:46,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960512107] [2019-12-26 22:35:46,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:46,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960512107] [2019-12-26 22:35:46,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:46,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:35:46,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904013390] [2019-12-26 22:35:46,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:35:46,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:46,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:35:46,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:46,672 INFO L87 Difference]: Start difference. First operand 12661 states and 39651 transitions. Second operand 5 states. [2019-12-26 22:35:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:47,305 INFO L93 Difference]: Finished difference Result 16929 states and 51829 transitions. [2019-12-26 22:35:47,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:35:47,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-26 22:35:47,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:47,342 INFO L225 Difference]: With dead ends: 16929 [2019-12-26 22:35:47,342 INFO L226 Difference]: Without dead ends: 16922 [2019-12-26 22:35:47,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:35:47,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16922 states. [2019-12-26 22:35:47,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16922 to 12812. [2019-12-26 22:35:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12812 states. [2019-12-26 22:35:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12812 states to 12812 states and 40017 transitions. [2019-12-26 22:35:47,707 INFO L78 Accepts]: Start accepts. Automaton has 12812 states and 40017 transitions. Word has length 20 [2019-12-26 22:35:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:47,708 INFO L462 AbstractCegarLoop]: Abstraction has 12812 states and 40017 transitions. [2019-12-26 22:35:47,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:35:47,708 INFO L276 IsEmpty]: Start isEmpty. Operand 12812 states and 40017 transitions. [2019-12-26 22:35:47,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:35:47,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:47,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:47,720 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:47,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:47,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1806206056, now seen corresponding path program 1 times [2019-12-26 22:35:47,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:47,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182154260] [2019-12-26 22:35:47,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:47,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182154260] [2019-12-26 22:35:47,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:47,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:35:47,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487163393] [2019-12-26 22:35:47,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:35:47,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:47,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:35:47,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:35:47,809 INFO L87 Difference]: Start difference. First operand 12812 states and 40017 transitions. Second operand 6 states. [2019-12-26 22:35:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:48,257 INFO L93 Difference]: Finished difference Result 17980 states and 54854 transitions. [2019-12-26 22:35:48,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:35:48,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-26 22:35:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:48,281 INFO L225 Difference]: With dead ends: 17980 [2019-12-26 22:35:48,281 INFO L226 Difference]: Without dead ends: 17964 [2019-12-26 22:35:48,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:35:48,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17964 states. [2019-12-26 22:35:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17964 to 15695. [2019-12-26 22:35:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15695 states. [2019-12-26 22:35:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15695 states to 15695 states and 48333 transitions. [2019-12-26 22:35:48,846 INFO L78 Accepts]: Start accepts. Automaton has 15695 states and 48333 transitions. Word has length 28 [2019-12-26 22:35:48,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:48,847 INFO L462 AbstractCegarLoop]: Abstraction has 15695 states and 48333 transitions. [2019-12-26 22:35:48,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:35:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 15695 states and 48333 transitions. [2019-12-26 22:35:48,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:35:48,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:48,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:48,872 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:48,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:48,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1223733812, now seen corresponding path program 1 times [2019-12-26 22:35:48,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:48,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177785532] [2019-12-26 22:35:48,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:48,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177785532] [2019-12-26 22:35:48,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:48,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:35:48,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531092337] [2019-12-26 22:35:48,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:35:48,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:48,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:35:48,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:48,930 INFO L87 Difference]: Start difference. First operand 15695 states and 48333 transitions. Second operand 3 states. [2019-12-26 22:35:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:49,042 INFO L93 Difference]: Finished difference Result 19865 states and 61636 transitions. [2019-12-26 22:35:49,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:35:49,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-26 22:35:49,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:49,070 INFO L225 Difference]: With dead ends: 19865 [2019-12-26 22:35:49,070 INFO L226 Difference]: Without dead ends: 19865 [2019-12-26 22:35:49,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19865 states. [2019-12-26 22:35:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19865 to 17509. [2019-12-26 22:35:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17509 states. [2019-12-26 22:35:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17509 states to 17509 states and 54532 transitions. [2019-12-26 22:35:49,380 INFO L78 Accepts]: Start accepts. Automaton has 17509 states and 54532 transitions. Word has length 34 [2019-12-26 22:35:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:49,380 INFO L462 AbstractCegarLoop]: Abstraction has 17509 states and 54532 transitions. [2019-12-26 22:35:49,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:35:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 17509 states and 54532 transitions. [2019-12-26 22:35:49,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:35:49,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:49,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:49,399 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:49,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:49,400 INFO L82 PathProgramCache]: Analyzing trace with hash 345963664, now seen corresponding path program 1 times [2019-12-26 22:35:49,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:49,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906529135] [2019-12-26 22:35:49,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:49,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:49,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906529135] [2019-12-26 22:35:49,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:49,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:35:49,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268462303] [2019-12-26 22:35:49,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:35:49,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:49,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:35:49,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:49,476 INFO L87 Difference]: Start difference. First operand 17509 states and 54532 transitions. Second operand 5 states. [2019-12-26 22:35:49,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:49,533 INFO L93 Difference]: Finished difference Result 2582 states and 6108 transitions. [2019-12-26 22:35:49,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:35:49,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-26 22:35:49,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:49,536 INFO L225 Difference]: With dead ends: 2582 [2019-12-26 22:35:49,537 INFO L226 Difference]: Without dead ends: 2273 [2019-12-26 22:35:49,537 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-26 22:35:49,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-12-26 22:35:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2273. [2019-12-26 22:35:49,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2273 states. [2019-12-26 22:35:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 5247 transitions. [2019-12-26 22:35:49,559 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 5247 transitions. Word has length 34 [2019-12-26 22:35:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:49,559 INFO L462 AbstractCegarLoop]: Abstraction has 2273 states and 5247 transitions. [2019-12-26 22:35:49,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:35:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 5247 transitions. [2019-12-26 22:35:49,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:35:49,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:49,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:49,562 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:49,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:49,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1654876811, now seen corresponding path program 1 times [2019-12-26 22:35:49,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:49,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547975270] [2019-12-26 22:35:49,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:49,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547975270] [2019-12-26 22:35:49,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:49,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:35:49,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296265980] [2019-12-26 22:35:49,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:35:49,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:49,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:35:49,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:35:49,667 INFO L87 Difference]: Start difference. First operand 2273 states and 5247 transitions. Second operand 7 states. [2019-12-26 22:35:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:50,398 INFO L93 Difference]: Finished difference Result 2819 states and 6311 transitions. [2019-12-26 22:35:50,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 22:35:50,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-26 22:35:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:50,403 INFO L225 Difference]: With dead ends: 2819 [2019-12-26 22:35:50,403 INFO L226 Difference]: Without dead ends: 2817 [2019-12-26 22:35:50,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:35:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2019-12-26 22:35:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2403. [2019-12-26 22:35:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2403 states. [2019-12-26 22:35:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 5508 transitions. [2019-12-26 22:35:50,430 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 5508 transitions. Word has length 40 [2019-12-26 22:35:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:50,430 INFO L462 AbstractCegarLoop]: Abstraction has 2403 states and 5508 transitions. [2019-12-26 22:35:50,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:35:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 5508 transitions. [2019-12-26 22:35:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-26 22:35:50,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:50,433 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:50,434 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:50,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1698133153, now seen corresponding path program 1 times [2019-12-26 22:35:50,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:50,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220450029] [2019-12-26 22:35:50,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:50,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-26 22:35:50,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220450029] [2019-12-26 22:35:50,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:50,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:35:50,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049300919] [2019-12-26 22:35:50,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:35:50,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:50,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:35:50,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:50,530 INFO L87 Difference]: Start difference. First operand 2403 states and 5508 transitions. Second operand 5 states. [2019-12-26 22:35:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:51,003 INFO L93 Difference]: Finished difference Result 3250 states and 7346 transitions. [2019-12-26 22:35:51,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:35:51,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-26 22:35:51,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:51,008 INFO L225 Difference]: With dead ends: 3250 [2019-12-26 22:35:51,008 INFO L226 Difference]: Without dead ends: 3250 [2019-12-26 22:35:51,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:35:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2019-12-26 22:35:51,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2977. [2019-12-26 22:35:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2977 states. [2019-12-26 22:35:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 6800 transitions. [2019-12-26 22:35:51,051 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 6800 transitions. Word has length 44 [2019-12-26 22:35:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:51,055 INFO L462 AbstractCegarLoop]: Abstraction has 2977 states and 6800 transitions. [2019-12-26 22:35:51,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:35:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 6800 transitions. [2019-12-26 22:35:51,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-26 22:35:51,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:51,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:51,062 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:51,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:51,062 INFO L82 PathProgramCache]: Analyzing trace with hash 682662632, now seen corresponding path program 1 times [2019-12-26 22:35:51,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:51,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229910789] [2019-12-26 22:35:51,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:51,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229910789] [2019-12-26 22:35:51,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:51,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:35:51,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746212690] [2019-12-26 22:35:51,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:35:51,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:51,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:35:51,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:35:51,191 INFO L87 Difference]: Start difference. First operand 2977 states and 6800 transitions. Second operand 6 states. [2019-12-26 22:35:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:51,257 INFO L93 Difference]: Finished difference Result 999 states and 2272 transitions. [2019-12-26 22:35:51,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:35:51,259 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-26 22:35:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:51,261 INFO L225 Difference]: With dead ends: 999 [2019-12-26 22:35:51,261 INFO L226 Difference]: Without dead ends: 929 [2019-12-26 22:35:51,262 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-26 22:35:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-26 22:35:51,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 799. [2019-12-26 22:35:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-12-26 22:35:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1831 transitions. [2019-12-26 22:35:51,274 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1831 transitions. Word has length 45 [2019-12-26 22:35:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:51,275 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1831 transitions. [2019-12-26 22:35:51,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:35:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1831 transitions. [2019-12-26 22:35:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 22:35:51,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:51,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:51,278 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:51,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:51,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1740404695, now seen corresponding path program 1 times [2019-12-26 22:35:51,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:51,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345759649] [2019-12-26 22:35:51,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:51,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-26 22:35:51,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345759649] [2019-12-26 22:35:51,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:51,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:35:51,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463895372] [2019-12-26 22:35:51,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:35:51,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:51,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:35:51,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:51,378 INFO L87 Difference]: Start difference. First operand 799 states and 1831 transitions. Second operand 3 states. [2019-12-26 22:35:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:51,418 INFO L93 Difference]: Finished difference Result 799 states and 1830 transitions. [2019-12-26 22:35:51,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:35:51,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-26 22:35:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:51,420 INFO L225 Difference]: With dead ends: 799 [2019-12-26 22:35:51,420 INFO L226 Difference]: Without dead ends: 799 [2019-12-26 22:35:51,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:51,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-26 22:35:51,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 642. [2019-12-26 22:35:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-26 22:35:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1470 transitions. [2019-12-26 22:35:51,433 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1470 transitions. Word has length 55 [2019-12-26 22:35:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:51,434 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 1470 transitions. [2019-12-26 22:35:51,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:35:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1470 transitions. [2019-12-26 22:35:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 22:35:51,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:51,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:51,436 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:51,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1993080434, now seen corresponding path program 1 times [2019-12-26 22:35:51,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:51,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413419347] [2019-12-26 22:35:51,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:51,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413419347] [2019-12-26 22:35:51,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:51,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:35:51,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604315579] [2019-12-26 22:35:51,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:35:51,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:51,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:35:51,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:51,527 INFO L87 Difference]: Start difference. First operand 642 states and 1470 transitions. Second operand 3 states. [2019-12-26 22:35:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:51,546 INFO L93 Difference]: Finished difference Result 642 states and 1440 transitions. [2019-12-26 22:35:51,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:35:51,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-26 22:35:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:51,547 INFO L225 Difference]: With dead ends: 642 [2019-12-26 22:35:51,547 INFO L226 Difference]: Without dead ends: 642 [2019-12-26 22:35:51,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-12-26 22:35:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 606. [2019-12-26 22:35:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-26 22:35:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1354 transitions. [2019-12-26 22:35:51,556 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1354 transitions. Word has length 56 [2019-12-26 22:35:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:51,557 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1354 transitions. [2019-12-26 22:35:51,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:35:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1354 transitions. [2019-12-26 22:35:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:35:51,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:51,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:51,559 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:51,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:51,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2052620165, now seen corresponding path program 1 times [2019-12-26 22:35:51,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:51,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902632223] [2019-12-26 22:35:51,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:51,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902632223] [2019-12-26 22:35:51,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:51,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:35:51,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615208484] [2019-12-26 22:35:51,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:35:51,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:51,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:35:51,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:35:51,711 INFO L87 Difference]: Start difference. First operand 606 states and 1354 transitions. Second operand 7 states. [2019-12-26 22:35:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:51,860 INFO L93 Difference]: Finished difference Result 960 states and 2014 transitions. [2019-12-26 22:35:51,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:35:51,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-26 22:35:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:51,862 INFO L225 Difference]: With dead ends: 960 [2019-12-26 22:35:51,862 INFO L226 Difference]: Without dead ends: 610 [2019-12-26 22:35:51,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:35:51,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-26 22:35:51,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 544. [2019-12-26 22:35:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-26 22:35:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1175 transitions. [2019-12-26 22:35:51,871 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1175 transitions. Word has length 57 [2019-12-26 22:35:51,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:51,872 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 1175 transitions. [2019-12-26 22:35:51,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:35:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1175 transitions. [2019-12-26 22:35:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:35:51,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:51,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:51,874 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:51,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:51,874 INFO L82 PathProgramCache]: Analyzing trace with hash -892812541, now seen corresponding path program 2 times [2019-12-26 22:35:51,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:51,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39943338] [2019-12-26 22:35:51,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:35:52,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39943338] [2019-12-26 22:35:52,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:52,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:35:52,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138724802] [2019-12-26 22:35:52,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:35:52,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:52,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:35:52,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:35:52,161 INFO L87 Difference]: Start difference. First operand 544 states and 1175 transitions. Second operand 13 states. [2019-12-26 22:35:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:52,622 INFO L93 Difference]: Finished difference Result 852 states and 1845 transitions. [2019-12-26 22:35:52,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:35:52,623 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-26 22:35:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:52,624 INFO L225 Difference]: With dead ends: 852 [2019-12-26 22:35:52,624 INFO L226 Difference]: Without dead ends: 822 [2019-12-26 22:35:52,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2019-12-26 22:35:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-26 22:35:52,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 748. [2019-12-26 22:35:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-12-26 22:35:52,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1628 transitions. [2019-12-26 22:35:52,638 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1628 transitions. Word has length 57 [2019-12-26 22:35:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:52,639 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1628 transitions. [2019-12-26 22:35:52,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:35:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1628 transitions. [2019-12-26 22:35:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 22:35:52,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:52,641 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:52,641 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:52,642 INFO L82 PathProgramCache]: Analyzing trace with hash 729108355, now seen corresponding path program 3 times [2019-12-26 22:35:52,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:52,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616310137] [2019-12-26 22:35:52,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:35:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:35:52,804 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:35:52,806 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:35:52,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~y$w_buff0_used~0_565 0) (= v_~y$w_buff1_used~0_304 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1114~0.base_27|) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff0_thd0~0_292 0) (= 0 v_~weak$$choice2~0_82) (= 0 v_~y$read_delayed_var~0.offset_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27|) 0) (= 0 v_~__unbuffered_cnt~0_94) (= 0 v_~y$r_buff1_thd3~0_89) (= v_~y$read_delayed~0_8 0) (= 0 v_~y$r_buff1_thd2~0_113) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27|) |v_ULTIMATE.start_main_~#t1114~0.offset_21| 0)) |v_#memory_int_15|) (= v_~main$tmp_guard1~0_30 0) (= v_~x~0_51 0) (= v_~y$w_buff1~0_136 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1114~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd1~0_41 0) (= 0 |v_ULTIMATE.start_main_~#t1114~0.offset_21|) (= v_~a~0_57 0) (= v_~y$mem_tmp~0_17 0) (= v_~z~0_41 0) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~__unbuffered_p2_EBX~0_54 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27| 1)) (= v_~y~0_123 0) (= v_~y$r_buff1_thd0~0_196 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd3~0_130) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p0_EAX~0_39) (= 0 v_~weak$$choice0~0_13) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_34) (= 0 v_~y$w_buff0~0_162))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1114~0.offset=|v_ULTIMATE.start_main_~#t1114~0.offset_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_35|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_50|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_57, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$flush_delayed~0=v_~y$flush_delayed~0_34, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_26|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_116|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_33|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_25|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~y$w_buff1~0=v_~y$w_buff1~0_136, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_21|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_20|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_196, ~x~0=v_~x~0_51, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_565, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_49|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_27|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_27|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_28|, ~y$w_buff0~0=v_~y$w_buff0~0_162, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_130, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_32|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_196|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_28|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_110|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_292, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1114~0.base=|v_ULTIMATE.start_main_~#t1114~0.base_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_41, ~weak$$choice2~0=v_~weak$$choice2~0_82, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_304} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1114~0.offset, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1115~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1116~0.base, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1114~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 22:35:52,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1115~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1115~0.base_9|) (= |v_ULTIMATE.start_main_~#t1115~0.offset_8| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1115~0.base_9| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9|) |v_ULTIMATE.start_main_~#t1115~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, #length, ULTIMATE.start_main_~#t1115~0.base] because there is no mapped edge [2019-12-26 22:35:52,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1116~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1116~0.offset_10| 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10|) |v_ULTIMATE.start_main_~#t1116~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1116~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1116~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1116~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-26 22:35:52,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L4-->L789: Formula: (and (not (= 0 P2Thread1of1ForFork1___VERIFIER_assert_~expression_In1815384230)) (= ~z~0_Out1815384230 1) (= ~z~0_Out1815384230 ~__unbuffered_p2_EAX~0_Out1815384230) (= ~y$r_buff0_thd3~0_In1815384230 ~y$r_buff1_thd3~0_Out1815384230) (= ~a~0_In1815384230 ~__unbuffered_p2_EBX~0_Out1815384230) (= ~y$r_buff0_thd1~0_In1815384230 ~y$r_buff1_thd1~0_Out1815384230) (= ~y$r_buff0_thd3~0_Out1815384230 1) (= ~y$r_buff1_thd0~0_Out1815384230 ~y$r_buff0_thd0~0_In1815384230) (= ~y$r_buff1_thd2~0_Out1815384230 ~y$r_buff0_thd2~0_In1815384230)) InVars {~a~0=~a~0_In1815384230, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1815384230, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1815384230, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1815384230, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1815384230, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In1815384230} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out1815384230, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In1815384230, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1815384230, ~a~0=~a~0_In1815384230, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1815384230, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out1815384230, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1815384230, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1815384230, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1815384230, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1815384230, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out1815384230, ~z~0=~z~0_Out1815384230, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1815384230} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 22:35:52,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_P0Thread1of1ForFork2_~arg.base_10 |v_P0Thread1of1ForFork2_#in~arg.base_10|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_10| v_P0Thread1of1ForFork2_~arg.offset_10) (= v_~a~0_22 1) (= v_~x~0_29 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, ~x~0=v_~x~0_29} OutVars{~a~0=v_~a~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_10|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_10, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_10|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_10} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-26 22:35:52,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-473056808 256))) (.cse2 (= |P1Thread1of1ForFork0_#t~ite3_Out-473056808| |P1Thread1of1ForFork0_#t~ite4_Out-473056808|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-473056808 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite3_Out-473056808| ~y~0_In-473056808) (or .cse0 .cse1) .cse2) (and (not .cse0) .cse2 (not .cse1) (= ~y$w_buff1~0_In-473056808 |P1Thread1of1ForFork0_#t~ite3_Out-473056808|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-473056808, ~y$w_buff1~0=~y$w_buff1~0_In-473056808, ~y~0=~y~0_In-473056808, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-473056808} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-473056808, ~y$w_buff1~0=~y$w_buff1~0_In-473056808, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out-473056808|, ~y~0=~y~0_In-473056808, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out-473056808|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-473056808} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 22:35:52,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In698661090 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In698661090 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite11_Out698661090|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In698661090 |P2Thread1of1ForFork1_#t~ite11_Out698661090|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In698661090, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In698661090} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In698661090, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out698661090|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In698661090} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 22:35:52,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In497078788 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In497078788 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In497078788 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In497078788 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite12_Out497078788| ~y$w_buff1_used~0_In497078788) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite12_Out497078788| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In497078788, ~y$w_buff0_used~0=~y$w_buff0_used~0_In497078788, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In497078788, ~y$w_buff1_used~0=~y$w_buff1_used~0_In497078788} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In497078788, ~y$w_buff0_used~0=~y$w_buff0_used~0_In497078788, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In497078788, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out497078788|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In497078788} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 22:35:52,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1075652419 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1075652419 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out1075652419 ~y$r_buff0_thd3~0_In1075652419) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out1075652419 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1075652419, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1075652419} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out1075652419|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1075652419, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1075652419} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 22:35:52,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd3~0_In533089617 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In533089617 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In533089617 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In533089617 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite14_Out533089617|)) (and (= |P2Thread1of1ForFork1_#t~ite14_Out533089617| ~y$r_buff1_thd3~0_In533089617) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In533089617, ~y$w_buff0_used~0=~y$w_buff0_used~0_In533089617, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In533089617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In533089617} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out533089617|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In533089617, ~y$w_buff0_used~0=~y$w_buff0_used~0_In533089617, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In533089617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In533089617} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 22:35:52,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#t~ite14_36| v_~y$r_buff1_thd3~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_35|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 22:35:52,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1976144321 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1976144321 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite5_Out1976144321| ~y$w_buff0_used~0_In1976144321) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite5_Out1976144321| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1976144321, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1976144321} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1976144321, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1976144321, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out1976144321|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:35:52,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1305699190 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1305699190 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1305699190 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1305699190 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite6_Out-1305699190|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1305699190 |P1Thread1of1ForFork0_#t~ite6_Out-1305699190|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1305699190, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1305699190, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1305699190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1305699190} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1305699190, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1305699190, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1305699190, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out-1305699190|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1305699190} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:35:52,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1611799854 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1611799854 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite7_Out1611799854| ~y$r_buff0_thd2~0_In1611799854) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite7_Out1611799854|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1611799854, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1611799854} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1611799854, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1611799854, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out1611799854|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 22:35:52,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1930000752 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1930000752 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1930000752 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1930000752 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite8_Out-1930000752| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite8_Out-1930000752| ~y$r_buff1_thd2~0_In-1930000752)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1930000752, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1930000752, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1930000752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1930000752} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1930000752, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1930000752, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1930000752, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-1930000752|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1930000752} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:35:52,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L758-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y$r_buff1_thd2~0_82 |v_P1Thread1of1ForFork0_#t~ite8_38|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_38|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_82, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_37|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 22:35:52,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_253 256)) (= (mod v_~y$r_buff0_thd0~0_142 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_142, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 22:35:52,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In123398912 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In123398912 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out123398912| |ULTIMATE.start_main_#t~ite18_Out123398912|))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out123398912| ~y~0_In123398912) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite18_Out123398912| ~y$w_buff1~0_In123398912) (not .cse1) (not .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In123398912, ~y~0=~y~0_In123398912, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In123398912, ~y$w_buff1_used~0=~y$w_buff1_used~0_In123398912} OutVars{~y$w_buff1~0=~y$w_buff1~0_In123398912, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out123398912|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out123398912|, ~y~0=~y~0_In123398912, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In123398912, ~y$w_buff1_used~0=~y$w_buff1_used~0_In123398912} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 22:35:52,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1160618584 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1160618584 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out1160618584| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out1160618584| ~y$w_buff0_used~0_In1160618584) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1160618584, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1160618584} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1160618584, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1160618584, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1160618584|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 22:35:52,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In-397197175 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-397197175 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-397197175 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-397197175 256) 0))) (or (and (= ~y$w_buff1_used~0_In-397197175 |ULTIMATE.start_main_#t~ite21_Out-397197175|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite21_Out-397197175|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-397197175, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-397197175, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-397197175, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-397197175} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-397197175, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-397197175, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-397197175|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-397197175, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-397197175} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:35:52,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In212310350 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In212310350 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out212310350| ~y$r_buff0_thd0~0_In212310350)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out212310350|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In212310350, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In212310350} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In212310350, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In212310350, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out212310350|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:35:52,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-926786190 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-926786190 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-926786190 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-926786190 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-926786190 |ULTIMATE.start_main_#t~ite23_Out-926786190|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite23_Out-926786190|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-926786190, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-926786190, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-926786190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-926786190} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-926786190, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-926786190, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-926786190, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-926786190|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-926786190} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 22:35:52,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L834-->L834-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-170866210 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-170866210 256) 0))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-170866210 256))) (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-170866210 256))) (= 0 (mod ~y$w_buff0_used~0_In-170866210 256)))) (= |ULTIMATE.start_main_#t~ite29_Out-170866210| |ULTIMATE.start_main_#t~ite30_Out-170866210|) .cse1 (= |ULTIMATE.start_main_#t~ite29_Out-170866210| ~y$w_buff0~0_In-170866210)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite29_In-170866210| |ULTIMATE.start_main_#t~ite29_Out-170866210|) (= |ULTIMATE.start_main_#t~ite30_Out-170866210| ~y$w_buff0~0_In-170866210)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-170866210, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-170866210|, ~y$w_buff0~0=~y$w_buff0~0_In-170866210, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-170866210, ~weak$$choice2~0=~weak$$choice2~0_In-170866210, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-170866210, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-170866210} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-170866210|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-170866210, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-170866210|, ~y$w_buff0~0=~y$w_buff0~0_In-170866210, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-170866210, ~weak$$choice2~0=~weak$$choice2~0_In-170866210, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-170866210, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-170866210} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 22:35:52,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L836-->L836-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-698493832 256)))) (or (and .cse0 (= ~y$w_buff0_used~0_In-698493832 |ULTIMATE.start_main_#t~ite35_Out-698493832|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-698493832 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-698493832 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-698493832 256))) (= (mod ~y$w_buff0_used~0_In-698493832 256) 0))) (= |ULTIMATE.start_main_#t~ite36_Out-698493832| |ULTIMATE.start_main_#t~ite35_Out-698493832|)) (and (= |ULTIMATE.start_main_#t~ite35_In-698493832| |ULTIMATE.start_main_#t~ite35_Out-698493832|) (= |ULTIMATE.start_main_#t~ite36_Out-698493832| ~y$w_buff0_used~0_In-698493832) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-698493832, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-698493832, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-698493832|, ~weak$$choice2~0=~weak$$choice2~0_In-698493832, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-698493832, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-698493832} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-698493832, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-698493832, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-698493832|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-698493832|, ~weak$$choice2~0=~weak$$choice2~0_In-698493832, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-698493832, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-698493832} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-26 22:35:52,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-->L837-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2133768487 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In2133768487| |ULTIMATE.start_main_#t~ite38_Out2133768487|) (= ~y$w_buff1_used~0_In2133768487 |ULTIMATE.start_main_#t~ite39_Out2133768487|)) (and (= |ULTIMATE.start_main_#t~ite38_Out2133768487| |ULTIMATE.start_main_#t~ite39_Out2133768487|) (= ~y$w_buff1_used~0_In2133768487 |ULTIMATE.start_main_#t~ite38_Out2133768487|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In2133768487 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In2133768487 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2133768487 256))) (= 0 (mod ~y$w_buff0_used~0_In2133768487 256))))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2133768487, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2133768487, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In2133768487|, ~weak$$choice2~0=~weak$$choice2~0_In2133768487, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2133768487, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2133768487} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2133768487, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2133768487|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2133768487, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out2133768487|, ~weak$$choice2~0=~weak$$choice2~0_In2133768487, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2133768487, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2133768487} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 22:35:52,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_108 v_~y$r_buff0_thd0~0_107)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:35:52,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L839-->L839-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1053134610 256)))) (or (and .cse0 (= ~y$r_buff1_thd0~0_In-1053134610 |ULTIMATE.start_main_#t~ite44_Out-1053134610|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1053134610 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1053134610 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1053134610 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-1053134610 256) 0)))) (= |ULTIMATE.start_main_#t~ite45_Out-1053134610| |ULTIMATE.start_main_#t~ite44_Out-1053134610|)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1053134610| ~y$r_buff1_thd0~0_In-1053134610) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_In-1053134610| |ULTIMATE.start_main_#t~ite44_Out-1053134610|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1053134610, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1053134610, ~weak$$choice2~0=~weak$$choice2~0_In-1053134610, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1053134610, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1053134610, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-1053134610|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1053134610, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1053134610, ~weak$$choice2~0=~weak$$choice2~0_In-1053134610, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1053134610, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1053134610|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1053134610|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1053134610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 22:35:52,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L841-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_27) (= v_~y~0_103 v_~y$mem_tmp~0_13) (not (= 0 (mod v_~y$flush_delayed~0_28 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$flush_delayed~0=v_~y$flush_delayed~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~y~0=v_~y~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:35:52,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:35:52,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:35:52 BasicIcfg [2019-12-26 22:35:52,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:35:52,953 INFO L168 Benchmark]: Toolchain (without parser) took 21041.19 ms. Allocated memory was 135.8 MB in the beginning and 973.1 MB in the end (delta: 837.3 MB). Free memory was 98.2 MB in the beginning and 134.2 MB in the end (delta: -35.9 MB). Peak memory consumption was 801.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:52,954 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 22:35:52,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.09 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 97.8 MB in the beginning and 153.6 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:52,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.80 ms. Allocated memory is still 199.8 MB. Free memory was 153.6 MB in the beginning and 150.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:52,961 INFO L168 Benchmark]: Boogie Preprocessor took 41.46 ms. Allocated memory is still 199.8 MB. Free memory was 150.2 MB in the beginning and 148.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:52,962 INFO L168 Benchmark]: RCFGBuilder took 806.16 ms. Allocated memory is still 199.8 MB. Free memory was 148.1 MB in the beginning and 101.1 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:52,964 INFO L168 Benchmark]: TraceAbstraction took 19332.37 ms. Allocated memory was 199.8 MB in the beginning and 973.1 MB in the end (delta: 773.3 MB). Free memory was 100.5 MB in the beginning and 134.2 MB in the end (delta: -33.7 MB). Peak memory consumption was 739.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:52,970 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.58 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 783.09 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 97.8 MB in the beginning and 153.6 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.80 ms. Allocated memory is still 199.8 MB. Free memory was 153.6 MB in the beginning and 150.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.46 ms. Allocated memory is still 199.8 MB. Free memory was 150.2 MB in the beginning and 148.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.16 ms. Allocated memory is still 199.8 MB. Free memory was 148.1 MB in the beginning and 101.1 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19332.37 ms. Allocated memory was 199.8 MB in the beginning and 973.1 MB in the end (delta: 773.3 MB). Free memory was 100.5 MB in the beginning and 134.2 MB in the end (delta: -33.7 MB). Peak memory consumption was 739.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 28 ChoiceCompositions, 4263 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 192 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 50142 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1114, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1115, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1116, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1854 SDtfs, 1947 SDslu, 3784 SDs, 0 SdLazy, 1993 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 19 SyntacticMatches, 10 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22366occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 14761 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 507 ConstructedInterpolants, 0 QuantifiedInterpolants, 81077 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...