/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/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:29:02,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:29:02,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:29:02,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:29:02,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:29:02,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:29:02,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:29:02,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:29:02,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:29:02,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:29:02,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:29:02,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:29:02,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:29:02,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:29:02,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:29:02,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:29:02,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:29:02,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:29:02,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:29:02,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:29:02,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:29:02,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:29:02,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:29:02,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:29:02,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:29:02,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:29:02,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:29:02,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:29:02,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:29:02,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:29:02,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:29:02,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:29:02,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:29:02,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:29:02,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:29:02,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:29:02,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:29:02,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:29:02,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:29:02,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:29:02,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:29:02,619 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:29:02,646 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:29:02,646 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:29:02,650 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:29:02,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:29:02,651 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:29:02,651 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:29:02,651 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:29:02,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:29:02,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:29:02,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:29:02,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:29:02,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:29:02,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:29:02,654 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:29:02,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:29:02,654 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:29:02,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:29:02,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:29:02,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:29:02,655 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:29:02,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:29:02,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:29:02,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:29:02,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:29:02,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:29:02,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:29:02,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:29:02,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:29:02,658 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:29:02,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:29:02,948 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:29:02,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:29:02,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:29:02,968 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:29:02,968 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:29:02,969 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2019-12-26 22:29:03,035 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236403e82/339e98b2c473438c93c23643e6678b5b/FLAGd30a504d2 [2019-12-26 22:29:03,589 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:29:03,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2019-12-26 22:29:03,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236403e82/339e98b2c473438c93c23643e6678b5b/FLAGd30a504d2 [2019-12-26 22:29:03,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236403e82/339e98b2c473438c93c23643e6678b5b [2019-12-26 22:29:03,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:29:03,880 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:29:03,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:29:03,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:29:03,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:29:03,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:29:03" (1/1) ... [2019-12-26 22:29:03,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79dc7cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:29:03, skipping insertion in model container [2019-12-26 22:29:03,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:29:03" (1/1) ... [2019-12-26 22:29:03,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:29:03,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:29:04,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:29:04,552 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:29:04,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:29:04,711 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:29:04,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:29:04 WrapperNode [2019-12-26 22:29:04,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:29:04,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:29:04,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:29:04,713 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:29:04,722 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:29:04" (1/1) ... [2019-12-26 22:29:04,743 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:29:04" (1/1) ... [2019-12-26 22:29:04,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:29:04,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:29:04,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:29:04,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:29:04,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:29:04" (1/1) ... [2019-12-26 22:29:04,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:29:04" (1/1) ... [2019-12-26 22:29:04,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:29:04" (1/1) ... [2019-12-26 22:29:04,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:29:04" (1/1) ... [2019-12-26 22:29:04,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:29:04" (1/1) ... [2019-12-26 22:29:04,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:29:04" (1/1) ... [2019-12-26 22:29:04,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:29:04" (1/1) ... [2019-12-26 22:29:04,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:29:04,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:29:04,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:29:04,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:29:04,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:29: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:29:04,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:29:04,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:29:04,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:29:04,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:29:04,898 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:29:04,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:29:04,899 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:29:04,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:29:04,899 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:29:04,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:29:04,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:29:04,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:29:04,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:29:04,902 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:29:05,861 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:29:05,862 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:29:05,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:29:05 BoogieIcfgContainer [2019-12-26 22:29:05,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:29:05,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:29:05,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:29:05,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:29:05,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:29:03" (1/3) ... [2019-12-26 22:29:05,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf9c0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:29:05, skipping insertion in model container [2019-12-26 22:29:05,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:29:04" (2/3) ... [2019-12-26 22:29:05,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf9c0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:29:05, skipping insertion in model container [2019-12-26 22:29:05,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:29:05" (3/3) ... [2019-12-26 22:29:05,871 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2019-12-26 22:29:05,879 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:29:05,880 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:29:05,889 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:29:05,890 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:29:05,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,928 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,929 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,938 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,938 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,938 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,946 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,947 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,976 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,977 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,991 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,991 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,991 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:05,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:06,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:06,001 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:06,001 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:06,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:06,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:06,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:06,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:06,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:06,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:06,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:29:06,016 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:29:06,035 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:29:06,036 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:29:06,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:29:06,037 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:29:06,037 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:29:06,037 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:29:06,037 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:29:06,038 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:29:06,062 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-26 22:29:06,064 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-26 22:29:06,178 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-26 22:29:06,179 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:29:06,195 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:29:06,218 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-26 22:29:06,271 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-26 22:29:06,271 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:29:06,280 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 336 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:29:06,301 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-26 22:29:06,302 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:29:11,390 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-26 22:29:11,511 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 22:29:11,546 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83692 [2019-12-26 22:29:11,546 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 22:29:11,550 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 109 transitions [2019-12-26 22:29:34,301 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129810 states. [2019-12-26 22:29:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 129810 states. [2019-12-26 22:29:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 22:29:34,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:34,312 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 22:29:34,313 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:29:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:34,320 INFO L82 PathProgramCache]: Analyzing trace with hash 817279571, now seen corresponding path program 1 times [2019-12-26 22:29:34,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:34,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413825990] [2019-12-26 22:29:34,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:34,545 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:29:34,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413825990] [2019-12-26 22:29:34,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:34,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:29:34,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143265459] [2019-12-26 22:29:34,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:29:34,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:34,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:29:34,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:29:34,570 INFO L87 Difference]: Start difference. First operand 129810 states. Second operand 3 states. [2019-12-26 22:29:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:29:38,060 INFO L93 Difference]: Finished difference Result 129322 states and 554746 transitions. [2019-12-26 22:29:38,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:29:38,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 22:29:38,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:29:38,842 INFO L225 Difference]: With dead ends: 129322 [2019-12-26 22:29:38,842 INFO L226 Difference]: Without dead ends: 126774 [2019-12-26 22:29:38,845 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:29:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126774 states. [2019-12-26 22:29:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126774 to 126774. [2019-12-26 22:29:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126774 states. [2019-12-26 22:29:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126774 states to 126774 states and 544358 transitions. [2019-12-26 22:29:54,335 INFO L78 Accepts]: Start accepts. Automaton has 126774 states and 544358 transitions. Word has length 5 [2019-12-26 22:29:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:29:54,336 INFO L462 AbstractCegarLoop]: Abstraction has 126774 states and 544358 transitions. [2019-12-26 22:29:54,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:29:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 126774 states and 544358 transitions. [2019-12-26 22:29:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:29:54,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:29:54,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:29:54,340 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:29:54,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:29:54,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1829592591, now seen corresponding path program 1 times [2019-12-26 22:29:54,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:29:54,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247914384] [2019-12-26 22:29:54,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:29:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:29:54,531 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:29:54,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247914384] [2019-12-26 22:29:54,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:29:54,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:29:54,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791982796] [2019-12-26 22:29:54,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:29:54,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:29:54,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:29:54,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:29:54,534 INFO L87 Difference]: Start difference. First operand 126774 states and 544358 transitions. Second operand 4 states. [2019-12-26 22:30:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:01,099 INFO L93 Difference]: Finished difference Result 198214 states and 818020 transitions. [2019-12-26 22:30:01,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:30:01,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:30:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:01,874 INFO L225 Difference]: With dead ends: 198214 [2019-12-26 22:30:01,875 INFO L226 Difference]: Without dead ends: 198165 [2019-12-26 22:30:01,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:30:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198165 states. [2019-12-26 22:30:13,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198165 to 183268. [2019-12-26 22:30:13,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183268 states. [2019-12-26 22:30:14,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183268 states to 183268 states and 763968 transitions. [2019-12-26 22:30:14,101 INFO L78 Accepts]: Start accepts. Automaton has 183268 states and 763968 transitions. Word has length 11 [2019-12-26 22:30:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:14,101 INFO L462 AbstractCegarLoop]: Abstraction has 183268 states and 763968 transitions. [2019-12-26 22:30:14,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:30:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 183268 states and 763968 transitions. [2019-12-26 22:30:14,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:30:14,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:14,108 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:30:14,108 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:30:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:14,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1837025859, now seen corresponding path program 1 times [2019-12-26 22:30:14,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:14,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008568212] [2019-12-26 22:30:14,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:14,209 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:30:14,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008568212] [2019-12-26 22:30:14,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:14,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:30:14,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296781675] [2019-12-26 22:30:14,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:30:14,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:14,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:30:14,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:30:14,213 INFO L87 Difference]: Start difference. First operand 183268 states and 763968 transitions. Second operand 4 states. [2019-12-26 22:30:22,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:22,102 INFO L93 Difference]: Finished difference Result 261626 states and 1065461 transitions. [2019-12-26 22:30:22,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:30:22,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:30:22,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:23,049 INFO L225 Difference]: With dead ends: 261626 [2019-12-26 22:30:23,050 INFO L226 Difference]: Without dead ends: 261563 [2019-12-26 22:30:23,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:30:31,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261563 states. [2019-12-26 22:30:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261563 to 223048. [2019-12-26 22:30:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223048 states. [2019-12-26 22:30:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223048 states to 223048 states and 922460 transitions. [2019-12-26 22:30:45,780 INFO L78 Accepts]: Start accepts. Automaton has 223048 states and 922460 transitions. Word has length 13 [2019-12-26 22:30:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:30:45,781 INFO L462 AbstractCegarLoop]: Abstraction has 223048 states and 922460 transitions. [2019-12-26 22:30:45,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:30:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 223048 states and 922460 transitions. [2019-12-26 22:30:45,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:30:45,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:30:45,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:30:45,787 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:30:45,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:30:45,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2085785430, now seen corresponding path program 1 times [2019-12-26 22:30:45,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:30:45,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348540301] [2019-12-26 22:30:45,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:30:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:30:45,878 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:30:45,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348540301] [2019-12-26 22:30:45,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:30:45,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:30:45,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435996167] [2019-12-26 22:30:45,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:30:45,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:30:45,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:30:45,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:30:45,881 INFO L87 Difference]: Start difference. First operand 223048 states and 922460 transitions. Second operand 4 states. [2019-12-26 22:30:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:30:49,239 INFO L93 Difference]: Finished difference Result 274912 states and 1127900 transitions. [2019-12-26 22:30:49,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:30:49,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:30:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:30:58,955 INFO L225 Difference]: With dead ends: 274912 [2019-12-26 22:30:58,955 INFO L226 Difference]: Without dead ends: 274912 [2019-12-26 22:30:58,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:31:06,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274912 states. [2019-12-26 22:31:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274912 to 235207. [2019-12-26 22:31:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235207 states. [2019-12-26 22:31:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235207 states to 235207 states and 973199 transitions. [2019-12-26 22:31:11,617 INFO L78 Accepts]: Start accepts. Automaton has 235207 states and 973199 transitions. Word has length 13 [2019-12-26 22:31:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:11,618 INFO L462 AbstractCegarLoop]: Abstraction has 235207 states and 973199 transitions. [2019-12-26 22:31:11,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:31:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 235207 states and 973199 transitions. [2019-12-26 22:31:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 22:31:11,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:11,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:31:11,642 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:11,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:11,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1321310855, now seen corresponding path program 1 times [2019-12-26 22:31:11,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:11,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987387752] [2019-12-26 22:31:11,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:11,779 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:31:11,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987387752] [2019-12-26 22:31:11,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:11,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:31:11,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850917506] [2019-12-26 22:31:11,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:31:11,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:11,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:31:11,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:31:11,781 INFO L87 Difference]: Start difference. First operand 235207 states and 973199 transitions. Second operand 5 states. [2019-12-26 22:31:20,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:20,534 INFO L93 Difference]: Finished difference Result 336537 states and 1363420 transitions. [2019-12-26 22:31:20,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:31:20,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 22:31:20,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:21,579 INFO L225 Difference]: With dead ends: 336537 [2019-12-26 22:31:21,579 INFO L226 Difference]: Without dead ends: 336390 [2019-12-26 22:31:21,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:31:36,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336390 states. [2019-12-26 22:31:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336390 to 258307. [2019-12-26 22:31:41,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258307 states. [2019-12-26 22:31:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258307 states to 258307 states and 1064051 transitions. [2019-12-26 22:31:43,290 INFO L78 Accepts]: Start accepts. Automaton has 258307 states and 1064051 transitions. Word has length 19 [2019-12-26 22:31:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:43,291 INFO L462 AbstractCegarLoop]: Abstraction has 258307 states and 1064051 transitions. [2019-12-26 22:31:43,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:31:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 258307 states and 1064051 transitions. [2019-12-26 22:31:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 22:31:43,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:43,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:31:43,311 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:43,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:43,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1693466862, now seen corresponding path program 1 times [2019-12-26 22:31:43,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:43,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085457868] [2019-12-26 22:31:43,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:43,384 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:31:43,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085457868] [2019-12-26 22:31:43,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:43,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:31:43,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330077778] [2019-12-26 22:31:43,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:31:43,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:43,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:31:43,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:31:43,386 INFO L87 Difference]: Start difference. First operand 258307 states and 1064051 transitions. Second operand 4 states. [2019-12-26 22:31:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:43,592 INFO L93 Difference]: Finished difference Result 48752 states and 160123 transitions. [2019-12-26 22:31:43,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:31:43,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 22:31:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:43,668 INFO L225 Difference]: With dead ends: 48752 [2019-12-26 22:31:43,668 INFO L226 Difference]: Without dead ends: 43565 [2019-12-26 22:31:43,668 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:31:43,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43565 states. [2019-12-26 22:31:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43565 to 43565. [2019-12-26 22:31:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43565 states. [2019-12-26 22:31:51,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43565 states to 43565 states and 141059 transitions. [2019-12-26 22:31:51,322 INFO L78 Accepts]: Start accepts. Automaton has 43565 states and 141059 transitions. Word has length 19 [2019-12-26 22:31:51,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:51,322 INFO L462 AbstractCegarLoop]: Abstraction has 43565 states and 141059 transitions. [2019-12-26 22:31:51,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:31:51,323 INFO L276 IsEmpty]: Start isEmpty. Operand 43565 states and 141059 transitions. [2019-12-26 22:31:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:31:51,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:51,332 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:31:51,332 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:51,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:51,332 INFO L82 PathProgramCache]: Analyzing trace with hash 19935376, now seen corresponding path program 1 times [2019-12-26 22:31:51,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:51,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281309576] [2019-12-26 22:31:51,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:31:51,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281309576] [2019-12-26 22:31:51,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:51,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:31:51,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551443160] [2019-12-26 22:31:51,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:31:51,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:51,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:31:51,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:31:51,477 INFO L87 Difference]: Start difference. First operand 43565 states and 141059 transitions. Second operand 6 states. [2019-12-26 22:31:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:52,309 INFO L93 Difference]: Finished difference Result 59952 states and 190384 transitions. [2019-12-26 22:31:52,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:31:52,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-26 22:31:52,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:52,413 INFO L225 Difference]: With dead ends: 59952 [2019-12-26 22:31:52,413 INFO L226 Difference]: Without dead ends: 59952 [2019-12-26 22:31:52,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:31:52,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59952 states. [2019-12-26 22:31:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59952 to 47880. [2019-12-26 22:31:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47880 states. [2019-12-26 22:31:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47880 states to 47880 states and 154130 transitions. [2019-12-26 22:31:53,742 INFO L78 Accepts]: Start accepts. Automaton has 47880 states and 154130 transitions. Word has length 25 [2019-12-26 22:31:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:53,743 INFO L462 AbstractCegarLoop]: Abstraction has 47880 states and 154130 transitions. [2019-12-26 22:31:53,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:31:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 47880 states and 154130 transitions. [2019-12-26 22:31:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:31:53,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:53,752 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:31:53,752 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:53,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1298639300, now seen corresponding path program 1 times [2019-12-26 22:31:53,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:53,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142834403] [2019-12-26 22:31:53,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:53,845 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:31:53,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142834403] [2019-12-26 22:31:53,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:53,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:31:53,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440284142] [2019-12-26 22:31:53,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:31:53,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:31:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:31:53,848 INFO L87 Difference]: Start difference. First operand 47880 states and 154130 transitions. Second operand 5 states. [2019-12-26 22:31:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:54,423 INFO L93 Difference]: Finished difference Result 63187 states and 200246 transitions. [2019-12-26 22:31:54,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:31:54,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-26 22:31:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:54,521 INFO L225 Difference]: With dead ends: 63187 [2019-12-26 22:31:54,521 INFO L226 Difference]: Without dead ends: 63187 [2019-12-26 22:31:54,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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:31:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63187 states. [2019-12-26 22:31:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63187 to 50424. [2019-12-26 22:31:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50424 states. [2019-12-26 22:31:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50424 states to 50424 states and 162097 transitions. [2019-12-26 22:31:56,102 INFO L78 Accepts]: Start accepts. Automaton has 50424 states and 162097 transitions. Word has length 25 [2019-12-26 22:31:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:56,103 INFO L462 AbstractCegarLoop]: Abstraction has 50424 states and 162097 transitions. [2019-12-26 22:31:56,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:31:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 50424 states and 162097 transitions. [2019-12-26 22:31:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 22:31:56,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:56,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:31:56,121 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:56,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:56,121 INFO L82 PathProgramCache]: Analyzing trace with hash -511165584, now seen corresponding path program 1 times [2019-12-26 22:31:56,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:56,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921449180] [2019-12-26 22:31:56,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:56,243 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:31:56,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921449180] [2019-12-26 22:31:56,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:56,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:31:56,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268664628] [2019-12-26 22:31:56,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:31:56,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:56,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:31:56,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:31:56,246 INFO L87 Difference]: Start difference. First operand 50424 states and 162097 transitions. Second operand 5 states. [2019-12-26 22:31:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:56,320 INFO L93 Difference]: Finished difference Result 11145 states and 30336 transitions. [2019-12-26 22:31:56,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:31:56,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-26 22:31:56,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:56,336 INFO L225 Difference]: With dead ends: 11145 [2019-12-26 22:31:56,336 INFO L226 Difference]: Without dead ends: 9742 [2019-12-26 22:31:56,337 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:31:56,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9742 states. [2019-12-26 22:31:56,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9742 to 9532. [2019-12-26 22:31:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9532 states. [2019-12-26 22:31:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9532 states to 9532 states and 25671 transitions. [2019-12-26 22:31:56,533 INFO L78 Accepts]: Start accepts. Automaton has 9532 states and 25671 transitions. Word has length 31 [2019-12-26 22:31:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:56,534 INFO L462 AbstractCegarLoop]: Abstraction has 9532 states and 25671 transitions. [2019-12-26 22:31:56,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:31:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 9532 states and 25671 transitions. [2019-12-26 22:31:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 22:31:56,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:56,547 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:31:56,548 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:56,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:56,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1153167478, now seen corresponding path program 1 times [2019-12-26 22:31:56,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:56,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606531579] [2019-12-26 22:31:56,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:56,732 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:31:56,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606531579] [2019-12-26 22:31:56,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:56,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:31:56,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877607369] [2019-12-26 22:31:56,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:31:56,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:56,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:31:56,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:31:56,734 INFO L87 Difference]: Start difference. First operand 9532 states and 25671 transitions. Second operand 6 states. [2019-12-26 22:31:57,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:57,484 INFO L93 Difference]: Finished difference Result 10575 states and 28004 transitions. [2019-12-26 22:31:57,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:31:57,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-26 22:31:57,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:57,500 INFO L225 Difference]: With dead ends: 10575 [2019-12-26 22:31:57,500 INFO L226 Difference]: Without dead ends: 10575 [2019-12-26 22:31:57,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:31:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10575 states. [2019-12-26 22:31:57,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10575 to 8454. [2019-12-26 22:31:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8454 states. [2019-12-26 22:31:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8454 states to 8454 states and 22779 transitions. [2019-12-26 22:31:57,689 INFO L78 Accepts]: Start accepts. Automaton has 8454 states and 22779 transitions. Word has length 37 [2019-12-26 22:31:57,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:57,690 INFO L462 AbstractCegarLoop]: Abstraction has 8454 states and 22779 transitions. [2019-12-26 22:31:57,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:31:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 8454 states and 22779 transitions. [2019-12-26 22:31:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:31:57,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:57,700 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] [2019-12-26 22:31:57,700 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:57,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:57,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1087049671, now seen corresponding path program 1 times [2019-12-26 22:31:57,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:57,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059974942] [2019-12-26 22:31:57,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:57,747 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:31:57,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059974942] [2019-12-26 22:31:57,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:57,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:31:57,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890267866] [2019-12-26 22:31:57,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:31:57,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:57,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:31:57,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:31:57,749 INFO L87 Difference]: Start difference. First operand 8454 states and 22779 transitions. Second operand 3 states. [2019-12-26 22:31:57,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:57,822 INFO L93 Difference]: Finished difference Result 8995 states and 23875 transitions. [2019-12-26 22:31:57,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:31:57,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-26 22:31:57,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:57,833 INFO L225 Difference]: With dead ends: 8995 [2019-12-26 22:31:57,833 INFO L226 Difference]: Without dead ends: 8995 [2019-12-26 22:31:57,833 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:31:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8995 states. [2019-12-26 22:31:57,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8995 to 8557. [2019-12-26 22:31:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8557 states. [2019-12-26 22:31:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8557 states to 8557 states and 22999 transitions. [2019-12-26 22:31:57,939 INFO L78 Accepts]: Start accepts. Automaton has 8557 states and 22999 transitions. Word has length 51 [2019-12-26 22:31:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:57,939 INFO L462 AbstractCegarLoop]: Abstraction has 8557 states and 22999 transitions. [2019-12-26 22:31:57,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:31:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 8557 states and 22999 transitions. [2019-12-26 22:31:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-26 22:31:57,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:57,949 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] [2019-12-26 22:31:57,950 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:57,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash 890965309, now seen corresponding path program 1 times [2019-12-26 22:31:57,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:57,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683797734] [2019-12-26 22:31:57,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:58,039 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:31:58,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683797734] [2019-12-26 22:31:58,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:58,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:31:58,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888707887] [2019-12-26 22:31:58,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:31:58,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:58,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:31:58,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:31:58,041 INFO L87 Difference]: Start difference. First operand 8557 states and 22999 transitions. Second operand 6 states. [2019-12-26 22:31:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:58,117 INFO L93 Difference]: Finished difference Result 5821 states and 16636 transitions. [2019-12-26 22:31:58,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:31:58,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-26 22:31:58,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:58,128 INFO L225 Difference]: With dead ends: 5821 [2019-12-26 22:31:58,129 INFO L226 Difference]: Without dead ends: 5738 [2019-12-26 22:31:58,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:31:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2019-12-26 22:31:58,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 5325. [2019-12-26 22:31:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5325 states. [2019-12-26 22:31:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5325 states to 5325 states and 15354 transitions. [2019-12-26 22:31:58,212 INFO L78 Accepts]: Start accepts. Automaton has 5325 states and 15354 transitions. Word has length 51 [2019-12-26 22:31:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:58,213 INFO L462 AbstractCegarLoop]: Abstraction has 5325 states and 15354 transitions. [2019-12-26 22:31:58,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:31:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 5325 states and 15354 transitions. [2019-12-26 22:31:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:31:58,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:58,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:31:58,221 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:58,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:58,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1332314804, now seen corresponding path program 1 times [2019-12-26 22:31:58,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:58,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855363914] [2019-12-26 22:31:58,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:58,343 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:31:58,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855363914] [2019-12-26 22:31:58,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:58,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:31:58,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369398301] [2019-12-26 22:31:58,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:31:58,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:58,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:31:58,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:31:58,346 INFO L87 Difference]: Start difference. First operand 5325 states and 15354 transitions. Second operand 3 states. [2019-12-26 22:31:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:31:58,376 INFO L93 Difference]: Finished difference Result 5039 states and 14321 transitions. [2019-12-26 22:31:58,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:31:58,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:31:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:31:58,384 INFO L225 Difference]: With dead ends: 5039 [2019-12-26 22:31:58,384 INFO L226 Difference]: Without dead ends: 5039 [2019-12-26 22:31:58,387 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:31:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5039 states. [2019-12-26 22:31:58,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5039 to 5039. [2019-12-26 22:31:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5039 states. [2019-12-26 22:31:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5039 states to 5039 states and 14321 transitions. [2019-12-26 22:31:58,495 INFO L78 Accepts]: Start accepts. Automaton has 5039 states and 14321 transitions. Word has length 65 [2019-12-26 22:31:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:31:58,496 INFO L462 AbstractCegarLoop]: Abstraction has 5039 states and 14321 transitions. [2019-12-26 22:31:58,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:31:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 5039 states and 14321 transitions. [2019-12-26 22:31:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:31:58,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:31:58,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:31:58,506 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:31:58,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:31:58,506 INFO L82 PathProgramCache]: Analyzing trace with hash 657704751, now seen corresponding path program 1 times [2019-12-26 22:31:58,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:31:58,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319696097] [2019-12-26 22:31:58,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:31:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:31:58,724 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:31:58,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319696097] [2019-12-26 22:31:58,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:31:58,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:31:58,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074407856] [2019-12-26 22:31:58,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:31:58,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:31:58,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:31:58,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:31:58,727 INFO L87 Difference]: Start difference. First operand 5039 states and 14321 transitions. Second operand 10 states. [2019-12-26 22:32:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:32:00,376 INFO L93 Difference]: Finished difference Result 7921 states and 22068 transitions. [2019-12-26 22:32:00,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-26 22:32:00,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 22:32:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:32:00,387 INFO L225 Difference]: With dead ends: 7921 [2019-12-26 22:32:00,389 INFO L226 Difference]: Without dead ends: 7921 [2019-12-26 22:32:00,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2019-12-26 22:32:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7921 states. [2019-12-26 22:32:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7921 to 6922. [2019-12-26 22:32:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6922 states. [2019-12-26 22:32:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6922 states to 6922 states and 19323 transitions. [2019-12-26 22:32:00,493 INFO L78 Accepts]: Start accepts. Automaton has 6922 states and 19323 transitions. Word has length 66 [2019-12-26 22:32:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:32:00,494 INFO L462 AbstractCegarLoop]: Abstraction has 6922 states and 19323 transitions. [2019-12-26 22:32:00,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:32:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 6922 states and 19323 transitions. [2019-12-26 22:32:00,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:32:00,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:32:00,501 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:32:00,501 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:32:00,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:32:00,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1650454547, now seen corresponding path program 2 times [2019-12-26 22:32:00,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:32:00,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552144101] [2019-12-26 22:32:00,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:32:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:32:00,626 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:32:00,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552144101] [2019-12-26 22:32:00,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:32:00,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:32:00,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598242636] [2019-12-26 22:32:00,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:32:00,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:32:00,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:32:00,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:32:00,628 INFO L87 Difference]: Start difference. First operand 6922 states and 19323 transitions. Second operand 7 states. [2019-12-26 22:32:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:32:01,367 INFO L93 Difference]: Finished difference Result 9667 states and 26896 transitions. [2019-12-26 22:32:01,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:32:01,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-26 22:32:01,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:32:01,385 INFO L225 Difference]: With dead ends: 9667 [2019-12-26 22:32:01,385 INFO L226 Difference]: Without dead ends: 9667 [2019-12-26 22:32:01,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:32:01,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9667 states. [2019-12-26 22:32:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9667 to 7838. [2019-12-26 22:32:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7838 states. [2019-12-26 22:32:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7838 states to 7838 states and 21960 transitions. [2019-12-26 22:32:01,617 INFO L78 Accepts]: Start accepts. Automaton has 7838 states and 21960 transitions. Word has length 66 [2019-12-26 22:32:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:32:01,618 INFO L462 AbstractCegarLoop]: Abstraction has 7838 states and 21960 transitions. [2019-12-26 22:32:01,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:32:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 7838 states and 21960 transitions. [2019-12-26 22:32:01,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:32:01,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:32:01,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:32:01,630 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:32:01,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:32:01,630 INFO L82 PathProgramCache]: Analyzing trace with hash 858764483, now seen corresponding path program 3 times [2019-12-26 22:32:01,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:32:01,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777301849] [2019-12-26 22:32:01,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:32:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:32:01,723 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:32:01,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777301849] [2019-12-26 22:32:01,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:32:01,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:32:01,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235878803] [2019-12-26 22:32:01,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:32:01,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:32:01,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:32:01,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:32:01,728 INFO L87 Difference]: Start difference. First operand 7838 states and 21960 transitions. Second operand 3 states. [2019-12-26 22:32:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:32:01,759 INFO L93 Difference]: Finished difference Result 6558 states and 18121 transitions. [2019-12-26 22:32:01,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:32:01,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 22:32:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:32:01,768 INFO L225 Difference]: With dead ends: 6558 [2019-12-26 22:32:01,769 INFO L226 Difference]: Without dead ends: 6558 [2019-12-26 22:32:01,769 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:32:01,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6558 states. [2019-12-26 22:32:01,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6558 to 6558. [2019-12-26 22:32:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6558 states. [2019-12-26 22:32:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6558 states to 6558 states and 18121 transitions. [2019-12-26 22:32:01,893 INFO L78 Accepts]: Start accepts. Automaton has 6558 states and 18121 transitions. Word has length 66 [2019-12-26 22:32:01,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:32:01,893 INFO L462 AbstractCegarLoop]: Abstraction has 6558 states and 18121 transitions. [2019-12-26 22:32:01,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:32:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6558 states and 18121 transitions. [2019-12-26 22:32:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:32:01,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:32:01,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:32:01,902 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:32:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:32:01,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1988699412, now seen corresponding path program 1 times [2019-12-26 22:32:01,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:32:01,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451721121] [2019-12-26 22:32:01,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:32:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:32:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:32:02,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451721121] [2019-12-26 22:32:02,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:32:02,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:32:02,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888681447] [2019-12-26 22:32:02,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:32:02,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:32:02,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:32:02,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:32:02,061 INFO L87 Difference]: Start difference. First operand 6558 states and 18121 transitions. Second operand 6 states. [2019-12-26 22:32:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:32:02,170 INFO L93 Difference]: Finished difference Result 11679 states and 32204 transitions. [2019-12-26 22:32:02,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:32:02,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-26 22:32:02,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:32:02,179 INFO L225 Difference]: With dead ends: 11679 [2019-12-26 22:32:02,179 INFO L226 Difference]: Without dead ends: 5505 [2019-12-26 22:32:02,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:32:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5505 states. [2019-12-26 22:32:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5505 to 5505. [2019-12-26 22:32:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5505 states. [2019-12-26 22:32:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5505 states to 5505 states and 15127 transitions. [2019-12-26 22:32:02,289 INFO L78 Accepts]: Start accepts. Automaton has 5505 states and 15127 transitions. Word has length 67 [2019-12-26 22:32:02,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:32:02,289 INFO L462 AbstractCegarLoop]: Abstraction has 5505 states and 15127 transitions. [2019-12-26 22:32:02,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:32:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 5505 states and 15127 transitions. [2019-12-26 22:32:02,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:32:02,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:32:02,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:32:02,296 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:32:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:32:02,297 INFO L82 PathProgramCache]: Analyzing trace with hash -313069350, now seen corresponding path program 2 times [2019-12-26 22:32:02,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:32:02,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799354496] [2019-12-26 22:32:02,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:32:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:32:02,379 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:32:02,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799354496] [2019-12-26 22:32:02,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:32:02,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:32:02,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393312319] [2019-12-26 22:32:02,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:32:02,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:32:02,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:32:02,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:32:02,384 INFO L87 Difference]: Start difference. First operand 5505 states and 15127 transitions. Second operand 3 states. [2019-12-26 22:32:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:32:02,445 INFO L93 Difference]: Finished difference Result 5504 states and 15125 transitions. [2019-12-26 22:32:02,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:32:02,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-26 22:32:02,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:32:02,454 INFO L225 Difference]: With dead ends: 5504 [2019-12-26 22:32:02,454 INFO L226 Difference]: Without dead ends: 5504 [2019-12-26 22:32:02,456 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:32:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2019-12-26 22:32:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 4089. [2019-12-26 22:32:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4089 states. [2019-12-26 22:32:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 11288 transitions. [2019-12-26 22:32:02,550 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 11288 transitions. Word has length 67 [2019-12-26 22:32:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:32:02,550 INFO L462 AbstractCegarLoop]: Abstraction has 4089 states and 11288 transitions. [2019-12-26 22:32:02,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:32:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 11288 transitions. [2019-12-26 22:32:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 22:32:02,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:32:02,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:32:02,554 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:32:02,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:32:02,555 INFO L82 PathProgramCache]: Analyzing trace with hash 839287492, now seen corresponding path program 1 times [2019-12-26 22:32:02,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:32:02,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511832933] [2019-12-26 22:32:02,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:32:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:32:02,772 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:32:02,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511832933] [2019-12-26 22:32:02,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:32:02,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:32:02,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006220332] [2019-12-26 22:32:02,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 22:32:02,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:32:02,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 22:32:02,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:32:02,775 INFO L87 Difference]: Start difference. First operand 4089 states and 11288 transitions. Second operand 14 states. [2019-12-26 22:32:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:32:03,363 INFO L93 Difference]: Finished difference Result 7144 states and 19566 transitions. [2019-12-26 22:32:03,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 22:32:03,364 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-26 22:32:03,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:32:03,373 INFO L225 Difference]: With dead ends: 7144 [2019-12-26 22:32:03,373 INFO L226 Difference]: Without dead ends: 6381 [2019-12-26 22:32:03,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2019-12-26 22:32:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6381 states. [2019-12-26 22:32:03,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6381 to 5459. [2019-12-26 22:32:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5459 states. [2019-12-26 22:32:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5459 states to 5459 states and 14951 transitions. [2019-12-26 22:32:03,455 INFO L78 Accepts]: Start accepts. Automaton has 5459 states and 14951 transitions. Word has length 68 [2019-12-26 22:32:03,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:32:03,455 INFO L462 AbstractCegarLoop]: Abstraction has 5459 states and 14951 transitions. [2019-12-26 22:32:03,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 22:32:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5459 states and 14951 transitions. [2019-12-26 22:32:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-26 22:32:03,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:32:03,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:32:03,464 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:32:03,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:32:03,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1214731398, now seen corresponding path program 2 times [2019-12-26 22:32:03,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:32:03,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927389499] [2019-12-26 22:32:03,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:32:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:32:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:32:03,729 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:32:03,729 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:32:03,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] ULTIMATE.startENTRY-->L817: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~x~0_167) (= v_~x$r_buff0_thd1~0_194 0) (= v_~x$r_buff1_thd0~0_280 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1019~0.base_25|) 0) (= |v_#NULL.offset_6| 0) (= v_~x$r_buff0_thd0~0_376 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1019~0.base_25| 4)) (= v_~a~0_13 0) (= v_~main$tmp_guard0~0_27 0) (< 0 |v_#StackHeapBarrier_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1019~0.base_25| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1019~0.base_25|) |v_ULTIMATE.start_main_~#t1019~0.offset_19| 0)) |v_#memory_int_15|) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1019~0.base_25| 1)) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1019~0.base_25|) (= 0 v_~x$r_buff0_thd2~0_295) (= 0 v_~x$w_buff0_used~0_668) (= 0 v_~x$r_buff1_thd2~0_179) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1~0_150) (= 0 v_~x$w_buff0~0_169) (= v_~y~0_123 0) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~x$r_buff0_thd3~0_178) (= v_~__unbuffered_cnt~0_130 0) (= 0 |v_ULTIMATE.start_main_~#t1019~0.offset_19|) (= 0 v_~z~0_9) (= v_~x$r_buff1_thd1~0_197 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~weak$$choice2~0_115 0) (= v_~x$mem_tmp~0_37 0) (= v_~__unbuffered_p2_EBX~0_19 0) (= v_~__unbuffered_p1_EAX~0_129 0) (= v_~x$flush_delayed~0_54 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p2_EAX~0_19) (= 0 v_~x$r_buff1_thd3~0_174) (= 0 v_~x$w_buff1_used~0_384))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ~x$w_buff0~0=v_~x$w_buff0~0_169, ULTIMATE.start_main_~#t1020~0.base=|v_ULTIMATE.start_main_~#t1020~0.base_27|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_37|, ~x$flush_delayed~0=v_~x$flush_delayed~0_54, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_37|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_35|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_197, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_178, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_~#t1020~0.offset=|v_ULTIMATE.start_main_~#t1020~0.offset_20|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_129, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_376, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_59|, ~x$w_buff1~0=v_~x$w_buff1~0_150, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_56|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_384, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_179, ULTIMATE.start_main_~#t1021~0.base=|v_ULTIMATE.start_main_~#t1021~0.base_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, 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_7, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130, ~x~0=v_~x~0_167, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_194, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_75|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_30|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_163|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_19|, ~x$mem_tmp~0=v_~x$mem_tmp~0_37, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_9|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_16|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_~#t1019~0.base=|v_ULTIMATE.start_main_~#t1019~0.base_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_64|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_280, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_295, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_56|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_668, ULTIMATE.start_main_~#t1021~0.offset=|v_ULTIMATE.start_main_~#t1021~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_115, ULTIMATE.start_main_~#t1019~0.offset=|v_ULTIMATE.start_main_~#t1019~0.offset_19|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t1020~0.base, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1020~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1021~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1019~0.base, 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_~#t1021~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1019~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 22:32:03,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L817-1-->L819: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1020~0.base_13| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1020~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1020~0.base_13|) |v_ULTIMATE.start_main_~#t1020~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1020~0.base_13| 4)) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1020~0.base_13| 1) |v_#valid_38|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1020~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1020~0.offset_11| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1020~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|, ULTIMATE.start_main_~#t1020~0.base=|v_ULTIMATE.start_main_~#t1020~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1020~0.offset=|v_ULTIMATE.start_main_~#t1020~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1020~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1020~0.offset] because there is no mapped edge [2019-12-26 22:32:03,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L4-->L768: Formula: (and (= ~x$r_buff1_thd1~0_Out1889405397 ~x$r_buff0_thd1~0_In1889405397) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1889405397)) (= ~x$r_buff0_thd3~0_In1889405397 ~x$r_buff1_thd3~0_Out1889405397) (= 1 ~x$r_buff0_thd2~0_Out1889405397) (= ~y~0_In1889405397 ~__unbuffered_p1_EAX~0_Out1889405397) (= ~x$r_buff1_thd0~0_Out1889405397 ~x$r_buff0_thd0~0_In1889405397) (= ~x$r_buff1_thd2~0_Out1889405397 ~x$r_buff0_thd2~0_In1889405397)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1889405397, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1889405397, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1889405397, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1889405397, ~y~0=~y~0_In1889405397, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1889405397} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In1889405397, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1889405397, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1889405397, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out1889405397, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out1889405397, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1889405397, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1889405397, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1889405397, ~y~0=~y~0_In1889405397, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1889405397, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1889405397} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 22:32:03,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-860932212 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-860932212 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-860932212|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-860932212 |P1Thread1of1ForFork1_#t~ite11_Out-860932212|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-860932212, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-860932212} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-860932212|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-860932212, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-860932212} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 22:32:03,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-533790345 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-533790345 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-533790345 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-533790345 256) 0))) (or (and (= ~x$w_buff1_used~0_In-533790345 |P1Thread1of1ForFork1_#t~ite12_Out-533790345|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-533790345|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-533790345, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-533790345, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-533790345, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-533790345} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-533790345, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-533790345, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-533790345|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-533790345, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-533790345} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 22:32:03,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L771-->L772: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-58222568 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-58222568 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-58222568) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-58222568 ~x$r_buff0_thd2~0_Out-58222568) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-58222568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-58222568} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-58222568|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-58222568, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-58222568} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 22:32:03,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L772-->L772-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In1474530262 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1474530262 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1474530262 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1474530262 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1474530262| ~x$r_buff1_thd2~0_In1474530262) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1474530262|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1474530262, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1474530262, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1474530262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1474530262} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1474530262, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1474530262, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1474530262, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1474530262|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1474530262} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 22:32:03,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L772-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_127 |v_P1Thread1of1ForFork1_#t~ite14_40|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_39|, 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:32:03,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L819-1-->L821: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1021~0.base_12| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1021~0.base_12|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1021~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1021~0.base_12|) |v_ULTIMATE.start_main_~#t1021~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t1021~0.base_12| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1021~0.base_12| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1021~0.base_12|) (= |v_ULTIMATE.start_main_~#t1021~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1021~0.offset=|v_ULTIMATE.start_main_~#t1021~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_6|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1021~0.base=|v_ULTIMATE.start_main_~#t1021~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1021~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1021~0.base, #length] because there is no mapped edge [2019-12-26 22:32:03,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L794-2-->L794-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In366559927 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In366559927 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out366559927| ~x$w_buff1~0_In366559927)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out366559927| ~x~0_In366559927) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In366559927, ~x$w_buff1_used~0=~x$w_buff1_used~0_In366559927, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In366559927, ~x~0=~x~0_In366559927} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out366559927|, ~x$w_buff1~0=~x$w_buff1~0_In366559927, ~x$w_buff1_used~0=~x$w_buff1_used~0_In366559927, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In366559927, ~x~0=~x~0_In366559927} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 22:32:03,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L794-4-->L795: Formula: (= v_~x~0_23 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_9|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-26 22:32:03,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L739-2-->L739-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd1~0_In-2144195329 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-2144195329 256) 0))) (or (and (= ~x$w_buff1~0_In-2144195329 |P0Thread1of1ForFork0_#t~ite3_Out-2144195329|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-2144195329| ~x~0_In-2144195329)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2144195329, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2144195329, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2144195329, ~x~0=~x~0_In-2144195329} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-2144195329|, ~x$w_buff1~0=~x$w_buff1~0_In-2144195329, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2144195329, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2144195329, ~x~0=~x~0_In-2144195329} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-26 22:32:03,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L739-4-->L740: Formula: (= v_~x~0_30 |v_P0Thread1of1ForFork0_#t~ite3_10|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_10|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_9|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_13|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-26 22:32:03,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L795-->L795-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-75100517 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-75100517 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-75100517|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-75100517 |P2Thread1of1ForFork2_#t~ite17_Out-75100517|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-75100517, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-75100517} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-75100517, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-75100517|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-75100517} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 22:32:03,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In439098622 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In439098622 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In439098622 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In439098622 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out439098622| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite18_Out439098622| ~x$w_buff1_used~0_In439098622)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In439098622, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In439098622, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In439098622, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439098622} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In439098622, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In439098622, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In439098622, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out439098622|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439098622} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 22:32:03,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1146940605 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-1146940605 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In-1146940605 |P2Thread1of1ForFork2_#t~ite19_Out-1146940605|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-1146940605|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1146940605, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1146940605} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1146940605, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1146940605|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1146940605} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 22:32:03,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L798-->L798-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In-2141367416 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-2141367416 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-2141367416 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-2141367416 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-2141367416| ~x$r_buff1_thd3~0_In-2141367416) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork2_#t~ite20_Out-2141367416| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2141367416, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2141367416, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2141367416, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2141367416} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-2141367416|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2141367416, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2141367416, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2141367416, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2141367416} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 22:32:03,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L798-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_38| v_~x$r_buff1_thd3~0_122)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_37|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_122, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 22:32:03,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In261756552 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In261756552 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out261756552|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In261756552 |P0Thread1of1ForFork0_#t~ite5_Out261756552|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In261756552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In261756552} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out261756552|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In261756552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In261756552} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 22:32:03,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In1471021188 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1471021188 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1471021188 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1471021188 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1471021188| ~x$w_buff1_used~0_In1471021188) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1471021188| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1471021188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1471021188, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1471021188, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1471021188} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1471021188|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1471021188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1471021188, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1471021188, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1471021188} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 22:32:03,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-488778256 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-488778256 256)))) (or (and (= ~x$r_buff0_thd1~0_In-488778256 |P0Thread1of1ForFork0_#t~ite7_Out-488778256|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-488778256|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-488778256, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-488778256} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-488778256, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-488778256|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-488778256} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 22:32:03,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L743-->L743-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-912244423 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-912244423 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-912244423 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-912244423 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-912244423|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd1~0_In-912244423 |P0Thread1of1ForFork0_#t~ite8_Out-912244423|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-912244423, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-912244423, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-912244423, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-912244423} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-912244423, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-912244423|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-912244423, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-912244423, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-912244423} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 22:32:03,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_83} 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:32:03,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L825-->L827-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_107 256) 0) (= (mod v_~x$r_buff0_thd0~0_52 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 22:32:03,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L827-2-->L827-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-581990366 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-581990366 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite24_Out-581990366| ~x$w_buff1~0_In-581990366)) (and (or .cse0 .cse1) (= ~x~0_In-581990366 |ULTIMATE.start_main_#t~ite24_Out-581990366|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-581990366, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-581990366, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-581990366, ~x~0=~x~0_In-581990366} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-581990366, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-581990366|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-581990366, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-581990366, ~x~0=~x~0_In-581990366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 22:32:03,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-4-->L828: Formula: (= v_~x~0_53 |v_ULTIMATE.start_main_#t~ite24_8|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_8|, ~x~0=v_~x~0_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~x~0] because there is no mapped edge [2019-12-26 22:32:03,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1958994571 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1958994571 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite26_Out1958994571| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1958994571 |ULTIMATE.start_main_#t~ite26_Out1958994571|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1958994571, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1958994571} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1958994571, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1958994571|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1958994571} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 22:32:03,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L829-->L829-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In547100289 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In547100289 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In547100289 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In547100289 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out547100289| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite27_Out547100289| ~x$w_buff1_used~0_In547100289)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In547100289, ~x$w_buff1_used~0=~x$w_buff1_used~0_In547100289, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In547100289, ~x$w_buff0_used~0=~x$w_buff0_used~0_In547100289} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In547100289, ~x$w_buff1_used~0=~x$w_buff1_used~0_In547100289, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out547100289|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In547100289, ~x$w_buff0_used~0=~x$w_buff0_used~0_In547100289} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 22:32:03,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1178771253 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1178771253 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1178771253 |ULTIMATE.start_main_#t~ite28_Out-1178771253|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out-1178771253|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1178771253, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1178771253} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1178771253, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1178771253|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1178771253} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 22:32:03,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L831-->L831-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In922850176 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In922850176 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In922850176 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In922850176 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out922850176| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In922850176 |ULTIMATE.start_main_#t~ite29_Out922850176|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In922850176, ~x$w_buff1_used~0=~x$w_buff1_used~0_In922850176, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In922850176, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922850176} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In922850176, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out922850176|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In922850176, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In922850176, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922850176} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 22:32:03,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L843-->L844: Formula: (and (= v_~x$r_buff0_thd0~0_95 v_~x$r_buff0_thd0~0_94) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_9|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 22:32:03,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L844-->L844-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1234038947 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1234038947 256)))) (or (and .cse0 (= (mod ~x$w_buff1_used~0_In1234038947 256) 0)) (= (mod ~x$w_buff0_used~0_In1234038947 256) 0) (and .cse0 (= (mod ~x$r_buff1_thd0~0_In1234038947 256) 0)))) (= ~x$r_buff1_thd0~0_In1234038947 |ULTIMATE.start_main_#t~ite50_Out1234038947|) (= |ULTIMATE.start_main_#t~ite50_Out1234038947| |ULTIMATE.start_main_#t~ite51_Out1234038947|) .cse1) (and (not .cse1) (= ~x$r_buff1_thd0~0_In1234038947 |ULTIMATE.start_main_#t~ite51_Out1234038947|) (= |ULTIMATE.start_main_#t~ite50_In1234038947| |ULTIMATE.start_main_#t~ite50_Out1234038947|)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In1234038947|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1234038947, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1234038947, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1234038947, ~weak$$choice2~0=~weak$$choice2~0_In1234038947, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1234038947} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1234038947|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1234038947, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1234038947|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1234038947, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1234038947, ~weak$$choice2~0=~weak$$choice2~0_In1234038947, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1234038947} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:32:03,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L846-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_11 256)) (= v_~x$mem_tmp~0_32 v_~x~0_141) (not (= 0 (mod v_~x$flush_delayed~0_43 256))) (= v_~x$flush_delayed~0_42 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_32} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_32, ~x~0=v_~x~0_141, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:32:03,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:32:03,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:32:03 BasicIcfg [2019-12-26 22:32:03,867 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:32:03,869 INFO L168 Benchmark]: Toolchain (without parser) took 179989.38 ms. Allocated memory was 136.8 MB in the beginning and 4.4 GB in the end (delta: 4.3 GB). Free memory was 98.8 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-26 22:32:03,870 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:32:03,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.34 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 98.4 MB in the beginning and 153.4 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:32:03,871 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.87 ms. Allocated memory is still 200.3 MB. Free memory was 153.4 MB in the beginning and 150.7 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:32:03,872 INFO L168 Benchmark]: Boogie Preprocessor took 39.33 ms. Allocated memory is still 200.3 MB. Free memory was 150.7 MB in the beginning and 147.9 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:32:03,873 INFO L168 Benchmark]: RCFGBuilder took 1044.22 ms. Allocated memory is still 200.3 MB. Free memory was 147.9 MB in the beginning and 97.5 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:32:03,873 INFO L168 Benchmark]: TraceAbstraction took 178003.33 ms. Allocated memory was 200.3 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 97.5 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-26 22:32:03,877 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 136.8 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.34 ms. Allocated memory was 136.8 MB in the beginning and 200.3 MB in the end (delta: 63.4 MB). Free memory was 98.4 MB in the beginning and 153.4 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.87 ms. Allocated memory is still 200.3 MB. Free memory was 153.4 MB in the beginning and 150.7 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.33 ms. Allocated memory is still 200.3 MB. Free memory was 150.7 MB in the beginning and 147.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1044.22 ms. Allocated memory is still 200.3 MB. Free memory was 147.9 MB in the beginning and 97.5 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 178003.33 ms. Allocated memory was 200.3 MB in the beginning and 4.4 GB in the end (delta: 4.2 GB). Free memory was 97.5 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 177 ProgramPointsBefore, 98 ProgramPointsAfterwards, 214 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 30 ChoiceCompositions, 5956 VarBasedMoverChecksPositive, 212 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 83692 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L817] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L819] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 2 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L768] 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=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0, z=0] [L768] 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) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 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 [L821] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L794] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L733] 1 a = 1 [L736] 1 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L739] 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=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L795] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L796] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L797] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L740] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 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 [L742] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L828] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L831] 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 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 x$flush_delayed = weak$$choice2 [L837] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L838] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L838] 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) [L839] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L839] 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)) [L840] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L840] 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)) [L841] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L841] 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)) [L842] EXPR 0 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L842] 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)) [L844] 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)) [L845] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 177.6s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 49.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3629 SDtfs, 3505 SDslu, 8118 SDs, 0 SdLazy, 4500 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 31 SyntacticMatches, 20 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258307occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 96.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 204382 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 833 NumberOfCodeBlocks, 833 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 746 ConstructedInterpolants, 0 QuantifiedInterpolants, 162983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...