/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:42:54,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:42:54,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:42:54,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:42:54,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:42:54,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:42:54,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:42:54,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:42:54,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:42:54,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:42:54,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:42:54,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:42:54,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:42:54,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:42:54,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:42:54,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:42:54,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:42:54,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:42:54,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:42:54,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:42:54,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:42:54,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:42:54,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:42:54,253 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:42:54,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:42:54,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:42:54,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:42:54,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:42:54,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:42:54,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:42:54,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:42:54,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:42:54,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:42:54,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:42:54,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:42:54,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:42:54,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:42:54,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:42:54,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:42:54,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:42:54,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:42:54,274 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:42:54,295 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:42:54,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:42:54,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:42:54,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:42:54,297 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:42:54,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:42:54,298 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:42:54,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:42:54,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:42:54,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:42:54,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:42:54,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:42:54,299 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:42:54,299 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:42:54,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:42:54,300 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:42:54,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:42:54,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:42:54,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:42:54,300 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:42:54,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:42:54,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:42:54,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:42:54,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:42:54,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:42:54,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:42:54,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:42:54,302 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:42:54,302 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:42:54,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:42:54,303 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:42:54,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:42:54,578 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:42:54,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:42:54,594 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:42:54,595 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:42:54,595 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:42:54,596 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i [2019-12-27 21:42:54,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2f877b4/9eb5fe9f11004b7caaff4e5753369203/FLAG58658c59c [2019-12-27 21:42:55,224 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:42:55,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i [2019-12-27 21:42:55,246 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2f877b4/9eb5fe9f11004b7caaff4e5753369203/FLAG58658c59c [2019-12-27 21:42:55,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2f877b4/9eb5fe9f11004b7caaff4e5753369203 [2019-12-27 21:42:55,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:42:55,452 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:42:55,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:42:55,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:42:55,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:42:55,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:42:55" (1/1) ... [2019-12-27 21:42:55,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1e95ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:55, skipping insertion in model container [2019-12-27 21:42:55,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:42:55" (1/1) ... [2019-12-27 21:42:55,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:42:55,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:42:56,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:42:56,067 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:42:56,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:42:56,205 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:42:56,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:56 WrapperNode [2019-12-27 21:42:56,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:42:56,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:42:56,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:42:56,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:42:56,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:56" (1/1) ... [2019-12-27 21:42:56,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:56" (1/1) ... [2019-12-27 21:42:56,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:42:56,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:42:56,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:42:56,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:42:56,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:56" (1/1) ... [2019-12-27 21:42:56,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:56" (1/1) ... [2019-12-27 21:42:56,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:56" (1/1) ... [2019-12-27 21:42:56,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:56" (1/1) ... [2019-12-27 21:42:56,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:56" (1/1) ... [2019-12-27 21:42:56,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:56" (1/1) ... [2019-12-27 21:42:56,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:56" (1/1) ... [2019-12-27 21:42:56,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:42:56,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:42:56,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:42:56,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:42:56,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:56" (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 21:42:56,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:42:56,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:42:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:42:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:42:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:42:56,385 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:42:56,385 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:42:56,385 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:42:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:42:56,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:42:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:42:56,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:42:56,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:42:56,388 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 21:42:57,126 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:42:57,126 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:42:57,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:42:57 BoogieIcfgContainer [2019-12-27 21:42:57,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:42:57,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:42:57,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:42:57,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:42:57,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:42:55" (1/3) ... [2019-12-27 21:42:57,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3612fb01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:42:57, skipping insertion in model container [2019-12-27 21:42:57,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:42:56" (2/3) ... [2019-12-27 21:42:57,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3612fb01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:42:57, skipping insertion in model container [2019-12-27 21:42:57,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:42:57" (3/3) ... [2019-12-27 21:42:57,137 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_pso.opt.i [2019-12-27 21:42:57,148 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:42:57,148 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:42:57,157 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:42:57,159 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:42:57,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,204 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,204 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,206 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,207 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,216 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,216 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,217 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,217 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,217 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,229 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,231 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,231 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,235 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,235 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,238 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,238 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:42:57,258 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:42:57,304 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:42:57,304 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:42:57,305 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:42:57,309 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:42:57,309 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:42:57,309 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:42:57,309 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:42:57,315 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:42:57,341 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 21:42:57,343 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 21:42:57,460 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 21:42:57,460 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:42:57,474 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 21:42:57,491 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 21:42:57,538 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 21:42:57,539 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:42:57,545 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 21:42:57,558 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 21:42:57,559 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:43:00,690 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 21:43:00,798 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 21:43:00,826 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51676 [2019-12-27 21:43:00,826 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 21:43:00,830 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 97 transitions [2019-12-27 21:43:01,843 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18542 states. [2019-12-27 21:43:01,845 INFO L276 IsEmpty]: Start isEmpty. Operand 18542 states. [2019-12-27 21:43:01,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 21:43:01,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:01,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:01,914 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:01,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:01,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1984617832, now seen corresponding path program 1 times [2019-12-27 21:43:01,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:01,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478068555] [2019-12-27 21:43:01,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:02,178 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 21:43:02,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478068555] [2019-12-27 21:43:02,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:02,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:43:02,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2080505961] [2019-12-27 21:43:02,182 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:02,187 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:02,201 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 21:43:02,201 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:02,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:02,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:43:02,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:02,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:43:02,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:43:02,223 INFO L87 Difference]: Start difference. First operand 18542 states. Second operand 3 states. [2019-12-27 21:43:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:02,629 INFO L93 Difference]: Finished difference Result 18414 states and 69758 transitions. [2019-12-27 21:43:02,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:43:02,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 21:43:02,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:02,793 INFO L225 Difference]: With dead ends: 18414 [2019-12-27 21:43:02,793 INFO L226 Difference]: Without dead ends: 18050 [2019-12-27 21:43:02,794 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 21:43:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18050 states. [2019-12-27 21:43:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18050 to 18050. [2019-12-27 21:43:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18050 states. [2019-12-27 21:43:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18050 states to 18050 states and 68456 transitions. [2019-12-27 21:43:04,258 INFO L78 Accepts]: Start accepts. Automaton has 18050 states and 68456 transitions. Word has length 7 [2019-12-27 21:43:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:04,259 INFO L462 AbstractCegarLoop]: Abstraction has 18050 states and 68456 transitions. [2019-12-27 21:43:04,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:43:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 18050 states and 68456 transitions. [2019-12-27 21:43:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:43:04,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:04,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:04,265 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:04,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:04,266 INFO L82 PathProgramCache]: Analyzing trace with hash -975860123, now seen corresponding path program 1 times [2019-12-27 21:43:04,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:04,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342828649] [2019-12-27 21:43:04,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:04,396 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 21:43:04,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342828649] [2019-12-27 21:43:04,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:04,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:43:04,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [777564450] [2019-12-27 21:43:04,398 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:04,399 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:04,409 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 21:43:04,410 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:04,603 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:43:04,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:43:04,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:04,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:43:04,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:43:04,605 INFO L87 Difference]: Start difference. First operand 18050 states and 68456 transitions. Second operand 5 states. [2019-12-27 21:43:05,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:05,475 INFO L93 Difference]: Finished difference Result 28066 states and 102408 transitions. [2019-12-27 21:43:05,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:43:05,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 21:43:05,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:05,600 INFO L225 Difference]: With dead ends: 28066 [2019-12-27 21:43:05,600 INFO L226 Difference]: Without dead ends: 28052 [2019-12-27 21:43:05,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:43:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28052 states. [2019-12-27 21:43:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28052 to 25418. [2019-12-27 21:43:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25418 states. [2019-12-27 21:43:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25418 states to 25418 states and 94124 transitions. [2019-12-27 21:43:08,160 INFO L78 Accepts]: Start accepts. Automaton has 25418 states and 94124 transitions. Word has length 13 [2019-12-27 21:43:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:08,160 INFO L462 AbstractCegarLoop]: Abstraction has 25418 states and 94124 transitions. [2019-12-27 21:43:08,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:43:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 25418 states and 94124 transitions. [2019-12-27 21:43:08,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:43:08,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:08,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:08,163 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:08,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:08,164 INFO L82 PathProgramCache]: Analyzing trace with hash -595379205, now seen corresponding path program 1 times [2019-12-27 21:43:08,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:08,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738048140] [2019-12-27 21:43:08,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:08,234 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 21:43:08,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738048140] [2019-12-27 21:43:08,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:08,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:43:08,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [426260527] [2019-12-27 21:43:08,235 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:08,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:08,238 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:43:08,238 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:08,239 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:08,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:43:08,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:08,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:43:08,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:43:08,240 INFO L87 Difference]: Start difference. First operand 25418 states and 94124 transitions. Second operand 3 states. [2019-12-27 21:43:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:08,316 INFO L93 Difference]: Finished difference Result 14452 states and 46370 transitions. [2019-12-27 21:43:08,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:43:08,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:43:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:08,364 INFO L225 Difference]: With dead ends: 14452 [2019-12-27 21:43:08,364 INFO L226 Difference]: Without dead ends: 14452 [2019-12-27 21:43:08,364 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 21:43:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14452 states. [2019-12-27 21:43:08,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14452 to 14452. [2019-12-27 21:43:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14452 states. [2019-12-27 21:43:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 46370 transitions. [2019-12-27 21:43:08,802 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 46370 transitions. Word has length 13 [2019-12-27 21:43:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:08,803 INFO L462 AbstractCegarLoop]: Abstraction has 14452 states and 46370 transitions. [2019-12-27 21:43:08,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:43:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 46370 transitions. [2019-12-27 21:43:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:43:08,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:08,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:08,805 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:08,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:08,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1512112924, now seen corresponding path program 1 times [2019-12-27 21:43:08,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:08,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833500101] [2019-12-27 21:43:08,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:08,848 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 21:43:08,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833500101] [2019-12-27 21:43:08,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:08,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:43:08,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [949100329] [2019-12-27 21:43:08,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:08,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:08,853 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 21:43:08,853 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:08,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:43:08,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:43:08,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:08,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:43:08,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:43:08,923 INFO L87 Difference]: Start difference. First operand 14452 states and 46370 transitions. Second operand 6 states. [2019-12-27 21:43:08,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:08,965 INFO L93 Difference]: Finished difference Result 2114 states and 4969 transitions. [2019-12-27 21:43:08,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:43:08,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-27 21:43:08,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:08,971 INFO L225 Difference]: With dead ends: 2114 [2019-12-27 21:43:08,972 INFO L226 Difference]: Without dead ends: 2114 [2019-12-27 21:43:08,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:43:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-12-27 21:43:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2019-12-27 21:43:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-12-27 21:43:09,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 4969 transitions. [2019-12-27 21:43:09,010 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 4969 transitions. Word has length 14 [2019-12-27 21:43:09,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:09,010 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 4969 transitions. [2019-12-27 21:43:09,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:43:09,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 4969 transitions. [2019-12-27 21:43:09,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:43:09,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:09,013 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] [2019-12-27 21:43:09,013 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:09,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:09,015 INFO L82 PathProgramCache]: Analyzing trace with hash 107168072, now seen corresponding path program 1 times [2019-12-27 21:43:09,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:09,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019762497] [2019-12-27 21:43:09,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:09,094 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 21:43:09,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019762497] [2019-12-27 21:43:09,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:09,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:43:09,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1729711086] [2019-12-27 21:43:09,095 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:09,101 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:09,112 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 78 transitions. [2019-12-27 21:43:09,112 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:09,303 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-27 21:43:09,304 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:43:09,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:43:09,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:09,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:43:09,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:43:09,305 INFO L87 Difference]: Start difference. First operand 2114 states and 4969 transitions. Second operand 7 states. [2019-12-27 21:43:09,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:09,352 INFO L93 Difference]: Finished difference Result 699 states and 1627 transitions. [2019-12-27 21:43:09,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:43:09,352 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-27 21:43:09,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:09,354 INFO L225 Difference]: With dead ends: 699 [2019-12-27 21:43:09,354 INFO L226 Difference]: Without dead ends: 655 [2019-12-27 21:43:09,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:43:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-12-27 21:43:09,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 599. [2019-12-27 21:43:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-27 21:43:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1405 transitions. [2019-12-27 21:43:09,368 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1405 transitions. Word has length 26 [2019-12-27 21:43:09,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:09,369 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1405 transitions. [2019-12-27 21:43:09,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:43:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1405 transitions. [2019-12-27 21:43:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:43:09,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:09,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:09,374 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:09,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:09,375 INFO L82 PathProgramCache]: Analyzing trace with hash 523730057, now seen corresponding path program 1 times [2019-12-27 21:43:09,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:09,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618258260] [2019-12-27 21:43:09,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:09,510 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 21:43:09,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618258260] [2019-12-27 21:43:09,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:09,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:43:09,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2007149587] [2019-12-27 21:43:09,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:09,529 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:09,578 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 116 transitions. [2019-12-27 21:43:09,578 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:09,578 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:09,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:43:09,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:09,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:43:09,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:43:09,580 INFO L87 Difference]: Start difference. First operand 599 states and 1405 transitions. Second operand 3 states. [2019-12-27 21:43:09,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:09,625 INFO L93 Difference]: Finished difference Result 609 states and 1420 transitions. [2019-12-27 21:43:09,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:43:09,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 21:43:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:09,630 INFO L225 Difference]: With dead ends: 609 [2019-12-27 21:43:09,631 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 21:43:09,631 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 21:43:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 21:43:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-27 21:43:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 21:43:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1416 transitions. [2019-12-27 21:43:09,642 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1416 transitions. Word has length 55 [2019-12-27 21:43:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:09,643 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1416 transitions. [2019-12-27 21:43:09,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:43:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1416 transitions. [2019-12-27 21:43:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:43:09,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:09,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:09,645 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:09,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:09,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1466894421, now seen corresponding path program 1 times [2019-12-27 21:43:09,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:09,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789045400] [2019-12-27 21:43:09,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:43:09,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789045400] [2019-12-27 21:43:09,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:09,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:43:09,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [918424907] [2019-12-27 21:43:09,808 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:09,835 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:09,897 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 116 transitions. [2019-12-27 21:43:09,897 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:09,900 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:43:09,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:43:09,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:09,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:43:09,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:43:09,901 INFO L87 Difference]: Start difference. First operand 605 states and 1416 transitions. Second operand 5 states. [2019-12-27 21:43:10,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:10,155 INFO L93 Difference]: Finished difference Result 894 states and 2088 transitions. [2019-12-27 21:43:10,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:43:10,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 21:43:10,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:10,159 INFO L225 Difference]: With dead ends: 894 [2019-12-27 21:43:10,160 INFO L226 Difference]: Without dead ends: 894 [2019-12-27 21:43:10,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:43:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-27 21:43:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-27 21:43:10,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-27 21:43:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1697 transitions. [2019-12-27 21:43:10,172 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1697 transitions. Word has length 55 [2019-12-27 21:43:10,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:10,173 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1697 transitions. [2019-12-27 21:43:10,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:43:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1697 transitions. [2019-12-27 21:43:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:43:10,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:10,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:10,175 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:10,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:10,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1931223363, now seen corresponding path program 2 times [2019-12-27 21:43:10,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:10,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6843936] [2019-12-27 21:43:10,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:10,280 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 21:43:10,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6843936] [2019-12-27 21:43:10,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:10,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:43:10,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1533187901] [2019-12-27 21:43:10,281 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:10,298 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:10,454 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 112 transitions. [2019-12-27 21:43:10,454 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:10,554 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:43:10,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:43:10,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:10,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:43:10,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:43:10,555 INFO L87 Difference]: Start difference. First operand 719 states and 1697 transitions. Second operand 10 states. [2019-12-27 21:43:11,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:11,780 INFO L93 Difference]: Finished difference Result 1624 states and 3628 transitions. [2019-12-27 21:43:11,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 21:43:11,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 21:43:11,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:11,785 INFO L225 Difference]: With dead ends: 1624 [2019-12-27 21:43:11,785 INFO L226 Difference]: Without dead ends: 1624 [2019-12-27 21:43:11,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:43:11,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-12-27 21:43:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 761. [2019-12-27 21:43:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-12-27 21:43:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1800 transitions. [2019-12-27 21:43:11,803 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1800 transitions. Word has length 55 [2019-12-27 21:43:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:11,804 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1800 transitions. [2019-12-27 21:43:11,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:43:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1800 transitions. [2019-12-27 21:43:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 21:43:11,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:11,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:11,807 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:11,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:11,807 INFO L82 PathProgramCache]: Analyzing trace with hash 891728533, now seen corresponding path program 3 times [2019-12-27 21:43:11,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:11,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109007739] [2019-12-27 21:43:11,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:11,916 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 21:43:11,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109007739] [2019-12-27 21:43:11,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:11,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:43:11,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1514303315] [2019-12-27 21:43:11,918 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:11,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:11,976 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 106 transitions. [2019-12-27 21:43:11,976 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:11,976 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:43:11,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:43:11,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:11,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:43:11,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:43:11,978 INFO L87 Difference]: Start difference. First operand 761 states and 1800 transitions. Second operand 3 states. [2019-12-27 21:43:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:12,027 INFO L93 Difference]: Finished difference Result 760 states and 1798 transitions. [2019-12-27 21:43:12,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:43:12,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 21:43:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:12,032 INFO L225 Difference]: With dead ends: 760 [2019-12-27 21:43:12,032 INFO L226 Difference]: Without dead ends: 760 [2019-12-27 21:43:12,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:43:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-12-27 21:43:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 539. [2019-12-27 21:43:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-12-27 21:43:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 1284 transitions. [2019-12-27 21:43:12,042 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 1284 transitions. Word has length 55 [2019-12-27 21:43:12,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:12,043 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 1284 transitions. [2019-12-27 21:43:12,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:43:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 1284 transitions. [2019-12-27 21:43:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 21:43:12,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:12,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:12,045 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:12,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:12,045 INFO L82 PathProgramCache]: Analyzing trace with hash -660404610, now seen corresponding path program 1 times [2019-12-27 21:43:12,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:12,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494861296] [2019-12-27 21:43:12,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:12,113 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 21:43:12,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494861296] [2019-12-27 21:43:12,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:12,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:43:12,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1790154109] [2019-12-27 21:43:12,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:12,130 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:12,187 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 115 transitions. [2019-12-27 21:43:12,188 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:12,206 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:43:12,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:43:12,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:12,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:43:12,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:43:12,208 INFO L87 Difference]: Start difference. First operand 539 states and 1284 transitions. Second operand 5 states. [2019-12-27 21:43:12,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:12,401 INFO L93 Difference]: Finished difference Result 638 states and 1465 transitions. [2019-12-27 21:43:12,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:43:12,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 21:43:12,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:12,405 INFO L225 Difference]: With dead ends: 638 [2019-12-27 21:43:12,405 INFO L226 Difference]: Without dead ends: 638 [2019-12-27 21:43:12,406 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 21:43:12,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-12-27 21:43:12,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 475. [2019-12-27 21:43:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-12-27 21:43:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1096 transitions. [2019-12-27 21:43:12,415 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1096 transitions. Word has length 56 [2019-12-27 21:43:12,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:12,415 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 1096 transitions. [2019-12-27 21:43:12,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:43:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1096 transitions. [2019-12-27 21:43:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:43:12,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:12,417 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:12,417 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:12,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1825683623, now seen corresponding path program 1 times [2019-12-27 21:43:12,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:12,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903703956] [2019-12-27 21:43:12,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:12,554 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 21:43:12,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903703956] [2019-12-27 21:43:12,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:12,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:43:12,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [474499037] [2019-12-27 21:43:12,555 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:12,572 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:12,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 106 transitions. [2019-12-27 21:43:12,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:12,633 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:43:12,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:43:12,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:12,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:43:12,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:43:12,634 INFO L87 Difference]: Start difference. First operand 475 states and 1096 transitions. Second operand 6 states. [2019-12-27 21:43:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:12,717 INFO L93 Difference]: Finished difference Result 783 states and 1701 transitions. [2019-12-27 21:43:12,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:43:12,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 21:43:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:12,719 INFO L225 Difference]: With dead ends: 783 [2019-12-27 21:43:12,719 INFO L226 Difference]: Without dead ends: 312 [2019-12-27 21:43:12,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:43:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-27 21:43:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 279. [2019-12-27 21:43:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-12-27 21:43:12,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 509 transitions. [2019-12-27 21:43:12,726 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 509 transitions. Word has length 57 [2019-12-27 21:43:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:12,727 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 509 transitions. [2019-12-27 21:43:12,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:43:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 509 transitions. [2019-12-27 21:43:12,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:43:12,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:12,729 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:12,729 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:12,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:12,730 INFO L82 PathProgramCache]: Analyzing trace with hash 543693155, now seen corresponding path program 2 times [2019-12-27 21:43:12,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:12,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463838414] [2019-12-27 21:43:12,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:13,094 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 21:43:13,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463838414] [2019-12-27 21:43:13,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:13,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 21:43:13,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1203593865] [2019-12-27 21:43:13,096 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:13,111 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:13,165 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 108 states and 135 transitions. [2019-12-27 21:43:13,166 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:13,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:43:13,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:43:13,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:43:13,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:43:13,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:43:13,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:43:13,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:43:13,443 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:43:13,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 21:43:13,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:13,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 21:43:13,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:43:13,445 INFO L87 Difference]: Start difference. First operand 279 states and 509 transitions. Second operand 20 states. [2019-12-27 21:43:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:14,693 INFO L93 Difference]: Finished difference Result 491 states and 871 transitions. [2019-12-27 21:43:14,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 21:43:14,694 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 57 [2019-12-27 21:43:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:14,695 INFO L225 Difference]: With dead ends: 491 [2019-12-27 21:43:14,695 INFO L226 Difference]: Without dead ends: 459 [2019-12-27 21:43:14,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 21:43:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-27 21:43:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 344. [2019-12-27 21:43:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 21:43:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 618 transitions. [2019-12-27 21:43:14,702 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 618 transitions. Word has length 57 [2019-12-27 21:43:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:14,703 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 618 transitions. [2019-12-27 21:43:14,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 21:43:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 618 transitions. [2019-12-27 21:43:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:43:14,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:14,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:14,704 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:14,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash -280237799, now seen corresponding path program 3 times [2019-12-27 21:43:14,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:14,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490382974] [2019-12-27 21:43:14,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:14,907 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 21:43:14,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490382974] [2019-12-27 21:43:14,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:14,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:43:14,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1550887022] [2019-12-27 21:43:14,909 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:14,925 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:14,997 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 165 transitions. [2019-12-27 21:43:14,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:15,046 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:43:15,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:43:15,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:15,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:43:15,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:43:15,048 INFO L87 Difference]: Start difference. First operand 344 states and 618 transitions. Second operand 13 states. [2019-12-27 21:43:15,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:15,612 INFO L93 Difference]: Finished difference Result 530 states and 933 transitions. [2019-12-27 21:43:15,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:43:15,613 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 21:43:15,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:15,614 INFO L225 Difference]: With dead ends: 530 [2019-12-27 21:43:15,614 INFO L226 Difference]: Without dead ends: 498 [2019-12-27 21:43:15,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:43:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-12-27 21:43:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 379. [2019-12-27 21:43:15,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-27 21:43:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 680 transitions. [2019-12-27 21:43:15,620 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 680 transitions. Word has length 57 [2019-12-27 21:43:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:15,621 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 680 transitions. [2019-12-27 21:43:15,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:43:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 680 transitions. [2019-12-27 21:43:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:43:15,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:15,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:15,623 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:15,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1607584303, now seen corresponding path program 4 times [2019-12-27 21:43:15,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:15,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476786764] [2019-12-27 21:43:15,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:43:16,245 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 21:43:16,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476786764] [2019-12-27 21:43:16,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:43:16,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-27 21:43:16,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [999069537] [2019-12-27 21:43:16,246 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:43:16,267 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:43:16,385 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 184 transitions. [2019-12-27 21:43:16,385 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:43:16,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 21:43:16,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:43:16,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:43:16,827 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-12-27 21:43:16,845 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 21:43:16,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 21:43:16,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:43:16,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 21:43:16,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:43:16,847 INFO L87 Difference]: Start difference. First operand 379 states and 680 transitions. Second operand 26 states. [2019-12-27 21:43:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:43:19,605 INFO L93 Difference]: Finished difference Result 954 states and 1720 transitions. [2019-12-27 21:43:19,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 21:43:19,605 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2019-12-27 21:43:19,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:43:19,607 INFO L225 Difference]: With dead ends: 954 [2019-12-27 21:43:19,607 INFO L226 Difference]: Without dead ends: 922 [2019-12-27 21:43:19,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=374, Invalid=2278, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 21:43:19,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2019-12-27 21:43:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 413. [2019-12-27 21:43:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-27 21:43:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 744 transitions. [2019-12-27 21:43:19,617 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 744 transitions. Word has length 57 [2019-12-27 21:43:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:43:19,618 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 744 transitions. [2019-12-27 21:43:19,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 21:43:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 744 transitions. [2019-12-27 21:43:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:43:19,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:43:19,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:43:19,619 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:43:19,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:43:19,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1879148695, now seen corresponding path program 5 times [2019-12-27 21:43:19,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:43:19,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334919666] [2019-12-27 21:43:19,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:43:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:43:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:43:19,723 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:43:19,723 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:43:19,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1498~0.base_27| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1498~0.base_27|) |v_ULTIMATE.start_main_~#t1498~0.offset_20| 0)) |v_#memory_int_25|) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff1_thd0~0_45) (= v_~y~0_25 0) (= v_~y$r_buff0_thd1~0_8 0) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1498~0.base_27|)) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= v_~y$r_buff0_thd2~0_19 0) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~weak$$choice2~0_32) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1498~0.base_27| 1)) (= v_~y$r_buff1_thd1~0_8 0) (= 0 v_~y$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd3~0_25 0) (= |v_ULTIMATE.start_main_~#t1498~0.offset_20| 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_25) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~y$r_buff1_thd3~0_18) (= v_~z~0_12 0) (= v_~y$mem_tmp~0_10 0) (= v_~x~0_12 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1498~0.base_27| 4) |v_#length_25|) (= v_~y$r_buff0_thd0~0_76 0) (= 0 v_~y$r_buff1_thd2~0_16) (= v_~y$w_buff1_used~0_63 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1498~0.base_27|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_26|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t1499~0.offset=|v_ULTIMATE.start_main_~#t1499~0.offset_20|, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_45, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t1499~0.base=|v_ULTIMATE.start_main_~#t1499~0.base_27|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ULTIMATE.start_main_~#t1500~0.offset=|v_ULTIMATE.start_main_~#t1500~0.offset_15|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ULTIMATE.start_main_~#t1500~0.base=|v_ULTIMATE.start_main_~#t1500~0.base_22|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t1498~0.base=|v_ULTIMATE.start_main_~#t1498~0.base_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_32, ULTIMATE.start_main_~#t1498~0.offset=|v_ULTIMATE.start_main_~#t1498~0.offset_20|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t1499~0.offset, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1499~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t1500~0.offset, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1500~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1498~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1498~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:43:19,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L800-1-->L802: Formula: (and (= |v_ULTIMATE.start_main_~#t1499~0.offset_11| 0) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1499~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1499~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1499~0.base_13|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1499~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1499~0.base_13|) |v_ULTIMATE.start_main_~#t1499~0.offset_11| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1499~0.base_13|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1499~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1499~0.base=|v_ULTIMATE.start_main_~#t1499~0.base_13|, ULTIMATE.start_main_~#t1499~0.offset=|v_ULTIMATE.start_main_~#t1499~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1499~0.base, ULTIMATE.start_main_~#t1499~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 21:43:19,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1500~0.base_12| 4) |v_#length_15|) (= |v_ULTIMATE.start_main_~#t1500~0.offset_10| 0) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1500~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1500~0.base_12| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1500~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1500~0.base_12|) |v_ULTIMATE.start_main_~#t1500~0.offset_10| 2)) |v_#memory_int_15|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1500~0.base_12| 1) |v_#valid_38|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1500~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1500~0.offset=|v_ULTIMATE.start_main_~#t1500~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1500~0.base=|v_ULTIMATE.start_main_~#t1500~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1500~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1500~0.base] because there is no mapped edge [2019-12-27 21:43:19,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_79) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= (mod v_~y$w_buff1_used~0_51 256) 0) (= v_~y$w_buff1_used~0_51 v_~y$w_buff0_used~0_80) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_8) (= v_~y$w_buff0~0_16 v_~y$w_buff1~0_16) (= 2 v_~y$w_buff0~0_15) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_16, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_51} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:43:19,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~z~0_7) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z~0=v_~z~0_7, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 21:43:19,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1447029591 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1447029591 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite11_Out1447029591| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out1447029591| ~y$w_buff0_used~0_In1447029591)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1447029591, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1447029591} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1447029591, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1447029591|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1447029591} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 21:43:19,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In1430260443 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1430260443 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out1430260443| ~y$w_buff1~0_In1430260443) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite3_Out1430260443| ~y~0_In1430260443)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1430260443, ~y$w_buff1~0=~y$w_buff1~0_In1430260443, ~y~0=~y~0_In1430260443, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1430260443} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1430260443, ~y$w_buff1~0=~y$w_buff1~0_In1430260443, ~y~0=~y~0_In1430260443, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out1430260443|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1430260443} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:43:19,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_16, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:43:19,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2101337926 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-2101337926 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2101337926 |P1Thread1of1ForFork2_#t~ite5_Out-2101337926|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-2101337926|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2101337926, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2101337926} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2101337926, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2101337926, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-2101337926|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 21:43:19,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1071212402 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1071212402 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1071212402 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1071212402 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite6_Out1071212402| 0)) (and (= |P1Thread1of1ForFork2_#t~ite6_Out1071212402| ~y$w_buff1_used~0_In1071212402) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1071212402, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1071212402, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1071212402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1071212402} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1071212402, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1071212402, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1071212402, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out1071212402|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1071212402} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 21:43:19,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-206653008 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-206653008 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-206653008 |P1Thread1of1ForFork2_#t~ite7_Out-206653008|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite7_Out-206653008|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-206653008, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-206653008} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-206653008, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-206653008, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-206653008|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 21:43:19,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-1592940614 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1592940614 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1592940614 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1592940614 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out-1592940614| ~y$w_buff1_used~0_In-1592940614) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite12_Out-1592940614| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1592940614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1592940614, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1592940614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1592940614} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1592940614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1592940614, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1592940614|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1592940614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1592940614} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 21:43:19,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1763046103 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1763046103 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1763046103 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1763046103 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1763046103 |P1Thread1of1ForFork2_#t~ite8_Out1763046103|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite8_Out1763046103|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1763046103, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1763046103, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1763046103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1763046103} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1763046103, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1763046103, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1763046103|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1763046103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1763046103} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:43:19,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L752-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_12) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 21:43:19,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In807266973 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In807266973 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out807266973 0)) (and (= ~y$r_buff0_thd3~0_Out807266973 ~y$r_buff0_thd3~0_In807266973) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In807266973, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In807266973} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In807266973, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out807266973, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out807266973|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 21:43:19,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-1854441626 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1854441626 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1854441626 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1854441626 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-1854441626 |P2Thread1of1ForFork0_#t~ite14_Out-1854441626|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite14_Out-1854441626| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1854441626, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1854441626, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1854441626, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1854441626} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-1854441626|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1854441626, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1854441626, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1854441626, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1854441626} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 21:43:19,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork0_#t~ite14_8|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 21:43:19,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_3|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:43:19,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-952420829 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-952420829 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-952420829 |ULTIMATE.start_main_#t~ite18_Out-952420829|)) (and (= |ULTIMATE.start_main_#t~ite18_Out-952420829| ~y~0_In-952420829) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-952420829, ~y~0=~y~0_In-952420829, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-952420829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-952420829} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-952420829, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-952420829|, ~y~0=~y~0_In-952420829, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-952420829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-952420829} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 21:43:19,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite18_7|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-27 21:43:19,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1020686863 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1020686863 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-1020686863| ~y$w_buff0_used~0_In-1020686863) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1020686863|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1020686863, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1020686863} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1020686863, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1020686863, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1020686863|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 21:43:19,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1757999917 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1757999917 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1757999917 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1757999917 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1757999917 |ULTIMATE.start_main_#t~ite21_Out1757999917|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite21_Out1757999917| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1757999917, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1757999917, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1757999917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1757999917} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1757999917, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1757999917, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1757999917|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1757999917, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1757999917} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:43:19,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In18287389 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In18287389 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite22_Out18287389|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In18287389 |ULTIMATE.start_main_#t~ite22_Out18287389|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In18287389, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In18287389} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In18287389, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In18287389, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out18287389|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:43:19,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1362497589 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1362497589 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1362497589 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1362497589 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1362497589|)) (and (= ~y$r_buff1_thd0~0_In-1362497589 |ULTIMATE.start_main_#t~ite23_Out-1362497589|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1362497589, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1362497589, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1362497589, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1362497589} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1362497589, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1362497589, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1362497589, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1362497589|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1362497589} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:43:19,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L822-->L822-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1760365535 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out1760365535| |ULTIMATE.start_main_#t~ite30_Out1760365535|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1760365535 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd0~0_In1760365535 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1760365535 256)) (and (= (mod ~y$w_buff1_used~0_In1760365535 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite29_Out1760365535| ~y$w_buff0~0_In1760365535)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out1760365535| ~y$w_buff0~0_In1760365535) (= |ULTIMATE.start_main_#t~ite29_In1760365535| |ULTIMATE.start_main_#t~ite29_Out1760365535|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1760365535, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In1760365535|, ~y$w_buff0~0=~y$w_buff0~0_In1760365535, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1760365535, ~weak$$choice2~0=~weak$$choice2~0_In1760365535, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1760365535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1760365535} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1760365535|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1760365535, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1760365535|, ~y$w_buff0~0=~y$w_buff0~0_In1760365535, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1760365535, ~weak$$choice2~0=~weak$$choice2~0_In1760365535, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1760365535, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1760365535} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 21:43:19,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_54 v_~y$r_buff0_thd0~0_53)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:43:19,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:43:19,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:43:19,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:43:19 BasicIcfg [2019-12-27 21:43:19,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:43:19,846 INFO L168 Benchmark]: Toolchain (without parser) took 24393.98 ms. Allocated memory was 138.4 MB in the beginning and 994.1 MB in the end (delta: 855.6 MB). Free memory was 100.4 MB in the beginning and 225.4 MB in the end (delta: -125.0 MB). Peak memory consumption was 730.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:43:19,847 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 21:43:19,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.90 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 156.7 MB in the end (delta: -56.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:43:19,849 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.35 ms. Allocated memory is still 202.9 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:43:19,850 INFO L168 Benchmark]: Boogie Preprocessor took 39.71 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:43:19,853 INFO L168 Benchmark]: RCFGBuilder took 805.78 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 105.2 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:43:19,854 INFO L168 Benchmark]: TraceAbstraction took 22714.67 ms. Allocated memory was 202.9 MB in the beginning and 994.1 MB in the end (delta: 791.2 MB). Free memory was 104.5 MB in the beginning and 225.4 MB in the end (delta: -120.8 MB). Peak memory consumption was 670.3 MB. Max. memory is 7.1 GB. [2019-12-27 21:43:19,859 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.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.90 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 156.7 MB in the end (delta: -56.7 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.35 ms. Allocated memory is still 202.9 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.71 ms. Allocated memory is still 202.9 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 805.78 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 105.2 MB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22714.67 ms. Allocated memory was 202.9 MB in the beginning and 994.1 MB in the end (delta: 791.2 MB). Free memory was 104.5 MB in the beginning and 225.4 MB in the end (delta: -120.8 MB). Peak memory consumption was 670.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 162 ProgramPointsBefore, 86 ProgramPointsAfterwards, 193 TransitionsBefore, 97 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 24 ChoiceCompositions, 3760 VarBasedMoverChecksPositive, 156 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51676 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1498, ((void *)0), P0, ((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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1499, ((void *)0), P1, ((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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1500, ((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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, 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=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 22.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1497 SDtfs, 2386 SDslu, 5155 SDs, 0 SdLazy, 4631 SolverSat, 317 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 42 SyntacticMatches, 19 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25418occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 4892 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 563 ConstructedInterpolants, 0 QuantifiedInterpolants, 136981 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...