/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/mix041_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:35:02,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:35:02,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:35:02,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:35:02,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:35:02,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:35:02,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:35:02,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:35:02,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:35:02,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:35:02,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:35:02,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:35:02,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:35:02,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:35:02,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:35:02,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:35:02,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:35:02,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:35:02,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:35:02,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:35:02,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:35:02,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:35:02,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:35:02,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:35:02,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:35:02,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:35:02,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:35:02,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:35:02,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:35:02,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:35:02,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:35:02,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:35:02,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:35:02,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:35:02,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:35:02,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:35:02,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:35:02,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:35:02,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:35:02,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:35:02,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:35:02,665 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:02,679 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:35:02,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:35:02,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:35:02,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:35:02,681 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:35:02,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:35:02,681 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:35:02,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:35:02,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:35:02,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:35:02,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:35:02,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:35:02,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:35:02,682 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:35:02,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:35:02,683 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:35:02,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:35:02,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:35:02,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:35:02,683 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:35:02,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:35:02,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:35:02,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:35:02,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:35:02,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:35:02,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:35:02,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:35:02,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:35:02,685 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:35:02,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:35:02,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:35:03,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:35:03,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:35:03,009 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:35:03,010 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:35:03,011 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_tso.oepc.i [2019-12-26 22:35:03,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706cf74be/f8bff6bd0b7f4eff9555ee8632ce3e6c/FLAG95f829cbc [2019-12-26 22:35:03,575 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:35:03,576 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_tso.oepc.i [2019-12-26 22:35:03,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706cf74be/f8bff6bd0b7f4eff9555ee8632ce3e6c/FLAG95f829cbc [2019-12-26 22:35:03,925 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706cf74be/f8bff6bd0b7f4eff9555ee8632ce3e6c [2019-12-26 22:35:03,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:35:03,936 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:35:03,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:35:03,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:35:03,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:35:03,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:35:03" (1/1) ... [2019-12-26 22:35:03,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28985563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:03, skipping insertion in model container [2019-12-26 22:35:03,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:35:03" (1/1) ... [2019-12-26 22:35:03,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:35:04,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:35:04,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:35:04,626 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:35:04,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:35:04,782 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:35:04,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:04 WrapperNode [2019-12-26 22:35:04,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:35:04,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:35:04,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:35:04,784 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:35:04,794 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:04" (1/1) ... [2019-12-26 22:35:04,813 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:04" (1/1) ... [2019-12-26 22:35:04,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:35:04,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:35:04,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:35:04,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:35:04,863 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:04" (1/1) ... [2019-12-26 22:35:04,864 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:04" (1/1) ... [2019-12-26 22:35:04,868 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:04" (1/1) ... [2019-12-26 22:35:04,869 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:04" (1/1) ... [2019-12-26 22:35:04,880 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:04" (1/1) ... [2019-12-26 22:35:04,884 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:04" (1/1) ... [2019-12-26 22:35:04,888 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:04" (1/1) ... [2019-12-26 22:35:04,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:35:04,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:35:04,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:35:04,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:35:04,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:04" (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:04,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:35:04,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:35:04,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:35:04,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:35:04,981 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:35:04,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:35:04,982 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:35:04,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:35:04,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:35:04,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:35:04,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:35:04,984 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:05,732 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:35:05,732 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:35:05,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:35:05 BoogieIcfgContainer [2019-12-26 22:35:05,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:35:05,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:35:05,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:35:05,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:35:05,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:35:03" (1/3) ... [2019-12-26 22:35:05,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb0faae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:35:05, skipping insertion in model container [2019-12-26 22:35:05,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:35:04" (2/3) ... [2019-12-26 22:35:05,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb0faae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:35:05, skipping insertion in model container [2019-12-26 22:35:05,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:35:05" (3/3) ... [2019-12-26 22:35:05,747 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_tso.oepc.i [2019-12-26 22:35:05,757 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:35:05,758 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:35:05,766 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:35:05,767 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:35:05,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,800 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,801 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,809 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,809 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,827 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,828 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,828 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:35:05,847 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 22:35:05,868 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:35:05,868 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:35:05,868 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:35:05,868 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:35:05,869 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:35:05,869 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:35:05,884 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:35:05,885 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:35:05,908 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-26 22:35:05,909 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-26 22:35:06,006 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-26 22:35:06,006 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:35:06,022 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:35:06,038 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-26 22:35:06,129 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-26 22:35:06,130 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:35:06,137 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-26 22:35:06,152 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-26 22:35:06,153 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:35:10,443 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 22:35:10,592 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 22:35:10,636 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45620 [2019-12-26 22:35:10,636 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-26 22:35:10,640 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-12-26 22:35:11,092 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8218 states. [2019-12-26 22:35:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8218 states. [2019-12-26 22:35:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 22:35:11,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:11,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 22:35:11,104 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:11,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:11,111 INFO L82 PathProgramCache]: Analyzing trace with hash 699456563, now seen corresponding path program 1 times [2019-12-26 22:35:11,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:11,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739142457] [2019-12-26 22:35:11,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:11,432 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:11,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739142457] [2019-12-26 22:35:11,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:11,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:35:11,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549621893] [2019-12-26 22:35:11,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:35:11,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:11,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:35:11,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:11,458 INFO L87 Difference]: Start difference. First operand 8218 states. Second operand 3 states. [2019-12-26 22:35:11,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:11,671 INFO L93 Difference]: Finished difference Result 8170 states and 26597 transitions. [2019-12-26 22:35:11,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:35:11,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 22:35:11,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:11,759 INFO L225 Difference]: With dead ends: 8170 [2019-12-26 22:35:11,759 INFO L226 Difference]: Without dead ends: 8001 [2019-12-26 22:35:11,761 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:11,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2019-12-26 22:35:12,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 8001. [2019-12-26 22:35:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8001 states. [2019-12-26 22:35:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 26077 transitions. [2019-12-26 22:35:12,260 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 26077 transitions. Word has length 5 [2019-12-26 22:35:12,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:12,260 INFO L462 AbstractCegarLoop]: Abstraction has 8001 states and 26077 transitions. [2019-12-26 22:35:12,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:35:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 26077 transitions. [2019-12-26 22:35:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:35:12,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:12,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:12,263 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:12,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:12,264 INFO L82 PathProgramCache]: Analyzing trace with hash 336736415, now seen corresponding path program 1 times [2019-12-26 22:35:12,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:12,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551637735] [2019-12-26 22:35:12,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:12,331 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:12,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551637735] [2019-12-26 22:35:12,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:12,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:35:12,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730294275] [2019-12-26 22:35:12,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:35:12,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:12,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:35:12,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:35:12,336 INFO L87 Difference]: Start difference. First operand 8001 states and 26077 transitions. Second operand 4 states. [2019-12-26 22:35:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:12,703 INFO L93 Difference]: Finished difference Result 12769 states and 39815 transitions. [2019-12-26 22:35:12,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:35:12,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:35:12,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:12,792 INFO L225 Difference]: With dead ends: 12769 [2019-12-26 22:35:12,793 INFO L226 Difference]: Without dead ends: 12762 [2019-12-26 22:35:12,793 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:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2019-12-26 22:35:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 11253. [2019-12-26 22:35:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11253 states. [2019-12-26 22:35:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11253 states to 11253 states and 35607 transitions. [2019-12-26 22:35:13,829 INFO L78 Accepts]: Start accepts. Automaton has 11253 states and 35607 transitions. Word has length 11 [2019-12-26 22:35:13,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:13,829 INFO L462 AbstractCegarLoop]: Abstraction has 11253 states and 35607 transitions. [2019-12-26 22:35:13,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:35:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 11253 states and 35607 transitions. [2019-12-26 22:35:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:35:13,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:13,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:13,833 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:13,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:13,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1460182026, now seen corresponding path program 1 times [2019-12-26 22:35:13,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:13,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797522542] [2019-12-26 22:35:13,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:13,954 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:13,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797522542] [2019-12-26 22:35:13,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:13,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:35:13,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813393561] [2019-12-26 22:35:13,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:35:13,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:13,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:35:13,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:35:13,956 INFO L87 Difference]: Start difference. First operand 11253 states and 35607 transitions. Second operand 4 states. [2019-12-26 22:35:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:14,182 INFO L93 Difference]: Finished difference Result 14137 states and 44209 transitions. [2019-12-26 22:35:14,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:35:14,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:35:14,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:14,228 INFO L225 Difference]: With dead ends: 14137 [2019-12-26 22:35:14,229 INFO L226 Difference]: Without dead ends: 14137 [2019-12-26 22:35:14,229 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:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14137 states. [2019-12-26 22:35:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14137 to 12459. [2019-12-26 22:35:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12459 states. [2019-12-26 22:35:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12459 states to 12459 states and 39325 transitions. [2019-12-26 22:35:14,784 INFO L78 Accepts]: Start accepts. Automaton has 12459 states and 39325 transitions. Word has length 11 [2019-12-26 22:35:14,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:14,784 INFO L462 AbstractCegarLoop]: Abstraction has 12459 states and 39325 transitions. [2019-12-26 22:35:14,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:35:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 12459 states and 39325 transitions. [2019-12-26 22:35:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 22:35:14,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:14,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:35:14,792 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:14,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:14,792 INFO L82 PathProgramCache]: Analyzing trace with hash 289140598, now seen corresponding path program 1 times [2019-12-26 22:35:14,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:14,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56202263] [2019-12-26 22:35:14,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:14,889 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:14,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56202263] [2019-12-26 22:35:14,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:14,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:35:14,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515564102] [2019-12-26 22:35:14,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:35:14,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:14,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:35:14,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:14,891 INFO L87 Difference]: Start difference. First operand 12459 states and 39325 transitions. Second operand 5 states. [2019-12-26 22:35:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:15,358 INFO L93 Difference]: Finished difference Result 16999 states and 52476 transitions. [2019-12-26 22:35:15,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:35:15,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 22:35:15,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:15,399 INFO L225 Difference]: With dead ends: 16999 [2019-12-26 22:35:15,399 INFO L226 Difference]: Without dead ends: 16992 [2019-12-26 22:35:15,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:35:15,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16992 states. [2019-12-26 22:35:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16992 to 12516. [2019-12-26 22:35:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12516 states. [2019-12-26 22:35:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12516 states to 12516 states and 39375 transitions. [2019-12-26 22:35:15,964 INFO L78 Accepts]: Start accepts. Automaton has 12516 states and 39375 transitions. Word has length 17 [2019-12-26 22:35:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:15,965 INFO L462 AbstractCegarLoop]: Abstraction has 12516 states and 39375 transitions. [2019-12-26 22:35:15,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:35:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 12516 states and 39375 transitions. [2019-12-26 22:35:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:35:15,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:15,977 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] [2019-12-26 22:35:15,978 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:15,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:15,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1619137928, now seen corresponding path program 1 times [2019-12-26 22:35:15,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:15,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957147785] [2019-12-26 22:35:15,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:16,047 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:16,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957147785] [2019-12-26 22:35:16,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:16,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:35:16,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724333743] [2019-12-26 22:35:16,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:35:16,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:16,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:35:16,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:35:16,050 INFO L87 Difference]: Start difference. First operand 12516 states and 39375 transitions. Second operand 4 states. [2019-12-26 22:35:16,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:16,087 INFO L93 Difference]: Finished difference Result 2110 states and 4812 transitions. [2019-12-26 22:35:16,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:35:16,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:35:16,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:16,091 INFO L225 Difference]: With dead ends: 2110 [2019-12-26 22:35:16,091 INFO L226 Difference]: Without dead ends: 1824 [2019-12-26 22:35:16,092 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:16,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2019-12-26 22:35:16,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2019-12-26 22:35:16,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-12-26 22:35:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 4021 transitions. [2019-12-26 22:35:16,122 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 4021 transitions. Word has length 25 [2019-12-26 22:35:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:16,122 INFO L462 AbstractCegarLoop]: Abstraction has 1824 states and 4021 transitions. [2019-12-26 22:35:16,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:35:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 4021 transitions. [2019-12-26 22:35:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 22:35:16,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:16,127 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] [2019-12-26 22:35:16,127 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:16,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:16,127 INFO L82 PathProgramCache]: Analyzing trace with hash 736634855, now seen corresponding path program 1 times [2019-12-26 22:35:16,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:16,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935891046] [2019-12-26 22:35:16,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:16,216 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:16,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935891046] [2019-12-26 22:35:16,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:16,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:35:16,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237427361] [2019-12-26 22:35:16,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:35:16,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:16,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:35:16,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:16,218 INFO L87 Difference]: Start difference. First operand 1824 states and 4021 transitions. Second operand 5 states. [2019-12-26 22:35:16,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:16,258 INFO L93 Difference]: Finished difference Result 419 states and 767 transitions. [2019-12-26 22:35:16,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:35:16,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 22:35:16,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:16,261 INFO L225 Difference]: With dead ends: 419 [2019-12-26 22:35:16,261 INFO L226 Difference]: Without dead ends: 373 [2019-12-26 22:35:16,262 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:16,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-12-26 22:35:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 338. [2019-12-26 22:35:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-12-26 22:35:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 612 transitions. [2019-12-26 22:35:16,267 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 612 transitions. Word has length 37 [2019-12-26 22:35:16,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:16,268 INFO L462 AbstractCegarLoop]: Abstraction has 338 states and 612 transitions. [2019-12-26 22:35:16,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:35:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 612 transitions. [2019-12-26 22:35:16,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 22:35:16,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:16,270 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] [2019-12-26 22:35:16,270 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:16,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:16,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1915125863, now seen corresponding path program 1 times [2019-12-26 22:35:16,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:16,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633835259] [2019-12-26 22:35:16,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:16,341 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:16,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633835259] [2019-12-26 22:35:16,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:16,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:35:16,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733823573] [2019-12-26 22:35:16,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:35:16,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:16,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:35:16,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:16,343 INFO L87 Difference]: Start difference. First operand 338 states and 612 transitions. Second operand 3 states. [2019-12-26 22:35:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:16,392 INFO L93 Difference]: Finished difference Result 352 states and 630 transitions. [2019-12-26 22:35:16,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:35:16,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 22:35:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:16,394 INFO L225 Difference]: With dead ends: 352 [2019-12-26 22:35:16,394 INFO L226 Difference]: Without dead ends: 352 [2019-12-26 22:35:16,394 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:16,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-26 22:35:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 348. [2019-12-26 22:35:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-26 22:35:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 626 transitions. [2019-12-26 22:35:16,400 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 626 transitions. Word has length 52 [2019-12-26 22:35:16,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:16,401 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 626 transitions. [2019-12-26 22:35:16,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:35:16,401 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 626 transitions. [2019-12-26 22:35:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-26 22:35:16,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:16,402 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] [2019-12-26 22:35:16,403 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:16,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:16,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1804822393, now seen corresponding path program 1 times [2019-12-26 22:35:16,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:16,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613057350] [2019-12-26 22:35:16,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:16,506 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:16,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613057350] [2019-12-26 22:35:16,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:16,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:35:16,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480325940] [2019-12-26 22:35:16,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:35:16,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:16,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:35:16,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:16,508 INFO L87 Difference]: Start difference. First operand 348 states and 626 transitions. Second operand 3 states. [2019-12-26 22:35:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:16,522 INFO L93 Difference]: Finished difference Result 348 states and 613 transitions. [2019-12-26 22:35:16,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:35:16,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-26 22:35:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:16,524 INFO L225 Difference]: With dead ends: 348 [2019-12-26 22:35:16,524 INFO L226 Difference]: Without dead ends: 348 [2019-12-26 22:35:16,524 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:16,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-12-26 22:35:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2019-12-26 22:35:16,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-26 22:35:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 613 transitions. [2019-12-26 22:35:16,530 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 613 transitions. Word has length 52 [2019-12-26 22:35:16,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:16,530 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 613 transitions. [2019-12-26 22:35:16,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:35:16,530 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 613 transitions. [2019-12-26 22:35:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:35:16,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:16,531 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] [2019-12-26 22:35:16,532 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:16,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1986059885, now seen corresponding path program 1 times [2019-12-26 22:35:16,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:16,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499476265] [2019-12-26 22:35:16,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:16,644 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:16,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499476265] [2019-12-26 22:35:16,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:16,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:35:16,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490182756] [2019-12-26 22:35:16,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:35:16,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:16,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:35:16,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:16,648 INFO L87 Difference]: Start difference. First operand 348 states and 613 transitions. Second operand 5 states. [2019-12-26 22:35:16,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:16,833 INFO L93 Difference]: Finished difference Result 479 states and 847 transitions. [2019-12-26 22:35:16,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:35:16,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-26 22:35:16,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:16,835 INFO L225 Difference]: With dead ends: 479 [2019-12-26 22:35:16,835 INFO L226 Difference]: Without dead ends: 479 [2019-12-26 22:35:16,836 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:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-12-26 22:35:16,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 426. [2019-12-26 22:35:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-12-26 22:35:16,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 753 transitions. [2019-12-26 22:35:16,843 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 753 transitions. Word has length 53 [2019-12-26 22:35:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:16,843 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 753 transitions. [2019-12-26 22:35:16,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:35:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 753 transitions. [2019-12-26 22:35:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:35:16,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:16,845 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] [2019-12-26 22:35:16,845 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:16,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:16,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2130042739, now seen corresponding path program 2 times [2019-12-26 22:35:16,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:16,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321033920] [2019-12-26 22:35:16,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:16,934 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:16,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321033920] [2019-12-26 22:35:16,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:16,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:35:16,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991169479] [2019-12-26 22:35:16,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:35:16,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:16,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:35:16,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:35:16,937 INFO L87 Difference]: Start difference. First operand 426 states and 753 transitions. Second operand 5 states. [2019-12-26 22:35:17,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:17,070 INFO L93 Difference]: Finished difference Result 522 states and 921 transitions. [2019-12-26 22:35:17,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:35:17,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-26 22:35:17,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:17,072 INFO L225 Difference]: With dead ends: 522 [2019-12-26 22:35:17,072 INFO L226 Difference]: Without dead ends: 522 [2019-12-26 22:35:17,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:35:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-12-26 22:35:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 440. [2019-12-26 22:35:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-12-26 22:35:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 779 transitions. [2019-12-26 22:35:17,079 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 779 transitions. Word has length 53 [2019-12-26 22:35:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:17,080 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 779 transitions. [2019-12-26 22:35:17,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:35:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 779 transitions. [2019-12-26 22:35:17,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:35:17,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:17,082 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] [2019-12-26 22:35:17,082 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:17,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:17,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1191623101, now seen corresponding path program 3 times [2019-12-26 22:35:17,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:17,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514840675] [2019-12-26 22:35:17,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:17,303 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:17,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514840675] [2019-12-26 22:35:17,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:17,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:35:17,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321308808] [2019-12-26 22:35:17,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:35:17,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:17,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:35:17,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:35:17,306 INFO L87 Difference]: Start difference. First operand 440 states and 779 transitions. Second operand 9 states. [2019-12-26 22:35:17,654 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-12-26 22:35:17,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:17,922 INFO L93 Difference]: Finished difference Result 714 states and 1245 transitions. [2019-12-26 22:35:17,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 22:35:17,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-26 22:35:17,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:17,923 INFO L225 Difference]: With dead ends: 714 [2019-12-26 22:35:17,923 INFO L226 Difference]: Without dead ends: 714 [2019-12-26 22:35:17,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-26 22:35:17,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-12-26 22:35:17,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 436. [2019-12-26 22:35:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-26 22:35:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 768 transitions. [2019-12-26 22:35:17,930 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 768 transitions. Word has length 53 [2019-12-26 22:35:17,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:17,931 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 768 transitions. [2019-12-26 22:35:17,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:35:17,931 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 768 transitions. [2019-12-26 22:35:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 22:35:17,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:17,932 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] [2019-12-26 22:35:17,933 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:17,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:17,933 INFO L82 PathProgramCache]: Analyzing trace with hash -424695835, now seen corresponding path program 4 times [2019-12-26 22:35:17,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:17,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680823895] [2019-12-26 22:35:17,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:17,991 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:17,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680823895] [2019-12-26 22:35:17,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:17,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:35:17,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409443928] [2019-12-26 22:35:17,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:35:17,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:17,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:35:17,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:35:17,994 INFO L87 Difference]: Start difference. First operand 436 states and 768 transitions. Second operand 3 states. [2019-12-26 22:35:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:18,031 INFO L93 Difference]: Finished difference Result 435 states and 766 transitions. [2019-12-26 22:35:18,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:35:18,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-26 22:35:18,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:18,032 INFO L225 Difference]: With dead ends: 435 [2019-12-26 22:35:18,033 INFO L226 Difference]: Without dead ends: 435 [2019-12-26 22:35:18,033 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:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-12-26 22:35:18,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 347. [2019-12-26 22:35:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-12-26 22:35:18,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 602 transitions. [2019-12-26 22:35:18,039 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 602 transitions. Word has length 53 [2019-12-26 22:35:18,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:18,040 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 602 transitions. [2019-12-26 22:35:18,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:35:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 602 transitions. [2019-12-26 22:35:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 22:35:18,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:18,041 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] [2019-12-26 22:35:18,042 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:18,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:18,042 INFO L82 PathProgramCache]: Analyzing trace with hash -752439480, now seen corresponding path program 1 times [2019-12-26 22:35:18,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:18,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050660826] [2019-12-26 22:35:18,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:35:18,204 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:18,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050660826] [2019-12-26 22:35:18,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:35:18,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:35:18,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179242682] [2019-12-26 22:35:18,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:35:18,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:35:18,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:35:18,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:35:18,207 INFO L87 Difference]: Start difference. First operand 347 states and 602 transitions. Second operand 7 states. [2019-12-26 22:35:18,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:35:18,309 INFO L93 Difference]: Finished difference Result 550 states and 958 transitions. [2019-12-26 22:35:18,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 22:35:18,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-26 22:35:18,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:35:18,310 INFO L225 Difference]: With dead ends: 550 [2019-12-26 22:35:18,310 INFO L226 Difference]: Without dead ends: 220 [2019-12-26 22:35:18,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:35:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-12-26 22:35:18,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 196. [2019-12-26 22:35:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-12-26 22:35:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 337 transitions. [2019-12-26 22:35:18,314 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 337 transitions. Word has length 54 [2019-12-26 22:35:18,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:35:18,314 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 337 transitions. [2019-12-26 22:35:18,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:35:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 337 transitions. [2019-12-26 22:35:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 22:35:18,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:35:18,316 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] [2019-12-26 22:35:18,316 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:35:18,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:35:18,317 INFO L82 PathProgramCache]: Analyzing trace with hash 516281010, now seen corresponding path program 2 times [2019-12-26 22:35:18,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:35:18,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470797152] [2019-12-26 22:35:18,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:35:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:35:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:35:18,423 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:35:18,424 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:35:18,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$r_buff1_thd2~0_157) (= 0 v_~weak$$choice0~0_14) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1101~0.base_20| 4)) (= |v_#NULL.offset_6| 0) (= v_~x$mem_tmp~0_21 0) (= 0 v_~x$w_buff0~0_235) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~x$w_buff1~0_175) (= 0 v_~x$w_buff1_used~0_360) (= v_~weak$$choice2~0_113 0) (= 0 v_~x$read_delayed~0_5) (= 0 v_~x$r_buff0_thd2~0_211) (= v_~main$tmp_guard1~0_26 0) (= v_~x$r_buff0_thd0~0_331 0) (= v_~x$r_buff1_thd0~0_268 0) (= v_~__unbuffered_p1_EAX~0_126 0) (= 0 |v_ULTIMATE.start_main_~#t1101~0.offset_15|) (< 0 |v_#StackHeapBarrier_15|) (= v_~x$r_buff1_thd1~0_198 0) (= 0 v_~__unbuffered_cnt~0_64) (= (store .cse0 |v_ULTIMATE.start_main_~#t1101~0.base_20| 1) |v_#valid_44|) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p1_EBX~0_126) (= 0 v_~x$w_buff0_used~0_638) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1101~0.base_20|)) (= 0 v_~x~0_158) (= v_~x$flush_delayed~0_38 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1101~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1101~0.base_20|) |v_ULTIMATE.start_main_~#t1101~0.offset_15| 0)) |v_#memory_int_17|) (= v_~z~0_80 0) (= v_~y~0_115 0) (= v_~x$r_buff0_thd1~0_118 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1101~0.base_20|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_235, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ~x$flush_delayed~0=v_~x$flush_delayed~0_38, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t1101~0.offset=|v_ULTIMATE.start_main_~#t1101~0.offset_15|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_30|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_34|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_126, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_331, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_35|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ~x$w_buff1~0=v_~x$w_buff1~0_175, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_24|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_360, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_157, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_29|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_30|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~x~0=v_~x~0_158, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_118, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_26|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_45|, ~x$mem_tmp~0=v_~x$mem_tmp~0_21, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_36|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_26|, ULTIMATE.start_main_~#t1101~0.base=|v_ULTIMATE.start_main_~#t1101~0.base_20|, ~y~0=v_~y~0_115, ULTIMATE.start_main_~#t1102~0.base=|v_ULTIMATE.start_main_~#t1102~0.base_17|, ULTIMATE.start_main_~#t1102~0.offset=|v_ULTIMATE.start_main_~#t1102~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_126, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_34|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_24|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_268, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_638, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_17|, ~z~0=v_~z~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_113, ~x$read_delayed~0=v_~x$read_delayed~0_5} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_~#t1101~0.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1101~0.base, ~y~0, ULTIMATE.start_main_~#t1102~0.base, ULTIMATE.start_main_~#t1102~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 22:35:18,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L789-1-->L791: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1102~0.base_11|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1102~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1102~0.base_11|) |v_ULTIMATE.start_main_~#t1102~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1102~0.base_11| 4)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1102~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1102~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t1102~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1102~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1102~0.base=|v_ULTIMATE.start_main_~#t1102~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1102~0.offset=|v_ULTIMATE.start_main_~#t1102~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1102~0.base, ULTIMATE.start_main_~#t1102~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-26 22:35:18,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= 1 v_~x$w_buff0_used~0_78) (= (mod v_~x$w_buff1_used~0_47 256) 0) (= 2 v_~x$w_buff0~0_19) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= v_~x$w_buff1_used~0_47 v_~x$w_buff0_used~0_79) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_79} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 22:35:18,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out-1400295206| |P0Thread1of1ForFork0_#t~ite3_Out-1400295206|)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1400295206 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1400295206 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-1400295206 |P0Thread1of1ForFork0_#t~ite3_Out-1400295206|) .cse1 (not .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1400295206| ~x~0_In-1400295206) .cse1 (or .cse0 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1400295206, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1400295206, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1400295206, ~x~0=~x~0_In-1400295206} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1400295206|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1400295206|, ~x$w_buff1~0=~x$w_buff1~0_In-1400295206, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1400295206, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1400295206, ~x~0=~x~0_In-1400295206} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-26 22:35:18,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1304287357 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1304287357 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1304287357 |P0Thread1of1ForFork0_#t~ite5_Out-1304287357|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1304287357|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1304287357, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1304287357} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1304287357|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1304287357, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1304287357} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:35:18,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1397968098 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In-1397968098 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1397968098 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1397968098 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1397968098| ~x$w_buff1_used~0_In-1397968098)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1397968098| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1397968098, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1397968098, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1397968098, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1397968098} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1397968098|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1397968098, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1397968098, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1397968098, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1397968098} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:35:18,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1014636640 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1014636640 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out-1014636640| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-1014636640| ~x$r_buff0_thd1~0_In-1014636640)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1014636640, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1014636640} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1014636640, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1014636640|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1014636640} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 22:35:18,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-1727863234 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1727863234 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1727863234 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1727863234 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1727863234| ~x$r_buff1_thd1~0_In-1727863234)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1727863234| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1727863234, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1727863234, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1727863234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1727863234} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1727863234, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1727863234|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1727863234, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1727863234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1727863234} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:35:18,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_144 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_144} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-26 22:35:18,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-2013775857 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-2013775857 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-2013775857| ~x$w_buff0_used~0_In-2013775857)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-2013775857|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2013775857, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2013775857} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2013775857|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2013775857, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2013775857} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 22:35:18,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In-79639120 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-79639120 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-79639120 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-79639120 256) 0))) (or (and (= ~x$w_buff1_used~0_In-79639120 |P1Thread1of1ForFork1_#t~ite12_Out-79639120|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-79639120| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-79639120, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-79639120, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-79639120, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-79639120} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-79639120, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-79639120, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-79639120|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-79639120, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-79639120} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 22:35:18,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In6836497 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In6836497 256)))) (or (and (= ~x$r_buff0_thd2~0_Out6836497 ~x$r_buff0_thd2~0_In6836497) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out6836497 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In6836497, ~x$w_buff0_used~0=~x$w_buff0_used~0_In6836497} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out6836497|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out6836497, ~x$w_buff0_used~0=~x$w_buff0_used~0_In6836497} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 22:35:18,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-1954407945 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1954407945 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1954407945 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1954407945 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1954407945 |P1Thread1of1ForFork1_#t~ite14_Out-1954407945|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1954407945|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1954407945, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1954407945, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1954407945, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1954407945} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1954407945, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1954407945, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1954407945, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1954407945|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1954407945} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 22:35:18,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L770-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_134 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_134, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:35:18,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_128 256) 0) (= 0 (mod v_~x$w_buff0_used~0_232 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 22:35:18,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-2146685775 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-2146685775 256) 0))) (or (and (= ~x~0_In-2146685775 |ULTIMATE.start_main_#t~ite17_Out-2146685775|) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-2146685775 |ULTIMATE.start_main_#t~ite17_Out-2146685775|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2146685775, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2146685775, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2146685775, ~x~0=~x~0_In-2146685775} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-2146685775|, ~x$w_buff1~0=~x$w_buff1~0_In-2146685775, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2146685775, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2146685775, ~x~0=~x~0_In-2146685775} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-26 22:35:18,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_43 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~x~0=v_~x~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-26 22:35:18,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1974579667 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1974579667 256)))) (or (and (= ~x$w_buff0_used~0_In1974579667 |ULTIMATE.start_main_#t~ite19_Out1974579667|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite19_Out1974579667|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1974579667, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1974579667} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1974579667, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1974579667|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1974579667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 22:35:18,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1052336793 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1052336793 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1052336793 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1052336793 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite20_Out1052336793|)) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite20_Out1052336793| ~x$w_buff1_used~0_In1052336793) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1052336793, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1052336793, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1052336793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1052336793} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1052336793, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1052336793, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1052336793|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1052336793, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1052336793} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 22:35:18,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2103095124 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2103095124 256)))) (or (and (= ~x$r_buff0_thd0~0_In2103095124 |ULTIMATE.start_main_#t~ite21_Out2103095124|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out2103095124|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2103095124, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2103095124} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2103095124, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out2103095124|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2103095124} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:35:18,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-317870514 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-317870514 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-317870514 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-317870514 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out-317870514|)) (and (= ~x$r_buff1_thd0~0_In-317870514 |ULTIMATE.start_main_#t~ite22_Out-317870514|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-317870514, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-317870514, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-317870514, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-317870514} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-317870514, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-317870514, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-317870514, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-317870514|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-317870514} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:35:18,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1480638483 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite31_In1480638483| |ULTIMATE.start_main_#t~ite31_Out1480638483|) (= |ULTIMATE.start_main_#t~ite32_Out1480638483| ~x$w_buff1~0_In1480638483)) (and .cse0 (= |ULTIMATE.start_main_#t~ite31_Out1480638483| ~x$w_buff1~0_In1480638483) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1480638483 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1480638483 256)) (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1480638483 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In1480638483 256) 0)))) (= |ULTIMATE.start_main_#t~ite31_Out1480638483| |ULTIMATE.start_main_#t~ite32_Out1480638483|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1480638483, ~x$w_buff1~0=~x$w_buff1~0_In1480638483, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1480638483, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1480638483, ~weak$$choice2~0=~weak$$choice2~0_In1480638483, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In1480638483|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1480638483} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1480638483, ~x$w_buff1~0=~x$w_buff1~0_In1480638483, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1480638483, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1480638483|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1480638483, ~weak$$choice2~0=~weak$$choice2~0_In1480638483, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1480638483|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1480638483} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-26 22:35:18,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1468385649 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1468385649| ~x$w_buff1_used~0_In1468385649) (= |ULTIMATE.start_main_#t~ite37_In1468385649| |ULTIMATE.start_main_#t~ite37_Out1468385649|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1468385649 256) 0))) (or (= (mod ~x$w_buff0_used~0_In1468385649 256) 0) (and (= (mod ~x$r_buff1_thd0~0_In1468385649 256) 0) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In1468385649 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite37_Out1468385649| |ULTIMATE.start_main_#t~ite38_Out1468385649|) (= |ULTIMATE.start_main_#t~ite37_Out1468385649| ~x$w_buff1_used~0_In1468385649) .cse0))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1468385649, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1468385649, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In1468385649|, ~weak$$choice2~0=~weak$$choice2~0_In1468385649, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1468385649, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1468385649} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1468385649, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1468385649, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1468385649|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1468385649|, ~weak$$choice2~0=~weak$$choice2~0_In1468385649, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1468385649, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1468385649} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-26 22:35:18,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~x$r_buff0_thd0~0_85 v_~x$r_buff0_thd0~0_84)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 22:35:18,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L816-->L819-1: Formula: (and (= v_~x$mem_tmp~0_16 v_~x~0_122) (not (= 0 (mod v_~x$flush_delayed~0_31 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_30 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ~x~0=v_~x~0_122, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_27|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:35:18,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:35:18,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:35:18 BasicIcfg [2019-12-26 22:35:18,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:35:18,511 INFO L168 Benchmark]: Toolchain (without parser) took 14575.49 ms. Allocated memory was 145.8 MB in the beginning and 607.6 MB in the end (delta: 461.9 MB). Free memory was 101.8 MB in the beginning and 267.7 MB in the end (delta: -165.9 MB). Peak memory consumption was 296.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:18,512 INFO L168 Benchmark]: CDTParser took 1.60 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 22:35:18,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 846.09 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 155.8 MB in the end (delta: -54.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:18,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.09 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:18,514 INFO L168 Benchmark]: Boogie Preprocessor took 39.91 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 150.4 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:18,515 INFO L168 Benchmark]: RCFGBuilder took 841.19 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 105.3 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:18,515 INFO L168 Benchmark]: TraceAbstraction took 12773.76 ms. Allocated memory was 202.9 MB in the beginning and 607.6 MB in the end (delta: 404.8 MB). Free memory was 104.7 MB in the beginning and 267.7 MB in the end (delta: -163.1 MB). Peak memory consumption was 241.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:35:18,519 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.60 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 846.09 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 155.8 MB in the end (delta: -54.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.09 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.91 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 150.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.19 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 105.3 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12773.76 ms. Allocated memory was 202.9 MB in the beginning and 607.6 MB in the end (delta: 404.8 MB). Free memory was 104.7 MB in the beginning and 267.7 MB in the end (delta: -163.1 MB). Peak memory consumption was 241.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 88 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 3874 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 57 SemBasedMoverChecksPositive, 186 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 45620 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1101, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1102, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1346 SDtfs, 1143 SDslu, 2254 SDs, 0 SdLazy, 1234 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12516occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 8227 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 530 NumberOfCodeBlocks, 530 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 61303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...