/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:23:08,847 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:23:08,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:23:08,867 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:23:08,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:23:08,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:23:08,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:23:08,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:23:08,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:23:08,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:23:08,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:23:08,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:23:08,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:23:08,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:23:08,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:23:08,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:23:08,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:23:08,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:23:08,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:23:08,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:23:08,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:23:08,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:23:08,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:23:08,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:23:08,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:23:08,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:23:08,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:23:08,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:23:08,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:23:08,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:23:08,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:23:08,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:23:08,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:23:08,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:23:08,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:23:08,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:23:08,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:23:08,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:23:08,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:23:08,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:23:08,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:23:08,931 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:23:08,958 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:23:08,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:23:08,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:23:08,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:23:08,960 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:23:08,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:23:08,961 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:23:08,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:23:08,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:23:08,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:23:08,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:23:08,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:23:08,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:23:08,963 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:23:08,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:23:08,963 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:23:08,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:23:08,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:23:08,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:23:08,964 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:23:08,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:23:08,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:23:08,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:23:08,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:23:08,965 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:23:08,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:23:08,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:23:08,965 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:23:08,966 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:23:08,966 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:23:08,966 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:23:08,966 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:23:09,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:23:09,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:23:09,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:23:09,256 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:23:09,256 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:23:09,257 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.opt.i [2019-12-27 22:23:09,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e21e8b63d/3e8516905ddf4c598adc04405689e7bd/FLAG7b00cebf2 [2019-12-27 22:23:09,882 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:23:09,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.opt.i [2019-12-27 22:23:09,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e21e8b63d/3e8516905ddf4c598adc04405689e7bd/FLAG7b00cebf2 [2019-12-27 22:23:10,146 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e21e8b63d/3e8516905ddf4c598adc04405689e7bd [2019-12-27 22:23:10,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:23:10,160 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:23:10,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:23:10,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:23:10,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:23:10,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:23:10" (1/1) ... [2019-12-27 22:23:10,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2651ab3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:10, skipping insertion in model container [2019-12-27 22:23:10,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:23:10" (1/1) ... [2019-12-27 22:23:10,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:23:10,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:23:10,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:23:10,730 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:23:10,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:23:10,920 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:23:10,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:10 WrapperNode [2019-12-27 22:23:10,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:23:10,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:23:10,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:23:10,922 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:23:10,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:10" (1/1) ... [2019-12-27 22:23:10,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:10" (1/1) ... [2019-12-27 22:23:10,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:23:10,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:23:10,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:23:10,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:23:11,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:10" (1/1) ... [2019-12-27 22:23:11,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:10" (1/1) ... [2019-12-27 22:23:11,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:10" (1/1) ... [2019-12-27 22:23:11,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:10" (1/1) ... [2019-12-27 22:23:11,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:10" (1/1) ... [2019-12-27 22:23:11,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:10" (1/1) ... [2019-12-27 22:23:11,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:10" (1/1) ... [2019-12-27 22:23:11,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:23:11,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:23:11,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:23:11,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:23:11,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:23:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:23:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:23:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:23:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:23:11,101 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:23:11,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:23:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:23:11,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:23:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:23:11,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:23:11,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:23:11,104 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:23:11,824 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:23:11,825 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:23:11,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:23:11 BoogieIcfgContainer [2019-12-27 22:23:11,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:23:11,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:23:11,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:23:11,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:23:11,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:23:10" (1/3) ... [2019-12-27 22:23:11,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fbac27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:23:11, skipping insertion in model container [2019-12-27 22:23:11,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:23:10" (2/3) ... [2019-12-27 22:23:11,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fbac27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:23:11, skipping insertion in model container [2019-12-27 22:23:11,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:23:11" (3/3) ... [2019-12-27 22:23:11,835 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_pso.opt.i [2019-12-27 22:23:11,846 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:23:11,847 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:23:11,855 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:23:11,856 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:23:11,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,894 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,895 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,895 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,897 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,898 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,899 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,904 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,905 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,921 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,924 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,925 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:23:11,942 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 22:23:11,960 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:23:11,960 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:23:11,960 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:23:11,960 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:23:11,960 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:23:11,961 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:23:11,961 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:23:11,961 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:23:11,979 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 22:23:11,981 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 22:23:12,089 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 22:23:12,090 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:23:12,103 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 22:23:12,121 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 22:23:12,165 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 22:23:12,166 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:23:12,171 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 248 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 22:23:12,183 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-27 22:23:12,184 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:23:13,645 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-12-27 22:23:15,071 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-27 22:23:15,327 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 22:23:15,433 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 22:23:15,456 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54561 [2019-12-27 22:23:15,456 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 22:23:15,460 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 22:23:16,035 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-27 22:23:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-27 22:23:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:23:16,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:16,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:23:16,046 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:16,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:16,053 INFO L82 PathProgramCache]: Analyzing trace with hash 719045, now seen corresponding path program 1 times [2019-12-27 22:23:16,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:16,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832459814] [2019-12-27 22:23:16,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:16,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832459814] [2019-12-27 22:23:16,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:16,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:23:16,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1743047615] [2019-12-27 22:23:16,297 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:16,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:16,319 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:23:16,320 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:16,324 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:16,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:23:16,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:16,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:23:16,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:16,343 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-27 22:23:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:16,594 INFO L93 Difference]: Finished difference Result 9432 states and 30962 transitions. [2019-12-27 22:23:16,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:23:16,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:23:16,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:16,693 INFO L225 Difference]: With dead ends: 9432 [2019-12-27 22:23:16,694 INFO L226 Difference]: Without dead ends: 9250 [2019-12-27 22:23:16,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9250 states. [2019-12-27 22:23:17,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9250 to 9250. [2019-12-27 22:23:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9250 states. [2019-12-27 22:23:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9250 states to 9250 states and 30402 transitions. [2019-12-27 22:23:17,258 INFO L78 Accepts]: Start accepts. Automaton has 9250 states and 30402 transitions. Word has length 3 [2019-12-27 22:23:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:17,259 INFO L462 AbstractCegarLoop]: Abstraction has 9250 states and 30402 transitions. [2019-12-27 22:23:17,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:23:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 9250 states and 30402 transitions. [2019-12-27 22:23:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:23:17,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:17,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:17,265 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:17,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:17,266 INFO L82 PathProgramCache]: Analyzing trace with hash 616626766, now seen corresponding path program 1 times [2019-12-27 22:23:17,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:17,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078906627] [2019-12-27 22:23:17,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:17,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:17,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078906627] [2019-12-27 22:23:17,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:17,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:23:17,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1150331535] [2019-12-27 22:23:17,413 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:17,414 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:17,417 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:23:17,417 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:17,417 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:17,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:23:17,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:17,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:23:17,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:23:17,419 INFO L87 Difference]: Start difference. First operand 9250 states and 30402 transitions. Second operand 4 states. [2019-12-27 22:23:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:17,838 INFO L93 Difference]: Finished difference Result 14408 states and 45299 transitions. [2019-12-27 22:23:17,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:23:17,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:23:17,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:17,924 INFO L225 Difference]: With dead ends: 14408 [2019-12-27 22:23:17,924 INFO L226 Difference]: Without dead ends: 14401 [2019-12-27 22:23:17,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14401 states. [2019-12-27 22:23:18,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14401 to 13161. [2019-12-27 22:23:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13161 states. [2019-12-27 22:23:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13161 states to 13161 states and 42025 transitions. [2019-12-27 22:23:19,043 INFO L78 Accepts]: Start accepts. Automaton has 13161 states and 42025 transitions. Word has length 11 [2019-12-27 22:23:19,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:19,048 INFO L462 AbstractCegarLoop]: Abstraction has 13161 states and 42025 transitions. [2019-12-27 22:23:19,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:23:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 13161 states and 42025 transitions. [2019-12-27 22:23:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:23:19,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:19,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:19,057 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:19,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:19,058 INFO L82 PathProgramCache]: Analyzing trace with hash -887269812, now seen corresponding path program 1 times [2019-12-27 22:23:19,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:19,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851371147] [2019-12-27 22:23:19,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:19,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851371147] [2019-12-27 22:23:19,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:19,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:23:19,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462719557] [2019-12-27 22:23:19,149 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:19,150 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:19,152 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:23:19,153 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:19,153 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:19,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:23:19,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:19,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:23:19,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:23:19,154 INFO L87 Difference]: Start difference. First operand 13161 states and 42025 transitions. Second operand 4 states. [2019-12-27 22:23:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:19,484 INFO L93 Difference]: Finished difference Result 16164 states and 50739 transitions. [2019-12-27 22:23:19,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:23:19,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:23:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:19,527 INFO L225 Difference]: With dead ends: 16164 [2019-12-27 22:23:19,529 INFO L226 Difference]: Without dead ends: 16164 [2019-12-27 22:23:19,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:19,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16164 states. [2019-12-27 22:23:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16164 to 14464. [2019-12-27 22:23:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14464 states. [2019-12-27 22:23:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14464 states to 14464 states and 45803 transitions. [2019-12-27 22:23:20,063 INFO L78 Accepts]: Start accepts. Automaton has 14464 states and 45803 transitions. Word has length 11 [2019-12-27 22:23:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:20,063 INFO L462 AbstractCegarLoop]: Abstraction has 14464 states and 45803 transitions. [2019-12-27 22:23:20,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:23:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 14464 states and 45803 transitions. [2019-12-27 22:23:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 22:23:20,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:20,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:20,068 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:20,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1340562840, now seen corresponding path program 1 times [2019-12-27 22:23:20,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:20,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113354295] [2019-12-27 22:23:20,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:20,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113354295] [2019-12-27 22:23:20,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:20,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:20,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [689693180] [2019-12-27 22:23:20,155 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:20,157 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:20,165 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 39 transitions. [2019-12-27 22:23:20,165 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:20,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:20,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:20,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:20,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:20,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:20,168 INFO L87 Difference]: Start difference. First operand 14464 states and 45803 transitions. Second operand 5 states. [2019-12-27 22:23:20,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:20,847 INFO L93 Difference]: Finished difference Result 19369 states and 59796 transitions. [2019-12-27 22:23:20,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:23:20,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 22:23:20,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:20,896 INFO L225 Difference]: With dead ends: 19369 [2019-12-27 22:23:20,896 INFO L226 Difference]: Without dead ends: 19362 [2019-12-27 22:23:20,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:23:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19362 states. [2019-12-27 22:23:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19362 to 14438. [2019-12-27 22:23:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14438 states. [2019-12-27 22:23:21,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14438 states to 14438 states and 45411 transitions. [2019-12-27 22:23:21,321 INFO L78 Accepts]: Start accepts. Automaton has 14438 states and 45411 transitions. Word has length 17 [2019-12-27 22:23:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:21,321 INFO L462 AbstractCegarLoop]: Abstraction has 14438 states and 45411 transitions. [2019-12-27 22:23:21,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 14438 states and 45411 transitions. [2019-12-27 22:23:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:23:21,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:21,335 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-27 22:23:21,336 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:21,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:21,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1840046616, now seen corresponding path program 1 times [2019-12-27 22:23:21,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:21,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283067909] [2019-12-27 22:23:21,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:21,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283067909] [2019-12-27 22:23:21,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:21,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:21,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [172636805] [2019-12-27 22:23:21,391 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:21,396 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:21,401 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:23:21,401 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:21,401 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:21,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:23:21,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:21,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:23:21,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:21,403 INFO L87 Difference]: Start difference. First operand 14438 states and 45411 transitions. Second operand 3 states. [2019-12-27 22:23:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:21,700 INFO L93 Difference]: Finished difference Result 17602 states and 54691 transitions. [2019-12-27 22:23:21,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:23:21,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 22:23:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:21,745 INFO L225 Difference]: With dead ends: 17602 [2019-12-27 22:23:21,745 INFO L226 Difference]: Without dead ends: 17602 [2019-12-27 22:23:21,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17602 states. [2019-12-27 22:23:22,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17602 to 15582. [2019-12-27 22:23:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15582 states. [2019-12-27 22:23:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15582 states to 15582 states and 48928 transitions. [2019-12-27 22:23:22,166 INFO L78 Accepts]: Start accepts. Automaton has 15582 states and 48928 transitions. Word has length 25 [2019-12-27 22:23:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:22,166 INFO L462 AbstractCegarLoop]: Abstraction has 15582 states and 48928 transitions. [2019-12-27 22:23:22,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:23:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 15582 states and 48928 transitions. [2019-12-27 22:23:22,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:23:22,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:22,182 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-27 22:23:22,182 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:22,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:22,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1840202205, now seen corresponding path program 1 times [2019-12-27 22:23:22,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:22,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172146443] [2019-12-27 22:23:22,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:22,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172146443] [2019-12-27 22:23:22,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:22,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:22,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1768227434] [2019-12-27 22:23:22,258 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:22,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:22,267 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:23:22,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:22,268 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:22,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:23:22,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:22,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:23:22,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:23:22,269 INFO L87 Difference]: Start difference. First operand 15582 states and 48928 transitions. Second operand 4 states. [2019-12-27 22:23:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:22,303 INFO L93 Difference]: Finished difference Result 2444 states and 5542 transitions. [2019-12-27 22:23:22,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:23:22,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:23:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:22,306 INFO L225 Difference]: With dead ends: 2444 [2019-12-27 22:23:22,307 INFO L226 Difference]: Without dead ends: 2145 [2019-12-27 22:23:22,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2019-12-27 22:23:22,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2145. [2019-12-27 22:23:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2019-12-27 22:23:22,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 4722 transitions. [2019-12-27 22:23:22,340 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 4722 transitions. Word has length 25 [2019-12-27 22:23:22,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:22,340 INFO L462 AbstractCegarLoop]: Abstraction has 2145 states and 4722 transitions. [2019-12-27 22:23:22,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:23:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 4722 transitions. [2019-12-27 22:23:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:23:22,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:22,344 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-27 22:23:22,344 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:22,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:22,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1265486951, now seen corresponding path program 1 times [2019-12-27 22:23:22,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:22,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425664238] [2019-12-27 22:23:22,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:22,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425664238] [2019-12-27 22:23:22,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:22,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:23:22,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [640521006] [2019-12-27 22:23:22,489 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:22,499 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:22,511 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 37 transitions. [2019-12-27 22:23:22,511 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:22,512 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:22,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:22,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:22,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:22,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:22,513 INFO L87 Difference]: Start difference. First operand 2145 states and 4722 transitions. Second operand 5 states. [2019-12-27 22:23:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:22,555 INFO L93 Difference]: Finished difference Result 443 states and 801 transitions. [2019-12-27 22:23:22,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:23:22,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 22:23:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:22,556 INFO L225 Difference]: With dead ends: 443 [2019-12-27 22:23:22,556 INFO L226 Difference]: Without dead ends: 372 [2019-12-27 22:23:22,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:23:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-27 22:23:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 344. [2019-12-27 22:23:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 22:23:22,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 620 transitions. [2019-12-27 22:23:22,563 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 620 transitions. Word has length 37 [2019-12-27 22:23:22,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:22,563 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 620 transitions. [2019-12-27 22:23:22,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 620 transitions. [2019-12-27 22:23:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 22:23:22,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:22,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:22,567 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:22,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:22,567 INFO L82 PathProgramCache]: Analyzing trace with hash -723762532, now seen corresponding path program 1 times [2019-12-27 22:23:22,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:22,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628197048] [2019-12-27 22:23:22,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:22,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628197048] [2019-12-27 22:23:22,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:22,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:23:22,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1832967399] [2019-12-27 22:23:22,679 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:22,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:22,999 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 22:23:22,999 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:23,018 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:23:23,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:23,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:23,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:23,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:23,020 INFO L87 Difference]: Start difference. First operand 344 states and 620 transitions. Second operand 5 states. [2019-12-27 22:23:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:23,204 INFO L93 Difference]: Finished difference Result 439 states and 767 transitions. [2019-12-27 22:23:23,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:23:23,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 22:23:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:23,205 INFO L225 Difference]: With dead ends: 439 [2019-12-27 22:23:23,205 INFO L226 Difference]: Without dead ends: 439 [2019-12-27 22:23:23,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:23:23,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-12-27 22:23:23,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 332. [2019-12-27 22:23:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 22:23:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 584 transitions. [2019-12-27 22:23:23,211 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 584 transitions. Word has length 52 [2019-12-27 22:23:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:23,212 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 584 transitions. [2019-12-27 22:23:23,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 584 transitions. [2019-12-27 22:23:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 22:23:23,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:23,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:23,213 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:23,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2146679471, now seen corresponding path program 1 times [2019-12-27 22:23:23,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:23,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230859184] [2019-12-27 22:23:23,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:23,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:23,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230859184] [2019-12-27 22:23:23,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:23,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:23:23,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [395566468] [2019-12-27 22:23:23,299 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:23,312 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:23,338 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 73 transitions. [2019-12-27 22:23:23,339 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:23,342 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:23:23,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:23,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:23,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:23,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:23,343 INFO L87 Difference]: Start difference. First operand 332 states and 584 transitions. Second operand 5 states. [2019-12-27 22:23:23,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:23,542 INFO L93 Difference]: Finished difference Result 488 states and 866 transitions. [2019-12-27 22:23:23,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:23:23,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 22:23:23,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:23,543 INFO L225 Difference]: With dead ends: 488 [2019-12-27 22:23:23,543 INFO L226 Difference]: Without dead ends: 488 [2019-12-27 22:23:23,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:23:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-12-27 22:23:23,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 423. [2019-12-27 22:23:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-27 22:23:23,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 750 transitions. [2019-12-27 22:23:23,550 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 750 transitions. Word has length 53 [2019-12-27 22:23:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:23,550 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 750 transitions. [2019-12-27 22:23:23,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 750 transitions. [2019-12-27 22:23:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 22:23:23,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:23,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:23,552 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:23,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:23,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1496527321, now seen corresponding path program 2 times [2019-12-27 22:23:23,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:23,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371380277] [2019-12-27 22:23:23,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:23,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371380277] [2019-12-27 22:23:23,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:23,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:23:23,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [436971928] [2019-12-27 22:23:23,655 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:23,669 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:23,698 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 89 transitions. [2019-12-27 22:23:23,698 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:23,699 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:23,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:23:23,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:23,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:23:23,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:23,700 INFO L87 Difference]: Start difference. First operand 423 states and 750 transitions. Second operand 3 states. [2019-12-27 22:23:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:23,744 INFO L93 Difference]: Finished difference Result 423 states and 749 transitions. [2019-12-27 22:23:23,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:23:23,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 22:23:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:23,745 INFO L225 Difference]: With dead ends: 423 [2019-12-27 22:23:23,745 INFO L226 Difference]: Without dead ends: 423 [2019-12-27 22:23:23,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:23,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-12-27 22:23:23,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 332. [2019-12-27 22:23:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-27 22:23:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 583 transitions. [2019-12-27 22:23:23,750 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 583 transitions. Word has length 53 [2019-12-27 22:23:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:23,750 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 583 transitions. [2019-12-27 22:23:23,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:23:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 583 transitions. [2019-12-27 22:23:23,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:23:23,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:23,751 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:23,751 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:23,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:23,752 INFO L82 PathProgramCache]: Analyzing trace with hash -826251112, now seen corresponding path program 1 times [2019-12-27 22:23:23,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:23,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079150367] [2019-12-27 22:23:23,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:24,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079150367] [2019-12-27 22:23:24,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:24,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:23:24,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1656605014] [2019-12-27 22:23:24,049 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:24,068 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:24,163 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 65 states and 74 transitions. [2019-12-27 22:23:24,164 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:24,168 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:23:24,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:23:24,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:24,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:23:24,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:23:24,169 INFO L87 Difference]: Start difference. First operand 332 states and 583 transitions. Second operand 13 states. [2019-12-27 22:23:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:24,904 INFO L93 Difference]: Finished difference Result 821 states and 1400 transitions. [2019-12-27 22:23:24,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 22:23:24,905 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 22:23:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:24,906 INFO L225 Difference]: With dead ends: 821 [2019-12-27 22:23:24,906 INFO L226 Difference]: Without dead ends: 273 [2019-12-27 22:23:24,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-12-27 22:23:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-27 22:23:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 222. [2019-12-27 22:23:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-27 22:23:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 393 transitions. [2019-12-27 22:23:24,910 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 393 transitions. Word has length 54 [2019-12-27 22:23:24,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:24,911 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 393 transitions. [2019-12-27 22:23:24,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:23:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 393 transitions. [2019-12-27 22:23:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:23:24,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:24,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:24,912 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:24,912 INFO L82 PathProgramCache]: Analyzing trace with hash -2130111720, now seen corresponding path program 2 times [2019-12-27 22:23:24,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:24,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332502167] [2019-12-27 22:23:24,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:25,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332502167] [2019-12-27 22:23:25,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:25,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:23:25,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [615561566] [2019-12-27 22:23:25,165 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:25,179 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:25,213 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 115 transitions. [2019-12-27 22:23:25,213 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:25,360 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:23:25,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:23:25,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:25,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:23:25,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:23:25,361 INFO L87 Difference]: Start difference. First operand 222 states and 393 transitions. Second operand 15 states. [2019-12-27 22:23:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:27,269 INFO L93 Difference]: Finished difference Result 568 states and 964 transitions. [2019-12-27 22:23:27,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 22:23:27,270 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2019-12-27 22:23:27,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:27,271 INFO L225 Difference]: With dead ends: 568 [2019-12-27 22:23:27,272 INFO L226 Difference]: Without dead ends: 534 [2019-12-27 22:23:27,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=267, Invalid=1293, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 22:23:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-12-27 22:23:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 322. [2019-12-27 22:23:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 22:23:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 564 transitions. [2019-12-27 22:23:27,279 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 564 transitions. Word has length 54 [2019-12-27 22:23:27,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:27,280 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 564 transitions. [2019-12-27 22:23:27,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:23:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 564 transitions. [2019-12-27 22:23:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:23:27,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:27,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:27,282 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:27,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:27,282 INFO L82 PathProgramCache]: Analyzing trace with hash -688648962, now seen corresponding path program 3 times [2019-12-27 22:23:27,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:27,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132420546] [2019-12-27 22:23:27,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:27,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132420546] [2019-12-27 22:23:27,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:27,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:23:27,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1754949531] [2019-12-27 22:23:27,482 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:27,494 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:27,527 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 114 transitions. [2019-12-27 22:23:27,527 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:27,567 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:23:27,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:23:27,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:27,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:23:27,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:23:27,569 INFO L87 Difference]: Start difference. First operand 322 states and 564 transitions. Second operand 13 states. [2019-12-27 22:23:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:27,849 INFO L93 Difference]: Finished difference Result 426 states and 720 transitions. [2019-12-27 22:23:27,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:23:27,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 22:23:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:27,851 INFO L225 Difference]: With dead ends: 426 [2019-12-27 22:23:27,851 INFO L226 Difference]: Without dead ends: 392 [2019-12-27 22:23:27,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:23:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-12-27 22:23:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 330. [2019-12-27 22:23:27,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-27 22:23:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 578 transitions. [2019-12-27 22:23:27,857 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 578 transitions. Word has length 54 [2019-12-27 22:23:27,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:27,857 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 578 transitions. [2019-12-27 22:23:27,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:23:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 578 transitions. [2019-12-27 22:23:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 22:23:27,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:27,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:27,859 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:27,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:27,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1187524996, now seen corresponding path program 4 times [2019-12-27 22:23:27,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:27,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692172894] [2019-12-27 22:23:27,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:23:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:23:27,963 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:23:27,963 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:23:27,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= v_~x~0_11 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t2015~0.base_24|) 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~y$r_buff1_thd1~0_20) (= v_~y$read_delayed~0_7 0) (= |v_#NULL.offset_3| 0) (= v_~main$tmp_guard0~0_12 0) (= |v_ULTIMATE.start_main_~#t2015~0.offset_19| 0) (= 0 v_~y$w_buff1~0_25) (= v_~y$w_buff0_used~0_103 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2015~0.base_24|) (= v_~y~0_29 0) (= 0 v_~y$r_buff1_thd0~0_50) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~weak$$choice2~0_35) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2015~0.base_24| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2015~0.base_24|) |v_ULTIMATE.start_main_~#t2015~0.offset_19| 0))) (= 0 v_~y$r_buff1_thd2~0_17) (= v_~y$mem_tmp~0_12 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2015~0.base_24| 4)) (= 0 |v_#NULL.base_3|) (= v_~y$w_buff1_used~0_66 0) (= v_~y$r_buff0_thd1~0_27 0) (= v_~main$tmp_guard1~0_13 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2015~0.base_24| 1)) (= v_~y$r_buff0_thd2~0_21 0) (= v_~y$r_buff0_thd0~0_76 0) (= 0 v_~y$flush_delayed~0_17) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_18|, ULTIMATE.start_main_~#t2016~0.offset=|v_ULTIMATE.start_main_~#t2016~0.offset_17|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_14|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_27, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, #length=|v_#length_11|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_15|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_15|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_10|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_17|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_17|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_~#t2016~0.base=|v_ULTIMATE.start_main_~#t2016~0.base_20|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_50, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_17|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_16|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_12|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ULTIMATE.start_main_~#t2015~0.base=|v_ULTIMATE.start_main_~#t2015~0.base_24|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ULTIMATE.start_main_~#t2015~0.offset=|v_ULTIMATE.start_main_~#t2015~0.offset_19|, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y~0=v_~y~0_29, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_14|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_10|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_17|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2016~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2016~0.base, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2015~0.base, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t2015~0.offset, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:23:27,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L779-1-->L781: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2016~0.base_11|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2016~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2016~0.base_11|) |v_ULTIMATE.start_main_~#t2016~0.offset_10| 1)) |v_#memory_int_7|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2016~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2016~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2016~0.base_11|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2016~0.base_11| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2016~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2016~0.offset=|v_ULTIMATE.start_main_~#t2016~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2016~0.base=|v_ULTIMATE.start_main_~#t2016~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2016~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2016~0.base] because there is no mapped edge [2019-12-27 22:23:27,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] P0ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_57 256) 0) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 1 v_~y$w_buff0_used~0_91) (= v_~y$w_buff1_used~0_57 v_~y$w_buff0_used~0_92) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_91, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:23:27,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L756-2-->L756-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1509963221 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1509963221 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out1509963221| ~y$w_buff1~0_In1509963221) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In1509963221 |P1Thread1of1ForFork1_#t~ite9_Out1509963221|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1509963221, ~y$w_buff1~0=~y$w_buff1~0_In1509963221, ~y~0=~y~0_In1509963221, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1509963221} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1509963221, ~y$w_buff1~0=~y$w_buff1~0_In1509963221, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1509963221|, ~y~0=~y~0_In1509963221, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1509963221} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 22:23:27,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L756-4-->L757: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_19) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 22:23:27,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L757-->L757-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-325303615 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-325303615 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-325303615| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-325303615 |P1Thread1of1ForFork1_#t~ite11_Out-325303615|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-325303615, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-325303615} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-325303615, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-325303615, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-325303615|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:23:27,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-18691682 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-18691682 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-18691682 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-18691682 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-18691682|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-18691682 |P1Thread1of1ForFork1_#t~ite12_Out-18691682|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-18691682, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-18691682, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-18691682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-18691682} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-18691682, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-18691682, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-18691682, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-18691682|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-18691682} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:23:27,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L759-->L759-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1450088618 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1450088618 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1450088618 |P1Thread1of1ForFork1_#t~ite13_Out1450088618|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1450088618|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1450088618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1450088618} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1450088618, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1450088618, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1450088618|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:23:27,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1497550590 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1497550590 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1497550590 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1497550590 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out1497550590| ~y$r_buff1_thd2~0_In1497550590)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out1497550590| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1497550590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1497550590, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1497550590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1497550590} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1497550590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1497550590, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1497550590, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1497550590|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1497550590} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:23:27,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:23:27,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1090577064 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1090577064 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1090577064| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1090577064| ~y$w_buff0_used~0_In1090577064)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1090577064, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1090577064} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1090577064|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1090577064, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1090577064} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:23:27,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L738-->L738-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-740837358 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-740837358 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-740837358 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-740837358 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-740837358|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-740837358 |P0Thread1of1ForFork0_#t~ite6_Out-740837358|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-740837358, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-740837358, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-740837358, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-740837358} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-740837358|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-740837358, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-740837358, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-740837358, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-740837358} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:23:27,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L739-->L740: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In262672173 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In262672173 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out262672173 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out262672173 ~y$r_buff0_thd1~0_In262672173) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In262672173, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In262672173} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In262672173, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out262672173|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out262672173} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:23:27,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1956535854 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1956535854 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-1956535854 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1956535854 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1956535854| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1956535854| ~y$r_buff1_thd1~0_In-1956535854) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1956535854, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1956535854, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1956535854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1956535854} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1956535854, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1956535854, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1956535854|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1956535854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1956535854} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:23:27,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:23:27,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [577] [577] L785-->L787-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= (mod v_~y$w_buff0_used~0_67 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_44 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_44, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:23:27,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-2-->L787-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite18_Out84230426| |ULTIMATE.start_main_#t~ite17_Out84230426|)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In84230426 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In84230426 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite17_Out84230426| ~y$w_buff1~0_In84230426)) (and .cse1 (= |ULTIMATE.start_main_#t~ite17_Out84230426| ~y~0_In84230426) (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In84230426, ~y~0=~y~0_In84230426, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In84230426, ~y$w_buff1_used~0=~y$w_buff1_used~0_In84230426} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out84230426|, ~y$w_buff1~0=~y$w_buff1~0_In84230426, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out84230426|, ~y~0=~y~0_In84230426, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In84230426, ~y$w_buff1_used~0=~y$w_buff1_used~0_In84230426} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 22:23:27,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-289034541 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-289034541 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-289034541| 0)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-289034541 |ULTIMATE.start_main_#t~ite19_Out-289034541|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-289034541, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-289034541} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-289034541, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-289034541|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-289034541} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 22:23:27,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-153776536 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-153776536 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-153776536 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-153776536 256) 0))) (or (and (= ~y$w_buff1_used~0_In-153776536 |ULTIMATE.start_main_#t~ite20_Out-153776536|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-153776536|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-153776536, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-153776536, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-153776536, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-153776536} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-153776536, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-153776536, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-153776536|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-153776536, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-153776536} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 22:23:27,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In870959263 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In870959263 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out870959263| ~y$r_buff0_thd0~0_In870959263)) (and (= |ULTIMATE.start_main_#t~ite21_Out870959263| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In870959263, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In870959263} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In870959263, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In870959263, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out870959263|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 22:23:27,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1034225459 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1034225459 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1034225459 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1034225459 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out1034225459| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite22_Out1034225459| ~y$r_buff1_thd0~0_In1034225459)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1034225459, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1034225459, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1034225459, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1034225459} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1034225459, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1034225459, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1034225459, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1034225459|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1034225459} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 22:23:27,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-896686542 256)))) (or (and (= |ULTIMATE.start_main_#t~ite31_In-896686542| |ULTIMATE.start_main_#t~ite31_Out-896686542|) (not .cse0) (= |ULTIMATE.start_main_#t~ite32_Out-896686542| ~y$w_buff1~0_In-896686542)) (and .cse0 (= |ULTIMATE.start_main_#t~ite31_Out-896686542| |ULTIMATE.start_main_#t~ite32_Out-896686542|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-896686542 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-896686542 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-896686542 256)) (and (= 0 (mod ~y$r_buff1_thd0~0_In-896686542 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite31_Out-896686542| ~y$w_buff1~0_In-896686542)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-896686542, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-896686542, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-896686542, ~weak$$choice2~0=~weak$$choice2~0_In-896686542, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-896686542|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-896686542, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-896686542} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-896686542, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-896686542, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-896686542, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-896686542|, ~weak$$choice2~0=~weak$$choice2~0_In-896686542, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-896686542|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-896686542, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-896686542} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 22:23:27,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L803-->L804: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_66 v_~y$r_buff0_thd0~0_65)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 22:23:27,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L806-->L809-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_23 v_~y$mem_tmp~0_7) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_23, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:23:27,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L809-1-->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-27 22:23:28,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:23:28 BasicIcfg [2019-12-27 22:23:28,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:23:28,048 INFO L168 Benchmark]: Toolchain (without parser) took 17889.36 ms. Allocated memory was 145.8 MB in the beginning and 763.4 MB in the end (delta: 617.6 MB). Free memory was 101.3 MB in the beginning and 520.0 MB in the end (delta: -418.7 MB). Peak memory consumption was 198.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:28,049 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 22:23:28,049 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.15 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 157.2 MB in the end (delta: -56.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:28,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.01 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 154.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:28,050 INFO L168 Benchmark]: Boogie Preprocessor took 43.32 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 152.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:28,051 INFO L168 Benchmark]: RCFGBuilder took 785.72 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 107.8 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:28,052 INFO L168 Benchmark]: TraceAbstraction took 16218.91 ms. Allocated memory was 202.9 MB in the beginning and 763.4 MB in the end (delta: 560.5 MB). Free memory was 107.8 MB in the beginning and 520.0 MB in the end (delta: -412.2 MB). Peak memory consumption was 148.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:28,055 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.23 ms. Allocated memory is still 145.8 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.15 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 157.2 MB in the end (delta: -56.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.01 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 154.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.32 ms. Allocated memory is still 202.9 MB. Free memory was 154.3 MB in the beginning and 152.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 785.72 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 107.8 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16218.91 ms. Allocated memory was 202.9 MB in the beginning and 763.4 MB in the end (delta: 560.5 MB). Free memory was 107.8 MB in the beginning and 520.0 MB in the end (delta: -412.2 MB). Peak memory consumption was 148.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 146 ProgramPointsBefore, 81 ProgramPointsAfterwards, 180 TransitionsBefore, 94 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 8 FixpointIterations, 28 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 24 ChoiceCompositions, 3312 VarBasedMoverChecksPositive, 143 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54561 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t2015, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2016, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1417 SDtfs, 1541 SDslu, 3807 SDs, 0 SdLazy, 2317 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15582occurred 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: 3.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 10500 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 503 NumberOfCodeBlocks, 503 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 102865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...