/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:13:15,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:13:15,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:13:15,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:13:15,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:13:15,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:13:15,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:13:15,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:13:15,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:13:15,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:13:15,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:13:15,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:13:15,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:13:15,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:13:15,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:13:15,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:13:15,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:13:15,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:13:15,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:13:15,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:13:15,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:13:15,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:13:15,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:13:15,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:13:15,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:13:15,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:13:15,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:13:15,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:13:15,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:13:15,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:13:15,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:13:15,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:13:15,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:13:15,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:13:15,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:13:15,971 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:13:15,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:13:15,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:13:15,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:13:15,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:13:15,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:13:15,975 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-SemanticLbe-MCR.epf [2019-12-27 18:13:16,004 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:13:16,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:13:16,005 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:13:16,005 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:13:16,006 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:13:16,006 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:13:16,008 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:13:16,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:13:16,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:13:16,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:13:16,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:13:16,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:13:16,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:13:16,009 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:13:16,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:13:16,009 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:13:16,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:13:16,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:13:16,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:13:16,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:13:16,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:13:16,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:13:16,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:13:16,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:13:16,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:13:16,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:13:16,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:13:16,012 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:13:16,012 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:13:16,012 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:13:16,013 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:13:16,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:13:16,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:13:16,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:13:16,315 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:13:16,316 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:13:16,316 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2019-12-27 18:13:16,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd74c39ed/21b4a9d2b8594ff68aad4982ab644489/FLAGad1ae81ba [2019-12-27 18:13:16,922 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:13:16,929 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2019-12-27 18:13:16,954 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd74c39ed/21b4a9d2b8594ff68aad4982ab644489/FLAGad1ae81ba [2019-12-27 18:13:17,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd74c39ed/21b4a9d2b8594ff68aad4982ab644489 [2019-12-27 18:13:17,215 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:13:17,217 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:13:17,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:13:17,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:13:17,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:13:17,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:17" (1/1) ... [2019-12-27 18:13:17,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:17, skipping insertion in model container [2019-12-27 18:13:17,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:17" (1/1) ... [2019-12-27 18:13:17,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:13:17,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:13:17,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:13:17,904 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:13:17,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:13:18,071 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:13:18,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:18 WrapperNode [2019-12-27 18:13:18,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:13:18,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:13:18,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:13:18,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:13:18,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:18" (1/1) ... [2019-12-27 18:13:18,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:18" (1/1) ... [2019-12-27 18:13:18,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:13:18,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:13:18,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:13:18,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:13:18,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:18" (1/1) ... [2019-12-27 18:13:18,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:18" (1/1) ... [2019-12-27 18:13:18,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:18" (1/1) ... [2019-12-27 18:13:18,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:18" (1/1) ... [2019-12-27 18:13:18,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:18" (1/1) ... [2019-12-27 18:13:18,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:18" (1/1) ... [2019-12-27 18:13:18,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:18" (1/1) ... [2019-12-27 18:13:18,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:13:18,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:13:18,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:13:18,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:13:18,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:18" (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 18:13:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:13:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:13:18,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:13:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:13:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:13:18,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:13:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:13:18,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:13:18,262 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:13:18,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:13:18,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:13:18,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:13:18,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:13:18,265 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 18:13:19,053 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:13:19,053 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:13:19,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:19 BoogieIcfgContainer [2019-12-27 18:13:19,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:13:19,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:13:19,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:13:19,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:13:19,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:13:17" (1/3) ... [2019-12-27 18:13:19,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21862abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:19, skipping insertion in model container [2019-12-27 18:13:19,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:18" (2/3) ... [2019-12-27 18:13:19,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21862abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:19, skipping insertion in model container [2019-12-27 18:13:19,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:19" (3/3) ... [2019-12-27 18:13:19,064 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_rmo.opt.i [2019-12-27 18:13:19,072 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:13:19,073 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:13:19,080 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:13:19,081 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:13:19,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,119 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,120 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,131 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,160 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,160 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,174 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,179 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,180 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,183 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,183 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:19,199 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:13:19,221 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:13:19,221 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:13:19,221 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:13:19,222 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:13:19,222 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:13:19,222 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:13:19,222 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:13:19,222 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:13:19,238 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 18:13:19,240 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 18:13:19,353 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 18:13:19,353 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:13:19,372 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:13:19,393 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 18:13:19,483 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 18:13:19,484 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:13:19,491 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:13:19,510 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 18:13:19,512 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:13:24,725 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 18:13:24,845 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 18:13:24,871 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86146 [2019-12-27 18:13:24,872 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 18:13:24,875 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 104 transitions [2019-12-27 18:13:40,039 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-27 18:13:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-27 18:13:40,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:13:40,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:13:40,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:13:40,048 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:13:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:13:40,053 INFO L82 PathProgramCache]: Analyzing trace with hash 844471, now seen corresponding path program 1 times [2019-12-27 18:13:40,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:13:40,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988995653] [2019-12-27 18:13:40,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:13:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:13:40,263 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 18:13:40,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988995653] [2019-12-27 18:13:40,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:13:40,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:13:40,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [168331566] [2019-12-27 18:13:40,266 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:13:40,273 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:13:40,287 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:13:40,288 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:13:40,292 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:13:40,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:13:40,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:13:40,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:13:40,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:13:40,310 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-27 18:13:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:13:43,792 INFO L93 Difference]: Finished difference Result 104560 states and 448162 transitions. [2019-12-27 18:13:43,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:13:43,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:13:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:13:44,425 INFO L225 Difference]: With dead ends: 104560 [2019-12-27 18:13:44,425 INFO L226 Difference]: Without dead ends: 102376 [2019-12-27 18:13:44,427 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 18:13:48,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102376 states. [2019-12-27 18:13:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102376 to 102376. [2019-12-27 18:13:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102376 states. [2019-12-27 18:13:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102376 states to 102376 states and 439244 transitions. [2019-12-27 18:13:54,394 INFO L78 Accepts]: Start accepts. Automaton has 102376 states and 439244 transitions. Word has length 3 [2019-12-27 18:13:54,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:13:54,394 INFO L462 AbstractCegarLoop]: Abstraction has 102376 states and 439244 transitions. [2019-12-27 18:13:54,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:13:54,395 INFO L276 IsEmpty]: Start isEmpty. Operand 102376 states and 439244 transitions. [2019-12-27 18:13:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:13:54,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:13:54,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:13:54,399 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:13:54,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:13:54,400 INFO L82 PathProgramCache]: Analyzing trace with hash 205437058, now seen corresponding path program 1 times [2019-12-27 18:13:54,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:13:54,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737827920] [2019-12-27 18:13:54,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:13:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:13:54,489 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 18:13:54,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737827920] [2019-12-27 18:13:54,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:13:54,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:13:54,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2059494775] [2019-12-27 18:13:54,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:13:54,492 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:13:54,496 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:13:54,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:13:54,496 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:13:54,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:13:54,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:13:54,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:13:54,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:13:54,499 INFO L87 Difference]: Start difference. First operand 102376 states and 439244 transitions. Second operand 4 states. [2019-12-27 18:13:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:13:59,458 INFO L93 Difference]: Finished difference Result 164490 states and 678436 transitions. [2019-12-27 18:13:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:13:59,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:13:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:00,027 INFO L225 Difference]: With dead ends: 164490 [2019-12-27 18:14:00,027 INFO L226 Difference]: Without dead ends: 164441 [2019-12-27 18:14:00,028 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 18:14:04,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164441 states. [2019-12-27 18:14:07,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164441 to 148513. [2019-12-27 18:14:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148513 states. [2019-12-27 18:14:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148513 states to 148513 states and 619831 transitions. [2019-12-27 18:14:15,281 INFO L78 Accepts]: Start accepts. Automaton has 148513 states and 619831 transitions. Word has length 11 [2019-12-27 18:14:15,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:15,282 INFO L462 AbstractCegarLoop]: Abstraction has 148513 states and 619831 transitions. [2019-12-27 18:14:15,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:14:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 148513 states and 619831 transitions. [2019-12-27 18:14:15,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:14:15,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:15,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:15,289 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:15,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:15,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1045519438, now seen corresponding path program 1 times [2019-12-27 18:14:15,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:15,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107180431] [2019-12-27 18:14:15,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:15,425 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 18:14:15,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107180431] [2019-12-27 18:14:15,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:15,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:15,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [323706109] [2019-12-27 18:14:15,427 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:15,428 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:15,433 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:14:15,433 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:15,434 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:15,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:14:15,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:15,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:14:15,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:14:15,435 INFO L87 Difference]: Start difference. First operand 148513 states and 619831 transitions. Second operand 4 states. [2019-12-27 18:14:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:18,260 INFO L93 Difference]: Finished difference Result 211896 states and 864765 transitions. [2019-12-27 18:14:18,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:14:18,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:14:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:19,060 INFO L225 Difference]: With dead ends: 211896 [2019-12-27 18:14:19,060 INFO L226 Difference]: Without dead ends: 211833 [2019-12-27 18:14:19,061 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 18:14:25,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211833 states. [2019-12-27 18:14:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211833 to 178183. [2019-12-27 18:14:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178183 states. [2019-12-27 18:14:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178183 states to 178183 states and 738846 transitions. [2019-12-27 18:14:35,223 INFO L78 Accepts]: Start accepts. Automaton has 178183 states and 738846 transitions. Word has length 13 [2019-12-27 18:14:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:35,225 INFO L462 AbstractCegarLoop]: Abstraction has 178183 states and 738846 transitions. [2019-12-27 18:14:35,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:14:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 178183 states and 738846 transitions. [2019-12-27 18:14:35,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:14:35,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:35,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:35,229 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:35,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:35,229 INFO L82 PathProgramCache]: Analyzing trace with hash 31849685, now seen corresponding path program 1 times [2019-12-27 18:14:35,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:35,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881200190] [2019-12-27 18:14:35,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:35,272 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 18:14:35,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881200190] [2019-12-27 18:14:35,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:35,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:35,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [58762169] [2019-12-27 18:14:35,276 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:35,277 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:35,280 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:14:35,280 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:35,280 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:35,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:35,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:35,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:35,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:35,281 INFO L87 Difference]: Start difference. First operand 178183 states and 738846 transitions. Second operand 3 states. [2019-12-27 18:14:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:35,418 INFO L93 Difference]: Finished difference Result 36088 states and 117391 transitions. [2019-12-27 18:14:35,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:35,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:14:35,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:35,476 INFO L225 Difference]: With dead ends: 36088 [2019-12-27 18:14:35,476 INFO L226 Difference]: Without dead ends: 36088 [2019-12-27 18:14:35,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:35,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36088 states. [2019-12-27 18:14:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36088 to 36088. [2019-12-27 18:14:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36088 states. [2019-12-27 18:14:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36088 states to 36088 states and 117391 transitions. [2019-12-27 18:14:40,938 INFO L78 Accepts]: Start accepts. Automaton has 36088 states and 117391 transitions. Word has length 13 [2019-12-27 18:14:40,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:40,938 INFO L462 AbstractCegarLoop]: Abstraction has 36088 states and 117391 transitions. [2019-12-27 18:14:40,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 36088 states and 117391 transitions. [2019-12-27 18:14:40,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:14:40,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:40,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:40,942 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:40,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:40,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1539749953, now seen corresponding path program 1 times [2019-12-27 18:14:40,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:40,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090741545] [2019-12-27 18:14:40,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:41,070 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 18:14:41,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090741545] [2019-12-27 18:14:41,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:41,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:14:41,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1978183446] [2019-12-27 18:14:41,071 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:41,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:41,077 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 29 transitions. [2019-12-27 18:14:41,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:41,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:41,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:14:41,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:14:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:14:41,080 INFO L87 Difference]: Start difference. First operand 36088 states and 117391 transitions. Second operand 6 states. [2019-12-27 18:14:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:42,062 INFO L93 Difference]: Finished difference Result 50098 states and 158333 transitions. [2019-12-27 18:14:42,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 18:14:42,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 18:14:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:42,139 INFO L225 Difference]: With dead ends: 50098 [2019-12-27 18:14:42,139 INFO L226 Difference]: Without dead ends: 50091 [2019-12-27 18:14:42,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:14:42,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50091 states. [2019-12-27 18:14:43,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50091 to 36331. [2019-12-27 18:14:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36331 states. [2019-12-27 18:14:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36331 states to 36331 states and 118099 transitions. [2019-12-27 18:14:43,140 INFO L78 Accepts]: Start accepts. Automaton has 36331 states and 118099 transitions. Word has length 19 [2019-12-27 18:14:43,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:43,140 INFO L462 AbstractCegarLoop]: Abstraction has 36331 states and 118099 transitions. [2019-12-27 18:14:43,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:14:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 36331 states and 118099 transitions. [2019-12-27 18:14:43,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:14:43,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:43,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:43,151 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:43,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:43,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1843003519, now seen corresponding path program 2 times [2019-12-27 18:14:43,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:43,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380478622] [2019-12-27 18:14:43,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:43,221 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 18:14:43,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380478622] [2019-12-27 18:14:43,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:43,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:43,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [150199780] [2019-12-27 18:14:43,224 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:43,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:43,229 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 18:14:43,229 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:43,230 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:43,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:14:43,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:14:43,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:43,231 INFO L87 Difference]: Start difference. First operand 36331 states and 118099 transitions. Second operand 5 states. [2019-12-27 18:14:43,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:43,939 INFO L93 Difference]: Finished difference Result 46087 states and 147024 transitions. [2019-12-27 18:14:43,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:14:43,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:14:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:44,012 INFO L225 Difference]: With dead ends: 46087 [2019-12-27 18:14:44,012 INFO L226 Difference]: Without dead ends: 46080 [2019-12-27 18:14:44,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 18:14:44,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46080 states. [2019-12-27 18:14:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46080 to 36431. [2019-12-27 18:14:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36431 states. [2019-12-27 18:14:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36431 states to 36431 states and 118357 transitions. [2019-12-27 18:14:45,202 INFO L78 Accepts]: Start accepts. Automaton has 36431 states and 118357 transitions. Word has length 19 [2019-12-27 18:14:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:45,203 INFO L462 AbstractCegarLoop]: Abstraction has 36431 states and 118357 transitions. [2019-12-27 18:14:45,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:14:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 36431 states and 118357 transitions. [2019-12-27 18:14:45,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:14:45,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:45,212 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 18:14:45,213 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:45,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:45,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1129453691, now seen corresponding path program 1 times [2019-12-27 18:14:45,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:45,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626676339] [2019-12-27 18:14:45,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:45,283 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 18:14:45,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626676339] [2019-12-27 18:14:45,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:45,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:45,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [861276939] [2019-12-27 18:14:45,284 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:45,289 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:45,294 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:14:45,295 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:45,295 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:45,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:14:45,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:45,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:14:45,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:14:45,296 INFO L87 Difference]: Start difference. First operand 36431 states and 118357 transitions. Second operand 4 states. [2019-12-27 18:14:45,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:45,329 INFO L93 Difference]: Finished difference Result 7050 states and 19283 transitions. [2019-12-27 18:14:45,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:14:45,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:14:45,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:45,337 INFO L225 Difference]: With dead ends: 7050 [2019-12-27 18:14:45,337 INFO L226 Difference]: Without dead ends: 7050 [2019-12-27 18:14:45,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:14:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-12-27 18:14:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6938. [2019-12-27 18:14:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6938 states. [2019-12-27 18:14:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 18963 transitions. [2019-12-27 18:14:45,424 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 18963 transitions. Word has length 25 [2019-12-27 18:14:45,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:45,425 INFO L462 AbstractCegarLoop]: Abstraction has 6938 states and 18963 transitions. [2019-12-27 18:14:45,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:14:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 18963 transitions. [2019-12-27 18:14:45,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:14:45,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:45,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:45,435 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:45,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1811341367, now seen corresponding path program 1 times [2019-12-27 18:14:45,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:45,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446970073] [2019-12-27 18:14:45,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:45,516 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 18:14:45,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446970073] [2019-12-27 18:14:45,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:45,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:14:45,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [887225552] [2019-12-27 18:14:45,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:45,526 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:45,558 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 107 transitions. [2019-12-27 18:14:45,558 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:45,562 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:14:45,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:14:45,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:45,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:14:45,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:45,563 INFO L87 Difference]: Start difference. First operand 6938 states and 18963 transitions. Second operand 5 states. [2019-12-27 18:14:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:45,602 INFO L93 Difference]: Finished difference Result 5023 states and 14421 transitions. [2019-12-27 18:14:45,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:14:45,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 18:14:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:45,611 INFO L225 Difference]: With dead ends: 5023 [2019-12-27 18:14:45,612 INFO L226 Difference]: Without dead ends: 5023 [2019-12-27 18:14:45,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:45,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2019-12-27 18:14:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4659. [2019-12-27 18:14:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-12-27 18:14:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 13437 transitions. [2019-12-27 18:14:45,679 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 13437 transitions. Word has length 37 [2019-12-27 18:14:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:45,680 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 13437 transitions. [2019-12-27 18:14:45,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:14:45,680 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 13437 transitions. [2019-12-27 18:14:45,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:45,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:45,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:45,688 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:45,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:45,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1876753934, now seen corresponding path program 1 times [2019-12-27 18:14:45,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:45,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839302789] [2019-12-27 18:14:45,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:45,763 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 18:14:45,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839302789] [2019-12-27 18:14:45,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:45,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:45,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [129944501] [2019-12-27 18:14:45,765 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:45,785 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:45,938 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 445 transitions. [2019-12-27 18:14:45,938 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:45,940 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:45,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:45,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:45,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:45,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:45,941 INFO L87 Difference]: Start difference. First operand 4659 states and 13437 transitions. Second operand 3 states. [2019-12-27 18:14:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:45,998 INFO L93 Difference]: Finished difference Result 4668 states and 13449 transitions. [2019-12-27 18:14:45,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:45,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:14:45,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:46,007 INFO L225 Difference]: With dead ends: 4668 [2019-12-27 18:14:46,008 INFO L226 Difference]: Without dead ends: 4668 [2019-12-27 18:14:46,008 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 18:14:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-27 18:14:46,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-27 18:14:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-27 18:14:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13445 transitions. [2019-12-27 18:14:46,067 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13445 transitions. Word has length 65 [2019-12-27 18:14:46,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:46,067 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13445 transitions. [2019-12-27 18:14:46,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:46,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13445 transitions. [2019-12-27 18:14:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:46,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:46,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:46,074 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:46,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1173172274, now seen corresponding path program 1 times [2019-12-27 18:14:46,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:46,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830694858] [2019-12-27 18:14:46,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:46,145 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 18:14:46,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830694858] [2019-12-27 18:14:46,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:46,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:46,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2032380591] [2019-12-27 18:14:46,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:46,166 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:46,305 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 445 transitions. [2019-12-27 18:14:46,305 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:46,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:46,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:46,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:46,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:46,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:46,308 INFO L87 Difference]: Start difference. First operand 4664 states and 13445 transitions. Second operand 3 states. [2019-12-27 18:14:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:46,357 INFO L93 Difference]: Finished difference Result 4668 states and 13441 transitions. [2019-12-27 18:14:46,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:46,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:14:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:46,367 INFO L225 Difference]: With dead ends: 4668 [2019-12-27 18:14:46,367 INFO L226 Difference]: Without dead ends: 4668 [2019-12-27 18:14:46,368 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 18:14:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-27 18:14:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-27 18:14:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-27 18:14:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13437 transitions. [2019-12-27 18:14:46,504 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13437 transitions. Word has length 65 [2019-12-27 18:14:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:46,504 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13437 transitions. [2019-12-27 18:14:46,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13437 transitions. [2019-12-27 18:14:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:46,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:46,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:46,514 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:46,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:46,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1163492121, now seen corresponding path program 1 times [2019-12-27 18:14:46,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:46,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628462963] [2019-12-27 18:14:46,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:46,612 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 18:14:46,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628462963] [2019-12-27 18:14:46,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:46,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:14:46,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [145477248] [2019-12-27 18:14:46,613 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:46,633 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:46,835 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 445 transitions. [2019-12-27 18:14:46,835 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:47,062 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:14:47,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:14:47,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:47,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:14:47,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:14:47,063 INFO L87 Difference]: Start difference. First operand 4664 states and 13437 transitions. Second operand 10 states. [2019-12-27 18:14:47,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:47,678 INFO L93 Difference]: Finished difference Result 7088 states and 20226 transitions. [2019-12-27 18:14:47,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:14:47,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 18:14:47,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:47,687 INFO L225 Difference]: With dead ends: 7088 [2019-12-27 18:14:47,688 INFO L226 Difference]: Without dead ends: 7088 [2019-12-27 18:14:47,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:14:47,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-27 18:14:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 5979. [2019-12-27 18:14:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5979 states. [2019-12-27 18:14:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 17231 transitions. [2019-12-27 18:14:47,779 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 17231 transitions. Word has length 65 [2019-12-27 18:14:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:47,779 INFO L462 AbstractCegarLoop]: Abstraction has 5979 states and 17231 transitions. [2019-12-27 18:14:47,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:14:47,779 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 17231 transitions. [2019-12-27 18:14:47,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:47,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:47,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:47,787 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:47,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:47,788 INFO L82 PathProgramCache]: Analyzing trace with hash -2061317327, now seen corresponding path program 2 times [2019-12-27 18:14:47,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:47,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850210564] [2019-12-27 18:14:47,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:47,904 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 18:14:47,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850210564] [2019-12-27 18:14:47,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:47,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:14:47,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [996269026] [2019-12-27 18:14:47,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:47,932 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:48,119 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 448 transitions. [2019-12-27 18:14:48,119 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:48,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 18:14:48,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:14:48,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:48,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:14:48,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:48,173 INFO L87 Difference]: Start difference. First operand 5979 states and 17231 transitions. Second operand 5 states. [2019-12-27 18:14:48,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:48,509 INFO L93 Difference]: Finished difference Result 9067 states and 25836 transitions. [2019-12-27 18:14:48,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:14:48,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 18:14:48,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:48,520 INFO L225 Difference]: With dead ends: 9067 [2019-12-27 18:14:48,520 INFO L226 Difference]: Without dead ends: 9067 [2019-12-27 18:14:48,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:14:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9067 states. [2019-12-27 18:14:48,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9067 to 6731. [2019-12-27 18:14:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6731 states. [2019-12-27 18:14:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6731 states to 6731 states and 19498 transitions. [2019-12-27 18:14:48,620 INFO L78 Accepts]: Start accepts. Automaton has 6731 states and 19498 transitions. Word has length 65 [2019-12-27 18:14:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:48,620 INFO L462 AbstractCegarLoop]: Abstraction has 6731 states and 19498 transitions. [2019-12-27 18:14:48,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:14:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 6731 states and 19498 transitions. [2019-12-27 18:14:48,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:48,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:48,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:48,629 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:48,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1650424373, now seen corresponding path program 3 times [2019-12-27 18:14:48,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:48,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211702024] [2019-12-27 18:14:48,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:48,715 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 18:14:48,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211702024] [2019-12-27 18:14:48,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:48,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:14:48,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911411038] [2019-12-27 18:14:48,716 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:48,735 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:48,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 364 transitions. [2019-12-27 18:14:48,960 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:49,093 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:14:49,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:14:49,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:49,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:14:49,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:14:49,095 INFO L87 Difference]: Start difference. First operand 6731 states and 19498 transitions. Second operand 11 states. [2019-12-27 18:14:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:50,787 INFO L93 Difference]: Finished difference Result 16480 states and 46651 transitions. [2019-12-27 18:14:50,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 18:14:50,788 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 18:14:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:50,810 INFO L225 Difference]: With dead ends: 16480 [2019-12-27 18:14:50,810 INFO L226 Difference]: Without dead ends: 16480 [2019-12-27 18:14:50,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:14:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16480 states. [2019-12-27 18:14:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16480 to 7280. [2019-12-27 18:14:50,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7280 states. [2019-12-27 18:14:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7280 states to 7280 states and 21177 transitions. [2019-12-27 18:14:50,978 INFO L78 Accepts]: Start accepts. Automaton has 7280 states and 21177 transitions. Word has length 65 [2019-12-27 18:14:50,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:50,978 INFO L462 AbstractCegarLoop]: Abstraction has 7280 states and 21177 transitions. [2019-12-27 18:14:50,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:14:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 7280 states and 21177 transitions. [2019-12-27 18:14:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:50,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:50,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:50,988 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:50,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:50,988 INFO L82 PathProgramCache]: Analyzing trace with hash 2063456247, now seen corresponding path program 4 times [2019-12-27 18:14:50,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:50,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654652238] [2019-12-27 18:14:50,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:51,083 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 18:14:51,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654652238] [2019-12-27 18:14:51,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:51,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:51,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1241313830] [2019-12-27 18:14:51,084 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:51,117 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:51,274 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 438 transitions. [2019-12-27 18:14:51,274 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:51,275 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:51,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:51,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:51,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:51,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:51,276 INFO L87 Difference]: Start difference. First operand 7280 states and 21177 transitions. Second operand 3 states. [2019-12-27 18:14:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:51,332 INFO L93 Difference]: Finished difference Result 7280 states and 21176 transitions. [2019-12-27 18:14:51,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:51,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:14:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:51,343 INFO L225 Difference]: With dead ends: 7280 [2019-12-27 18:14:51,343 INFO L226 Difference]: Without dead ends: 7280 [2019-12-27 18:14:51,343 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 18:14:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7280 states. [2019-12-27 18:14:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7280 to 4655. [2019-12-27 18:14:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4655 states. [2019-12-27 18:14:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4655 states to 4655 states and 13797 transitions. [2019-12-27 18:14:51,422 INFO L78 Accepts]: Start accepts. Automaton has 4655 states and 13797 transitions. Word has length 65 [2019-12-27 18:14:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:51,423 INFO L462 AbstractCegarLoop]: Abstraction has 4655 states and 13797 transitions. [2019-12-27 18:14:51,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 4655 states and 13797 transitions. [2019-12-27 18:14:51,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:14:51,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:51,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:51,429 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:51,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:51,430 INFO L82 PathProgramCache]: Analyzing trace with hash -68576263, now seen corresponding path program 1 times [2019-12-27 18:14:51,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:51,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459123610] [2019-12-27 18:14:51,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:51,490 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 18:14:51,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459123610] [2019-12-27 18:14:51,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:51,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:51,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [817466943] [2019-12-27 18:14:51,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:51,549 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:51,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 449 transitions. [2019-12-27 18:14:51,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:51,750 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:14:51,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:14:51,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:51,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:14:51,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:51,751 INFO L87 Difference]: Start difference. First operand 4655 states and 13797 transitions. Second operand 5 states. [2019-12-27 18:14:51,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:51,958 INFO L93 Difference]: Finished difference Result 5651 states and 16119 transitions. [2019-12-27 18:14:51,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:14:51,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 18:14:51,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:51,970 INFO L225 Difference]: With dead ends: 5651 [2019-12-27 18:14:51,970 INFO L226 Difference]: Without dead ends: 5651 [2019-12-27 18:14:51,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 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 18:14:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2019-12-27 18:14:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 3559. [2019-12-27 18:14:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3559 states. [2019-12-27 18:14:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 10346 transitions. [2019-12-27 18:14:52,060 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 10346 transitions. Word has length 66 [2019-12-27 18:14:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:52,061 INFO L462 AbstractCegarLoop]: Abstraction has 3559 states and 10346 transitions. [2019-12-27 18:14:52,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:14:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 10346 transitions. [2019-12-27 18:14:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:14:52,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:52,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:52,069 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:52,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:52,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1891252769, now seen corresponding path program 1 times [2019-12-27 18:14:52,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:52,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784211326] [2019-12-27 18:14:52,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:52,186 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 18:14:52,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784211326] [2019-12-27 18:14:52,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:52,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:14:52,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2120661456] [2019-12-27 18:14:52,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:52,206 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:52,352 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 416 transitions. [2019-12-27 18:14:52,352 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:52,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:14:52,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:14:52,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:52,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:14:52,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:14:52,503 INFO L87 Difference]: Start difference. First operand 3559 states and 10346 transitions. Second operand 11 states. [2019-12-27 18:14:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:53,323 INFO L93 Difference]: Finished difference Result 6089 states and 17305 transitions. [2019-12-27 18:14:53,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 18:14:53,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 18:14:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:53,333 INFO L225 Difference]: With dead ends: 6089 [2019-12-27 18:14:53,333 INFO L226 Difference]: Without dead ends: 6089 [2019-12-27 18:14:53,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:14:53,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6089 states. [2019-12-27 18:14:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6089 to 3559. [2019-12-27 18:14:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3559 states. [2019-12-27 18:14:53,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 10346 transitions. [2019-12-27 18:14:53,395 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 10346 transitions. Word has length 67 [2019-12-27 18:14:53,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:53,395 INFO L462 AbstractCegarLoop]: Abstraction has 3559 states and 10346 transitions. [2019-12-27 18:14:53,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:14:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 10346 transitions. [2019-12-27 18:14:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:14:53,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:53,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:53,400 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1781723931, now seen corresponding path program 2 times [2019-12-27 18:14:53,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:53,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754815978] [2019-12-27 18:14:53,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:53,466 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 18:14:53,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754815978] [2019-12-27 18:14:53,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:53,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:53,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1937707097] [2019-12-27 18:14:53,467 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:53,487 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:53,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 240 states and 455 transitions. [2019-12-27 18:14:53,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:53,743 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:14:53,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:53,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:53,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:53,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:53,744 INFO L87 Difference]: Start difference. First operand 3559 states and 10346 transitions. Second operand 3 states. [2019-12-27 18:14:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:53,765 INFO L93 Difference]: Finished difference Result 3383 states and 9557 transitions. [2019-12-27 18:14:53,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:53,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 18:14:53,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:53,769 INFO L225 Difference]: With dead ends: 3383 [2019-12-27 18:14:53,769 INFO L226 Difference]: Without dead ends: 3383 [2019-12-27 18:14:53,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 18:14:53,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2019-12-27 18:14:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 2987. [2019-12-27 18:14:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2987 states. [2019-12-27 18:14:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 8451 transitions. [2019-12-27 18:14:53,810 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 8451 transitions. Word has length 67 [2019-12-27 18:14:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:53,810 INFO L462 AbstractCegarLoop]: Abstraction has 2987 states and 8451 transitions. [2019-12-27 18:14:53,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:53,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 8451 transitions. [2019-12-27 18:14:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:14:53,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:53,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:53,816 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:53,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:53,816 INFO L82 PathProgramCache]: Analyzing trace with hash 823194101, now seen corresponding path program 1 times [2019-12-27 18:14:53,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:53,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890133730] [2019-12-27 18:14:53,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:53,921 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 18:14:53,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890133730] [2019-12-27 18:14:53,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:53,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:14:53,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2021285388] [2019-12-27 18:14:53,924 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:53,944 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:54,173 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 435 transitions. [2019-12-27 18:14:54,174 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:54,199 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:14:54,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:14:54,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:54,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:14:54,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:14:54,201 INFO L87 Difference]: Start difference. First operand 2987 states and 8451 transitions. Second operand 6 states. [2019-12-27 18:14:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:54,302 INFO L93 Difference]: Finished difference Result 5218 states and 14722 transitions. [2019-12-27 18:14:54,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:14:54,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 18:14:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:54,308 INFO L225 Difference]: With dead ends: 5218 [2019-12-27 18:14:54,308 INFO L226 Difference]: Without dead ends: 2815 [2019-12-27 18:14:54,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:14:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2019-12-27 18:14:54,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2815. [2019-12-27 18:14:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2019-12-27 18:14:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 7936 transitions. [2019-12-27 18:14:54,398 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 7936 transitions. Word has length 68 [2019-12-27 18:14:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:54,398 INFO L462 AbstractCegarLoop]: Abstraction has 2815 states and 7936 transitions. [2019-12-27 18:14:54,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:14:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 7936 transitions. [2019-12-27 18:14:54,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:14:54,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:54,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:54,405 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:54,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:54,406 INFO L82 PathProgramCache]: Analyzing trace with hash -829052917, now seen corresponding path program 2 times [2019-12-27 18:14:54,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:54,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862553629] [2019-12-27 18:14:54,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:54,885 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 18:14:54,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862553629] [2019-12-27 18:14:54,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:54,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:14:54,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1218810443] [2019-12-27 18:14:54,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:54,926 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:55,145 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 421 transitions. [2019-12-27 18:14:55,146 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:55,294 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 18:14:55,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:14:55,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:55,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:14:55,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:14:55,296 INFO L87 Difference]: Start difference. First operand 2815 states and 7936 transitions. Second operand 17 states. [2019-12-27 18:14:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:56,623 INFO L93 Difference]: Finished difference Result 5776 states and 16136 transitions. [2019-12-27 18:14:56,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 18:14:56,624 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-12-27 18:14:56,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:56,632 INFO L225 Difference]: With dead ends: 5776 [2019-12-27 18:14:56,632 INFO L226 Difference]: Without dead ends: 5746 [2019-12-27 18:14:56,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=359, Invalid=1281, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 18:14:56,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5746 states. [2019-12-27 18:14:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5746 to 4139. [2019-12-27 18:14:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4139 states. [2019-12-27 18:14:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 11571 transitions. [2019-12-27 18:14:56,723 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 11571 transitions. Word has length 68 [2019-12-27 18:14:56,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:56,723 INFO L462 AbstractCegarLoop]: Abstraction has 4139 states and 11571 transitions. [2019-12-27 18:14:56,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:14:56,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 11571 transitions. [2019-12-27 18:14:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:14:56,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:56,730 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:56,730 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:56,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:56,730 INFO L82 PathProgramCache]: Analyzing trace with hash 226058755, now seen corresponding path program 3 times [2019-12-27 18:14:56,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:56,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489981198] [2019-12-27 18:14:56,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:56,955 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 18:14:56,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489981198] [2019-12-27 18:14:56,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:56,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:14:56,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [989155203] [2019-12-27 18:14:56,956 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:56,980 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:57,226 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 531 transitions. [2019-12-27 18:14:57,227 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:57,342 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:14:57,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:14:57,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:14:57,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:14:57,344 INFO L87 Difference]: Start difference. First operand 4139 states and 11571 transitions. Second operand 13 states. [2019-12-27 18:14:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:57,748 INFO L93 Difference]: Finished difference Result 6472 states and 17992 transitions. [2019-12-27 18:14:57,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 18:14:57,748 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-27 18:14:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:57,757 INFO L225 Difference]: With dead ends: 6472 [2019-12-27 18:14:57,757 INFO L226 Difference]: Without dead ends: 6442 [2019-12-27 18:14:57,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:14:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6442 states. [2019-12-27 18:14:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6442 to 4466. [2019-12-27 18:14:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4466 states. [2019-12-27 18:14:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 12510 transitions. [2019-12-27 18:14:57,836 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 12510 transitions. Word has length 68 [2019-12-27 18:14:57,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:57,836 INFO L462 AbstractCegarLoop]: Abstraction has 4466 states and 12510 transitions. [2019-12-27 18:14:57,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:14:57,836 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 12510 transitions. [2019-12-27 18:14:57,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:14:57,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:57,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:57,840 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:57,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:57,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1101405001, now seen corresponding path program 4 times [2019-12-27 18:14:57,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:57,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990928621] [2019-12-27 18:14:57,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:58,124 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 18:14:58,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990928621] [2019-12-27 18:14:58,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:58,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:14:58,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [542297383] [2019-12-27 18:14:58,126 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:58,168 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:58,425 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 256 states and 497 transitions. [2019-12-27 18:14:58,425 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:58,799 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 18:14:58,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 18:14:58,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:58,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 18:14:58,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:14:58,802 INFO L87 Difference]: Start difference. First operand 4466 states and 12510 transitions. Second operand 19 states. [2019-12-27 18:15:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:15:00,065 INFO L93 Difference]: Finished difference Result 5491 states and 15200 transitions. [2019-12-27 18:15:00,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 18:15:00,066 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-27 18:15:00,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:15:00,074 INFO L225 Difference]: With dead ends: 5491 [2019-12-27 18:15:00,075 INFO L226 Difference]: Without dead ends: 5461 [2019-12-27 18:15:00,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=365, Invalid=1275, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 18:15:00,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5461 states. [2019-12-27 18:15:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5461 to 4067. [2019-12-27 18:15:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4067 states. [2019-12-27 18:15:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4067 states to 4067 states and 11322 transitions. [2019-12-27 18:15:00,138 INFO L78 Accepts]: Start accepts. Automaton has 4067 states and 11322 transitions. Word has length 68 [2019-12-27 18:15:00,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:15:00,138 INFO L462 AbstractCegarLoop]: Abstraction has 4067 states and 11322 transitions. [2019-12-27 18:15:00,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 18:15:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4067 states and 11322 transitions. [2019-12-27 18:15:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:15:00,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:15:00,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:15:00,143 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:15:00,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:15:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1851838847, now seen corresponding path program 5 times [2019-12-27 18:15:00,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:15:00,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110404203] [2019-12-27 18:15:00,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:15:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:15:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:15:00,255 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:15:00,255 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:15:00,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2040~0.base_21|) (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~z$flush_delayed~0_34) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2040~0.base_21| 4)) (= v_~z$r_buff1_thd0~0_308 0) (= v_~z$w_buff1_used~0_516 0) (= v_~z$r_buff1_thd1~0_190 0) (= v_~z$read_delayed~0_8 0) (= v_~z$w_buff0~0_342 0) (= v_~main$tmp_guard1~0_21 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_206 0) (= v_~y~0_34 0) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff0_thd3~0_140) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_226 0) (= |v_ULTIMATE.start_main_~#t2040~0.offset_17| 0) (= v_~main$tmp_guard0~0_21 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2040~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2040~0.base_21|) |v_ULTIMATE.start_main_~#t2040~0.offset_17| 0)) |v_#memory_int_21|) (= v_~weak$$choice2~0_109 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2040~0.base_21| 1)) (= v_~z$mem_tmp~0_19 0) (= v_~z$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$r_buff1_thd3~0_196) (= v_~z$r_buff0_thd2~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~z$w_buff0_used~0_875 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$w_buff1~0_249 0) (= 0 v_~x~0_138) (= v_~z~0_182 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2040~0.base_21|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_206, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_49|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ULTIMATE.start_main_~#t2041~0.offset=|v_ULTIMATE.start_main_~#t2041~0.offset_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ULTIMATE.start_main_~#t2041~0.base=|v_ULTIMATE.start_main_~#t2041~0.base_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~z$mem_tmp~0=v_~z$mem_tmp~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_516, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_52|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_190, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_140, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ULTIMATE.start_main_~#t2040~0.base=|v_ULTIMATE.start_main_~#t2040~0.base_21|, ~x~0=v_~x~0_138, ULTIMATE.start_main_~#t2042~0.offset=|v_ULTIMATE.start_main_~#t2042~0.offset_16|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~z$w_buff1~0=v_~z$w_buff1~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_121|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_308, ~y~0=v_~y~0_34, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_140, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_~#t2042~0.base=|v_ULTIMATE.start_main_~#t2042~0.base_20|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_875, ~z$w_buff0~0=v_~z$w_buff0~0_342, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_196, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t2040~0.offset=|v_ULTIMATE.start_main_~#t2040~0.offset_17|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_109, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_226} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t2041~0.offset, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2041~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2040~0.base, ~x~0, ULTIMATE.start_main_~#t2042~0.offset, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2042~0.base, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2040~0.offset, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:15:00,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L805-1-->L807: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2041~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2041~0.base_12|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2041~0.base_12|)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2041~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2041~0.base_12|) |v_ULTIMATE.start_main_~#t2041~0.offset_11| 1))) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2041~0.base_12| 4)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2041~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t2041~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2041~0.offset=|v_ULTIMATE.start_main_~#t2041~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2041~0.base=|v_ULTIMATE.start_main_~#t2041~0.base_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2041~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2041~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 18:15:00,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_226 v_~z$w_buff1_used~0_114) (= 2 v_~z$w_buff0~0_55) (= v_~z$w_buff0~0_56 v_~z$w_buff1~0_53) (= v_P0Thread1of1ForFork0_~arg.base_22 |v_P0Thread1of1ForFork0_#in~arg.base_22|) (= 0 (mod v_~z$w_buff1_used~0_114 256)) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_P0Thread1of1ForFork0_~arg.offset_22 |v_P0Thread1of1ForFork0_#in~arg.offset_22|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_~z$w_buff0_used~0_225 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_226, ~z$w_buff0~0=v_~z$w_buff0~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_225, ~z$w_buff0~0=v_~z$w_buff0~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|, ~z$w_buff1~0=v_~z$w_buff1~0_53, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_22, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_22} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 18:15:00,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2042~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2042~0.base_9| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2042~0.base_9| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2042~0.base_9|)) (not (= |v_ULTIMATE.start_main_~#t2042~0.base_9| 0)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2042~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2042~0.base_9|) |v_ULTIMATE.start_main_~#t2042~0.offset_8| 2)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t2042~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2042~0.offset=|v_ULTIMATE.start_main_~#t2042~0.offset_8|, ULTIMATE.start_main_~#t2042~0.base=|v_ULTIMATE.start_main_~#t2042~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2042~0.offset, ULTIMATE.start_main_~#t2042~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 18:15:00,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In649176392 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In649176392 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out649176392|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In649176392 |P0Thread1of1ForFork0_#t~ite5_Out649176392|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In649176392, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In649176392} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out649176392|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In649176392, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In649176392} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:15:00,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1470356930 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1470356930 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1470356930 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1470356930 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1470356930| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1470356930| ~z$w_buff1_used~0_In-1470356930) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1470356930, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1470356930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1470356930, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1470356930} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1470356930|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1470356930, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1470356930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1470356930, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1470356930} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:15:00,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1266442095 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1266442095 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out-1266442095) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In-1266442095 ~z$r_buff0_thd1~0_Out-1266442095)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1266442095, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1266442095} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1266442095, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1266442095|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1266442095} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:15:00,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1747135901 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1747135901 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1747135901 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1747135901 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In1747135901 |P0Thread1of1ForFork0_#t~ite8_Out1747135901|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1747135901|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1747135901, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1747135901, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1747135901, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1747135901} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1747135901, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1747135901|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1747135901, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1747135901, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1747135901} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:15:00,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 18:15:00,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In1214305044 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1214305044 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out1214305044| |P1Thread1of1ForFork1_#t~ite10_Out1214305044|))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out1214305044| ~z~0_In1214305044)) (and (not .cse1) (not .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out1214305044| ~z$w_buff1~0_In1214305044) .cse0))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1214305044, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1214305044, ~z$w_buff1~0=~z$w_buff1~0_In1214305044, ~z~0=~z~0_In1214305044} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1214305044|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1214305044, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1214305044, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1214305044|, ~z$w_buff1~0=~z$w_buff1~0_In1214305044, ~z~0=~z~0_In1214305044} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 18:15:00,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In2132419478 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2132419478 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out2132419478| ~z$w_buff1~0_In2132419478) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out2132419478| ~z~0_In2132419478)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2132419478, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2132419478, ~z$w_buff1~0=~z$w_buff1~0_In2132419478, ~z~0=~z~0_In2132419478} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out2132419478|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2132419478, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2132419478, ~z$w_buff1~0=~z$w_buff1~0_In2132419478, ~z~0=~z~0_In2132419478} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 18:15:00,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 18:15:00,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1814129707 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1814129707 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out1814129707|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out1814129707| ~z$w_buff0_used~0_In1814129707) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1814129707, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1814129707} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1814129707, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1814129707, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1814129707|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:15:00,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In70406599 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In70406599 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In70406599 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In70406599 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out70406599| ~z$w_buff1_used~0_In70406599) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out70406599| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In70406599, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In70406599, ~z$w_buff1_used~0=~z$w_buff1_used~0_In70406599, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In70406599} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In70406599, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In70406599, ~z$w_buff1_used~0=~z$w_buff1_used~0_In70406599, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In70406599, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out70406599|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 18:15:00,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-627772457 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-627772457 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-627772457| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-627772457| ~z$r_buff0_thd3~0_In-627772457) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-627772457, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-627772457} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-627772457, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-627772457, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-627772457|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 18:15:00,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In76809626 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In76809626 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In76809626 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In76809626 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In76809626 |P2Thread1of1ForFork2_#t~ite20_Out76809626|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out76809626|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In76809626, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In76809626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In76809626, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In76809626} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In76809626, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out76809626|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In76809626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In76809626, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In76809626} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 18:15:00,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_32| v_~z$r_buff1_thd3~0_67) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_67, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 18:15:00,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In873168286 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In873168286 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out873168286|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In873168286 |P1Thread1of1ForFork1_#t~ite11_Out873168286|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In873168286, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In873168286} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In873168286, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out873168286|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In873168286} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:15:00,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1478479464 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1478479464 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1478479464 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1478479464 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1478479464|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1478479464 |P1Thread1of1ForFork1_#t~ite12_Out1478479464|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1478479464, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1478479464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1478479464, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1478479464} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1478479464, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1478479464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1478479464, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1478479464|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1478479464} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:15:00,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1591062673 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1591062673 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out1591062673| ~z$r_buff0_thd2~0_In1591062673) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out1591062673| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1591062673, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1591062673} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1591062673, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1591062673|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1591062673} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 18:15:00,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1603632618 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1603632618 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1603632618 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1603632618 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-1603632618 |P1Thread1of1ForFork1_#t~ite14_Out-1603632618|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1603632618|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1603632618, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1603632618, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1603632618, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1603632618} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1603632618, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1603632618, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1603632618, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1603632618|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1603632618} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:15:00,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_32| v_~z$r_buff1_thd2~0_84) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_84, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:15:00,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:15:00,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-786335967 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-786335967 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite24_Out-786335967| |ULTIMATE.start_main_#t~ite25_Out-786335967|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite24_Out-786335967| ~z$w_buff1~0_In-786335967) (not .cse2)) (and (or .cse0 .cse2) .cse1 (= |ULTIMATE.start_main_#t~ite24_Out-786335967| ~z~0_In-786335967)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-786335967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-786335967, ~z$w_buff1~0=~z$w_buff1~0_In-786335967, ~z~0=~z~0_In-786335967} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-786335967, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-786335967|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-786335967, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-786335967|, ~z$w_buff1~0=~z$w_buff1~0_In-786335967, ~z~0=~z~0_In-786335967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 18:15:00,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1922051253 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1922051253 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1922051253 |ULTIMATE.start_main_#t~ite26_Out-1922051253|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-1922051253| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1922051253, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1922051253} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1922051253, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1922051253, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1922051253|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 18:15:00,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1929942259 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1929942259 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1929942259 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1929942259 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1929942259 |ULTIMATE.start_main_#t~ite27_Out-1929942259|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out-1929942259|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1929942259, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1929942259, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1929942259, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1929942259} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1929942259, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1929942259, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1929942259, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1929942259, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1929942259|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 18:15:00,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-38128549 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-38128549 256)))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out-38128549| ~z$r_buff0_thd0~0_In-38128549) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out-38128549| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-38128549, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-38128549} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-38128549, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-38128549|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-38128549} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 18:15:00,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1858504995 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1858504995 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1858504995 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1858504995 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-1858504995 |ULTIMATE.start_main_#t~ite29_Out-1858504995|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-1858504995|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1858504995, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858504995, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1858504995, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1858504995} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1858504995, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1858504995|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858504995, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1858504995, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1858504995} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 18:15:00,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (= v_~z$r_buff0_thd0~0_103 v_~z$r_buff0_thd0~0_102) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_103, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_102, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 18:15:00,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (= v_~z$mem_tmp~0_11 v_~z~0_133) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~z$flush_delayed~0_21 256))) (= 0 v_~z$flush_delayed~0_20)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_21} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_20, ~z~0=v_~z~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:15:00,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:15:00,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:15:00 BasicIcfg [2019-12-27 18:15:00,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:15:00,392 INFO L168 Benchmark]: Toolchain (without parser) took 103175.44 ms. Allocated memory was 145.2 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 99.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 18:15:00,392 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 18:15:00,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 854.77 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 156.1 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:15:00,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.36 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:15:00,394 INFO L168 Benchmark]: Boogie Preprocessor took 38.32 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:15:00,394 INFO L168 Benchmark]: RCFGBuilder took 869.57 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 100.8 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:15:00,395 INFO L168 Benchmark]: TraceAbstraction took 101334.12 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 18:15:00,398 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.17 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 854.77 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 99.5 MB in the beginning and 156.1 MB in the end (delta: -56.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.36 ms. Allocated memory is still 202.9 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.32 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 869.57 ms. Allocated memory is still 202.9 MB. Free memory was 150.8 MB in the beginning and 100.8 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 101334.12 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.8 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 30 ChoiceCompositions, 6114 VarBasedMoverChecksPositive, 254 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 255 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 86146 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2040, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2041, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L809] FCALL, FORK 0 pthread_create(&t2042, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 101.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3427 SDtfs, 4409 SDslu, 9269 SDs, 0 SdLazy, 5937 SolverSat, 363 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 86 SyntacticMatches, 50 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178183occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 50.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 98736 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1070 NumberOfCodeBlocks, 1070 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 981 ConstructedInterpolants, 0 QuantifiedInterpolants, 221001 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...