/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/safe005_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:16:45,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:16:45,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:16:45,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:16:45,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:16:45,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:16:45,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:16:45,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:16:45,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:16:45,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:16:45,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:16:45,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:16:45,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:16:45,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:16:45,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:16:45,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:16:45,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:16:45,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:16:45,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:16:45,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:16:45,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:16:45,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:16:45,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:16:45,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:16:45,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:16:45,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:16:45,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:16:45,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:16:45,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:16:45,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:16:45,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:16:45,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:16:45,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:16:45,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:16:45,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:16:45,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:16:45,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:16:45,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:16:45,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:16:45,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:16:45,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:16:45,407 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:16:45,430 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:16:45,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:16:45,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:16:45,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:16:45,432 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:16:45,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:16:45,433 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:16:45,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:16:45,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:16:45,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:16:45,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:16:45,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:16:45,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:16:45,434 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:16:45,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:16:45,434 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:16:45,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:16:45,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:16:45,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:16:45,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:16:45,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:16:45,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:16:45,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:16:45,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:16:45,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:16:45,436 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:16:45,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:16:45,437 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:16:45,437 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:16:45,437 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:16:45,437 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:16:45,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:16:45,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:16:45,748 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:16:45,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:16:45,753 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:16:45,753 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:16:45,754 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.oepc.i [2019-12-27 22:16:45,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f233ff55/3b09a5764e2e47a592054586c65701e9/FLAG30a8bdcfd [2019-12-27 22:16:46,388 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:16:46,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_pso.oepc.i [2019-12-27 22:16:46,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f233ff55/3b09a5764e2e47a592054586c65701e9/FLAG30a8bdcfd [2019-12-27 22:16:46,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f233ff55/3b09a5764e2e47a592054586c65701e9 [2019-12-27 22:16:46,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:16:46,685 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:16:46,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:16:46,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:16:46,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:16:46,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:16:46" (1/1) ... [2019-12-27 22:16:46,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b7fa2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:46, skipping insertion in model container [2019-12-27 22:16:46,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:16:46" (1/1) ... [2019-12-27 22:16:46,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:16:46,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:16:47,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:16:47,298 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:16:47,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:16:47,467 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:16:47,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:47 WrapperNode [2019-12-27 22:16:47,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:16:47,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:16:47,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:16:47,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:16:47,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:47" (1/1) ... [2019-12-27 22:16:47,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:47" (1/1) ... [2019-12-27 22:16:47,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:16:47,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:16:47,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:16:47,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:16:47,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:47" (1/1) ... [2019-12-27 22:16:47,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:47" (1/1) ... [2019-12-27 22:16:47,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:47" (1/1) ... [2019-12-27 22:16:47,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:47" (1/1) ... [2019-12-27 22:16:47,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:47" (1/1) ... [2019-12-27 22:16:47,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:47" (1/1) ... [2019-12-27 22:16:47,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:47" (1/1) ... [2019-12-27 22:16:47,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:16:47,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:16:47,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:16:47,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:16:47,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:16:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:16:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:16:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:16:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:16:47,641 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:16:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:16:47,641 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:16:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:16:47,641 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:16:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:16:47,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:16:47,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:16:47,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:16:47,644 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:16:48,428 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:16:48,428 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:16:48,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:16:48 BoogieIcfgContainer [2019-12-27 22:16:48,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:16:48,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:16:48,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:16:48,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:16:48,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:16:46" (1/3) ... [2019-12-27 22:16:48,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795915f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:16:48, skipping insertion in model container [2019-12-27 22:16:48,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:16:47" (2/3) ... [2019-12-27 22:16:48,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795915f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:16:48, skipping insertion in model container [2019-12-27 22:16:48,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:16:48" (3/3) ... [2019-12-27 22:16:48,439 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_pso.oepc.i [2019-12-27 22:16:48,450 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:16:48,451 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:16:48,459 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:16:48,460 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:16:48,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,502 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,503 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,546 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,546 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,546 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,546 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,547 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,553 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,553 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,562 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,562 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,562 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,568 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,569 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,573 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:16:48,593 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:16:48,610 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:16:48,610 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:16:48,610 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:16:48,610 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:16:48,611 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:16:48,611 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:16:48,611 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:16:48,611 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:16:48,629 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 22:16:48,631 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:16:48,754 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:16:48,754 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:16:48,769 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:16:48,791 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 22:16:48,841 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 22:16:48,842 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:16:48,849 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:16:48,869 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:16:48,870 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:16:52,135 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-12-27 22:16:52,707 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:16:52,828 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:16:52,901 INFO L206 etLargeBlockEncoding]: Checked pairs total: 69182 [2019-12-27 22:16:52,901 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 22:16:52,905 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions [2019-12-27 22:17:07,473 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92280 states. [2019-12-27 22:17:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 92280 states. [2019-12-27 22:17:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:17:07,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:07,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:17:07,483 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:07,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:07,490 INFO L82 PathProgramCache]: Analyzing trace with hash 794638691, now seen corresponding path program 1 times [2019-12-27 22:17:07,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:07,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569746431] [2019-12-27 22:17:07,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:17:07,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569746431] [2019-12-27 22:17:07,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:07,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:17:07,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2115563881] [2019-12-27 22:17:07,706 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:07,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:07,723 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:17:07,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:07,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:17:07,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:17:07,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:07,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:17:07,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:17:07,743 INFO L87 Difference]: Start difference. First operand 92280 states. Second operand 3 states. [2019-12-27 22:17:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:11,256 INFO L93 Difference]: Finished difference Result 90395 states and 387830 transitions. [2019-12-27 22:17:11,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:17:11,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:17:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:11,871 INFO L225 Difference]: With dead ends: 90395 [2019-12-27 22:17:11,871 INFO L226 Difference]: Without dead ends: 85117 [2019-12-27 22:17:11,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:17:15,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85117 states. [2019-12-27 22:17:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85117 to 85117. [2019-12-27 22:17:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85117 states. [2019-12-27 22:17:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85117 states to 85117 states and 364674 transitions. [2019-12-27 22:17:17,680 INFO L78 Accepts]: Start accepts. Automaton has 85117 states and 364674 transitions. Word has length 5 [2019-12-27 22:17:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:17,680 INFO L462 AbstractCegarLoop]: Abstraction has 85117 states and 364674 transitions. [2019-12-27 22:17:17,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:17:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand 85117 states and 364674 transitions. [2019-12-27 22:17:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:17:17,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:17,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:17,690 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:17,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:17,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2064286334, now seen corresponding path program 1 times [2019-12-27 22:17:17,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:17,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59359358] [2019-12-27 22:17:17,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:17:17,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59359358] [2019-12-27 22:17:17,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:17,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:17:17,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [112040561] [2019-12-27 22:17:17,824 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:17,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:17,830 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:17:17,830 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:17,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:17:17,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:17:17,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:17,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:17:17,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:17:17,833 INFO L87 Difference]: Start difference. First operand 85117 states and 364674 transitions. Second operand 4 states. [2019-12-27 22:17:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:22,264 INFO L93 Difference]: Finished difference Result 130038 states and 533020 transitions. [2019-12-27 22:17:22,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:17:22,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:17:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:23,154 INFO L225 Difference]: With dead ends: 130038 [2019-12-27 22:17:23,155 INFO L226 Difference]: Without dead ends: 129940 [2019-12-27 22:17:23,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:17:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129940 states. [2019-12-27 22:17:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129940 to 116665. [2019-12-27 22:17:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116665 states. [2019-12-27 22:17:36,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116665 states to 116665 states and 485676 transitions. [2019-12-27 22:17:36,215 INFO L78 Accepts]: Start accepts. Automaton has 116665 states and 485676 transitions. Word has length 13 [2019-12-27 22:17:36,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:36,217 INFO L462 AbstractCegarLoop]: Abstraction has 116665 states and 485676 transitions. [2019-12-27 22:17:36,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:17:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 116665 states and 485676 transitions. [2019-12-27 22:17:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:17:36,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:36,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:36,221 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:36,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:36,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1769810709, now seen corresponding path program 1 times [2019-12-27 22:17:36,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:36,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015628584] [2019-12-27 22:17:36,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:17:36,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015628584] [2019-12-27 22:17:36,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:36,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:17:36,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1615453980] [2019-12-27 22:17:36,319 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:36,320 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:36,322 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:17:36,322 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:36,323 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:17:36,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:17:36,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:36,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:17:36,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:17:36,324 INFO L87 Difference]: Start difference. First operand 116665 states and 485676 transitions. Second operand 4 states. [2019-12-27 22:17:37,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:37,375 INFO L93 Difference]: Finished difference Result 161841 states and 657746 transitions. [2019-12-27 22:17:37,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:17:37,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:17:37,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:43,172 INFO L225 Difference]: With dead ends: 161841 [2019-12-27 22:17:43,173 INFO L226 Difference]: Without dead ends: 161729 [2019-12-27 22:17:43,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:17:47,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161729 states. [2019-12-27 22:17:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161729 to 135524. [2019-12-27 22:17:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135524 states. [2019-12-27 22:17:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135524 states to 135524 states and 561455 transitions. [2019-12-27 22:17:50,646 INFO L78 Accepts]: Start accepts. Automaton has 135524 states and 561455 transitions. Word has length 13 [2019-12-27 22:17:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:17:50,647 INFO L462 AbstractCegarLoop]: Abstraction has 135524 states and 561455 transitions. [2019-12-27 22:17:50,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:17:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 135524 states and 561455 transitions. [2019-12-27 22:17:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:17:50,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:17:50,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:17:50,652 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:17:50,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:17:50,653 INFO L82 PathProgramCache]: Analyzing trace with hash 37773354, now seen corresponding path program 1 times [2019-12-27 22:17:50,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:17:50,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513268641] [2019-12-27 22:17:50,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:17:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:17:50,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:17:50,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513268641] [2019-12-27 22:17:50,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:17:50,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:17:50,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [879607522] [2019-12-27 22:17:50,751 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:17:50,757 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:17:50,762 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:17:50,762 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:17:50,832 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:17:50,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:17:50,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:17:50,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:17:50,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:17:50,833 INFO L87 Difference]: Start difference. First operand 135524 states and 561455 transitions. Second operand 5 states. [2019-12-27 22:17:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:17:51,838 INFO L93 Difference]: Finished difference Result 181948 states and 742402 transitions. [2019-12-27 22:17:51,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:17:51,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:17:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:17:52,367 INFO L225 Difference]: With dead ends: 181948 [2019-12-27 22:17:52,368 INFO L226 Difference]: Without dead ends: 181948 [2019-12-27 22:17:52,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:18:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181948 states. [2019-12-27 22:18:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181948 to 149024. [2019-12-27 22:18:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149024 states. [2019-12-27 22:18:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149024 states to 149024 states and 615188 transitions. [2019-12-27 22:18:06,107 INFO L78 Accepts]: Start accepts. Automaton has 149024 states and 615188 transitions. Word has length 14 [2019-12-27 22:18:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:18:06,107 INFO L462 AbstractCegarLoop]: Abstraction has 149024 states and 615188 transitions. [2019-12-27 22:18:06,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:18:06,107 INFO L276 IsEmpty]: Start isEmpty. Operand 149024 states and 615188 transitions. [2019-12-27 22:18:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:18:06,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:18:06,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:18:06,111 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:18:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:18:06,112 INFO L82 PathProgramCache]: Analyzing trace with hash 37638690, now seen corresponding path program 1 times [2019-12-27 22:18:06,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:18:06,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605002821] [2019-12-27 22:18:06,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:18:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:18:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:18:06,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605002821] [2019-12-27 22:18:06,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:18:06,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:18:06,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [315630913] [2019-12-27 22:18:06,180 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:18:06,183 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:18:06,186 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:18:06,187 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:18:06,204 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:18:06,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:18:06,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:18:06,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:18:06,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:18:06,206 INFO L87 Difference]: Start difference. First operand 149024 states and 615188 transitions. Second operand 5 states. [2019-12-27 22:18:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:18:08,631 INFO L93 Difference]: Finished difference Result 176806 states and 719392 transitions. [2019-12-27 22:18:08,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:18:08,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:18:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:18:09,173 INFO L225 Difference]: With dead ends: 176806 [2019-12-27 22:18:09,173 INFO L226 Difference]: Without dead ends: 176726 [2019-12-27 22:18:09,174 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 22:18:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176726 states. [2019-12-27 22:18:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176726 to 154481. [2019-12-27 22:18:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154481 states. [2019-12-27 22:18:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154481 states to 154481 states and 636822 transitions. [2019-12-27 22:18:22,846 INFO L78 Accepts]: Start accepts. Automaton has 154481 states and 636822 transitions. Word has length 14 [2019-12-27 22:18:22,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:18:22,846 INFO L462 AbstractCegarLoop]: Abstraction has 154481 states and 636822 transitions. [2019-12-27 22:18:22,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:18:22,846 INFO L276 IsEmpty]: Start isEmpty. Operand 154481 states and 636822 transitions. [2019-12-27 22:18:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:18:22,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:18:22,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:18:22,849 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:18:22,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:18:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash 197780815, now seen corresponding path program 1 times [2019-12-27 22:18:22,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:18:22,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136866640] [2019-12-27 22:18:22,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:18:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:18:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:18:22,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136866640] [2019-12-27 22:18:22,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:18:22,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:18:22,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1741742259] [2019-12-27 22:18:22,922 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:18:22,925 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:18:22,929 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:18:22,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:18:23,957 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 14 [2019-12-27 22:18:23,957 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:18:23,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:18:23,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:18:23,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:18:23,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:18:23,959 INFO L87 Difference]: Start difference. First operand 154481 states and 636822 transitions. Second operand 5 states. [2019-12-27 22:18:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:18:25,094 INFO L93 Difference]: Finished difference Result 181899 states and 742115 transitions. [2019-12-27 22:18:25,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:18:25,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:18:25,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:18:32,054 INFO L225 Difference]: With dead ends: 181899 [2019-12-27 22:18:32,055 INFO L226 Difference]: Without dead ends: 181811 [2019-12-27 22:18:32,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:18:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181811 states. [2019-12-27 22:18:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181811 to 156231. [2019-12-27 22:18:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156231 states. [2019-12-27 22:18:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156231 states to 156231 states and 644534 transitions. [2019-12-27 22:18:39,736 INFO L78 Accepts]: Start accepts. Automaton has 156231 states and 644534 transitions. Word has length 14 [2019-12-27 22:18:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:18:39,736 INFO L462 AbstractCegarLoop]: Abstraction has 156231 states and 644534 transitions. [2019-12-27 22:18:39,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:18:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 156231 states and 644534 transitions. [2019-12-27 22:18:39,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 22:18:39,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:18:39,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:18:39,755 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:18:39,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:18:39,756 INFO L82 PathProgramCache]: Analyzing trace with hash -538416332, now seen corresponding path program 1 times [2019-12-27 22:18:39,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:18:39,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349072670] [2019-12-27 22:18:39,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:18:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:18:39,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:18:39,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349072670] [2019-12-27 22:18:39,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:18:39,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:18:39,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [972760313] [2019-12-27 22:18:39,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:18:39,835 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:18:39,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 22:18:39,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:18:39,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:18:39,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:18:39,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:18:39,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:18:39,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:18:39,839 INFO L87 Difference]: Start difference. First operand 156231 states and 644534 transitions. Second operand 3 states. [2019-12-27 22:18:45,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:18:45,683 INFO L93 Difference]: Finished difference Result 155313 states and 640741 transitions. [2019-12-27 22:18:45,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:18:45,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 22:18:45,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:18:46,221 INFO L225 Difference]: With dead ends: 155313 [2019-12-27 22:18:46,222 INFO L226 Difference]: Without dead ends: 155313 [2019-12-27 22:18:46,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:18:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155313 states. [2019-12-27 22:18:53,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155313 to 155313. [2019-12-27 22:18:53,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155313 states. [2019-12-27 22:18:53,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155313 states to 155313 states and 640741 transitions. [2019-12-27 22:18:53,814 INFO L78 Accepts]: Start accepts. Automaton has 155313 states and 640741 transitions. Word has length 18 [2019-12-27 22:18:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:18:53,814 INFO L462 AbstractCegarLoop]: Abstraction has 155313 states and 640741 transitions. [2019-12-27 22:18:53,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:18:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 155313 states and 640741 transitions. [2019-12-27 22:18:53,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:18:53,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:18:53,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:18:53,833 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:18:53,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:18:53,834 INFO L82 PathProgramCache]: Analyzing trace with hash -919407984, now seen corresponding path program 1 times [2019-12-27 22:18:53,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:18:53,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80829731] [2019-12-27 22:18:53,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:18:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:18:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:18:53,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80829731] [2019-12-27 22:18:53,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:18:53,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:18:53,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [852100007] [2019-12-27 22:18:53,883 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:18:53,885 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:18:53,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 50 transitions. [2019-12-27 22:18:53,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:18:53,902 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:18:53,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:18:53,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:18:53,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:18:53,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:18:53,904 INFO L87 Difference]: Start difference. First operand 155313 states and 640741 transitions. Second operand 5 states. [2019-12-27 22:19:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:03,714 INFO L93 Difference]: Finished difference Result 370574 states and 1539692 transitions. [2019-12-27 22:19:03,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:19:03,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:19:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:04,468 INFO L225 Difference]: With dead ends: 370574 [2019-12-27 22:19:04,468 INFO L226 Difference]: Without dead ends: 248122 [2019-12-27 22:19:04,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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 22:19:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248122 states. [2019-12-27 22:19:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248122 to 165407. [2019-12-27 22:19:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165407 states. [2019-12-27 22:19:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165407 states to 165407 states and 677577 transitions. [2019-12-27 22:19:14,295 INFO L78 Accepts]: Start accepts. Automaton has 165407 states and 677577 transitions. Word has length 19 [2019-12-27 22:19:14,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:14,296 INFO L462 AbstractCegarLoop]: Abstraction has 165407 states and 677577 transitions. [2019-12-27 22:19:14,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:19:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 165407 states and 677577 transitions. [2019-12-27 22:19:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:19:14,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:14,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:19:14,321 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:14,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:14,322 INFO L82 PathProgramCache]: Analyzing trace with hash -112975457, now seen corresponding path program 1 times [2019-12-27 22:19:14,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:14,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241588635] [2019-12-27 22:19:14,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:14,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241588635] [2019-12-27 22:19:14,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:14,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:14,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [259228974] [2019-12-27 22:19:14,424 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:14,428 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:14,432 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 22:19:14,433 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:14,468 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:19:14,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:19:14,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:14,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:19:14,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:19:14,470 INFO L87 Difference]: Start difference. First operand 165407 states and 677577 transitions. Second operand 5 states. [2019-12-27 22:19:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:16,099 INFO L93 Difference]: Finished difference Result 50857 states and 174233 transitions. [2019-12-27 22:19:16,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:19:16,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:19:16,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:16,179 INFO L225 Difference]: With dead ends: 50857 [2019-12-27 22:19:16,179 INFO L226 Difference]: Without dead ends: 40119 [2019-12-27 22:19:16,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 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 22:19:16,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40119 states. [2019-12-27 22:19:16,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40119 to 37087. [2019-12-27 22:19:16,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37087 states. [2019-12-27 22:19:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37087 states to 37087 states and 122652 transitions. [2019-12-27 22:19:16,845 INFO L78 Accepts]: Start accepts. Automaton has 37087 states and 122652 transitions. Word has length 19 [2019-12-27 22:19:16,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:16,845 INFO L462 AbstractCegarLoop]: Abstraction has 37087 states and 122652 transitions. [2019-12-27 22:19:16,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:19:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 37087 states and 122652 transitions. [2019-12-27 22:19:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:19:16,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:16,853 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] [2019-12-27 22:19:16,853 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:16,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:16,853 INFO L82 PathProgramCache]: Analyzing trace with hash -299881963, now seen corresponding path program 1 times [2019-12-27 22:19:16,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:16,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933838836] [2019-12-27 22:19:16,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:16,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933838836] [2019-12-27 22:19:16,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:16,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:16,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1907216235] [2019-12-27 22:19:16,912 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:16,916 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:16,929 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 102 transitions. [2019-12-27 22:19:16,930 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:16,931 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:19:16,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:19:16,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:16,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:19:16,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:19:16,933 INFO L87 Difference]: Start difference. First operand 37087 states and 122652 transitions. Second operand 5 states. [2019-12-27 22:19:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:17,547 INFO L93 Difference]: Finished difference Result 49987 states and 162271 transitions. [2019-12-27 22:19:17,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:19:17,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 22:19:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:17,637 INFO L225 Difference]: With dead ends: 49987 [2019-12-27 22:19:17,638 INFO L226 Difference]: Without dead ends: 49685 [2019-12-27 22:19:17,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:19:17,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49685 states. [2019-12-27 22:19:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49685 to 37766. [2019-12-27 22:19:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37766 states. [2019-12-27 22:19:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37766 states to 37766 states and 124837 transitions. [2019-12-27 22:19:20,933 INFO L78 Accepts]: Start accepts. Automaton has 37766 states and 124837 transitions. Word has length 22 [2019-12-27 22:19:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:20,933 INFO L462 AbstractCegarLoop]: Abstraction has 37766 states and 124837 transitions. [2019-12-27 22:19:20,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:19:20,933 INFO L276 IsEmpty]: Start isEmpty. Operand 37766 states and 124837 transitions. [2019-12-27 22:19:20,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:19:20,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:20,940 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] [2019-12-27 22:19:20,941 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:20,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:20,941 INFO L82 PathProgramCache]: Analyzing trace with hash -863346088, now seen corresponding path program 1 times [2019-12-27 22:19:20,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:20,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595326497] [2019-12-27 22:19:20,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:21,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595326497] [2019-12-27 22:19:21,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:21,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:21,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [934992653] [2019-12-27 22:19:21,022 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:21,025 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:21,038 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 92 transitions. [2019-12-27 22:19:21,038 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:21,094 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:19:21,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:19:21,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:21,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:19:21,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:19:21,096 INFO L87 Difference]: Start difference. First operand 37766 states and 124837 transitions. Second operand 6 states. [2019-12-27 22:19:22,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:22,122 INFO L93 Difference]: Finished difference Result 73921 states and 242243 transitions. [2019-12-27 22:19:22,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:19:22,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 22:19:22,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:22,261 INFO L225 Difference]: With dead ends: 73921 [2019-12-27 22:19:22,261 INFO L226 Difference]: Without dead ends: 73521 [2019-12-27 22:19:22,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:19:22,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73521 states. [2019-12-27 22:19:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73521 to 35630. [2019-12-27 22:19:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35630 states. [2019-12-27 22:19:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35630 states to 35630 states and 117569 transitions. [2019-12-27 22:19:23,505 INFO L78 Accepts]: Start accepts. Automaton has 35630 states and 117569 transitions. Word has length 22 [2019-12-27 22:19:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:23,505 INFO L462 AbstractCegarLoop]: Abstraction has 35630 states and 117569 transitions. [2019-12-27 22:19:23,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:19:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 35630 states and 117569 transitions. [2019-12-27 22:19:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:19:23,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:23,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:19:23,518 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:23,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:23,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2029037298, now seen corresponding path program 1 times [2019-12-27 22:19:23,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:23,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950147419] [2019-12-27 22:19:23,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:23,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950147419] [2019-12-27 22:19:23,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:23,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:23,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [853619235] [2019-12-27 22:19:23,598 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:23,601 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:23,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:19:23,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:23,607 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:19:23,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:19:23,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:23,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:19:23,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:19:23,609 INFO L87 Difference]: Start difference. First operand 35630 states and 117569 transitions. Second operand 5 states. [2019-12-27 22:19:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:24,277 INFO L93 Difference]: Finished difference Result 49203 states and 158838 transitions. [2019-12-27 22:19:24,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:19:24,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 22:19:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:24,371 INFO L225 Difference]: With dead ends: 49203 [2019-12-27 22:19:24,371 INFO L226 Difference]: Without dead ends: 48783 [2019-12-27 22:19:24,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:19:24,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48783 states. [2019-12-27 22:19:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48783 to 39538. [2019-12-27 22:19:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39538 states. [2019-12-27 22:19:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39538 states to 39538 states and 129730 transitions. [2019-12-27 22:19:25,624 INFO L78 Accepts]: Start accepts. Automaton has 39538 states and 129730 transitions. Word has length 25 [2019-12-27 22:19:25,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:25,624 INFO L462 AbstractCegarLoop]: Abstraction has 39538 states and 129730 transitions. [2019-12-27 22:19:25,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:19:25,624 INFO L276 IsEmpty]: Start isEmpty. Operand 39538 states and 129730 transitions. [2019-12-27 22:19:25,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 22:19:25,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:25,643 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] [2019-12-27 22:19:25,643 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:25,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:25,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2090157818, now seen corresponding path program 1 times [2019-12-27 22:19:25,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:25,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535415808] [2019-12-27 22:19:25,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:25,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535415808] [2019-12-27 22:19:25,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:25,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:25,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [626865784] [2019-12-27 22:19:25,699 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:25,703 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:25,726 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 22:19:25,726 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:25,764 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:19:25,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:19:25,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:25,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:19:25,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:19:25,766 INFO L87 Difference]: Start difference. First operand 39538 states and 129730 transitions. Second operand 7 states. [2019-12-27 22:19:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:26,309 INFO L93 Difference]: Finished difference Result 50004 states and 162444 transitions. [2019-12-27 22:19:26,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:19:26,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 22:19:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:26,441 INFO L225 Difference]: With dead ends: 50004 [2019-12-27 22:19:26,441 INFO L226 Difference]: Without dead ends: 49630 [2019-12-27 22:19:26,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:19:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49630 states. [2019-12-27 22:19:27,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49630 to 41317. [2019-12-27 22:19:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41317 states. [2019-12-27 22:19:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41317 states to 41317 states and 135542 transitions. [2019-12-27 22:19:27,256 INFO L78 Accepts]: Start accepts. Automaton has 41317 states and 135542 transitions. Word has length 28 [2019-12-27 22:19:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:27,256 INFO L462 AbstractCegarLoop]: Abstraction has 41317 states and 135542 transitions. [2019-12-27 22:19:27,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:19:27,256 INFO L276 IsEmpty]: Start isEmpty. Operand 41317 states and 135542 transitions. [2019-12-27 22:19:27,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 22:19:27,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:27,280 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] [2019-12-27 22:19:27,281 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:27,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:27,281 INFO L82 PathProgramCache]: Analyzing trace with hash -893146615, now seen corresponding path program 1 times [2019-12-27 22:19:27,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:27,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293512845] [2019-12-27 22:19:27,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:27,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293512845] [2019-12-27 22:19:27,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:27,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:27,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1436654810] [2019-12-27 22:19:27,327 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:27,332 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:27,559 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 22:19:27,560 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:27,633 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:19:27,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:19:27,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:27,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:19:27,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:19:27,634 INFO L87 Difference]: Start difference. First operand 41317 states and 135542 transitions. Second operand 7 states. [2019-12-27 22:19:27,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:27,896 INFO L93 Difference]: Finished difference Result 53099 states and 172547 transitions. [2019-12-27 22:19:27,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:19:27,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 22:19:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:27,991 INFO L225 Difference]: With dead ends: 53099 [2019-12-27 22:19:27,991 INFO L226 Difference]: Without dead ends: 53099 [2019-12-27 22:19:27,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:19:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53099 states. [2019-12-27 22:19:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53099 to 42877. [2019-12-27 22:19:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42877 states. [2019-12-27 22:19:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42877 states to 42877 states and 138134 transitions. [2019-12-27 22:19:28,801 INFO L78 Accepts]: Start accepts. Automaton has 42877 states and 138134 transitions. Word has length 28 [2019-12-27 22:19:28,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:28,801 INFO L462 AbstractCegarLoop]: Abstraction has 42877 states and 138134 transitions. [2019-12-27 22:19:28,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:19:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 42877 states and 138134 transitions. [2019-12-27 22:19:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 22:19:28,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:28,820 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] [2019-12-27 22:19:28,820 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:28,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:28,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1145073619, now seen corresponding path program 1 times [2019-12-27 22:19:28,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:28,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363143916] [2019-12-27 22:19:28,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:28,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363143916] [2019-12-27 22:19:28,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:28,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:28,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1280531511] [2019-12-27 22:19:28,889 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:28,896 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:28,930 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 157 transitions. [2019-12-27 22:19:28,931 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:28,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:19:28,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:19:28,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:28,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:19:28,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:19:28,975 INFO L87 Difference]: Start difference. First operand 42877 states and 138134 transitions. Second operand 7 states. [2019-12-27 22:19:29,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:29,710 INFO L93 Difference]: Finished difference Result 53252 states and 169937 transitions. [2019-12-27 22:19:29,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:19:29,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-12-27 22:19:29,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:29,801 INFO L225 Difference]: With dead ends: 53252 [2019-12-27 22:19:29,801 INFO L226 Difference]: Without dead ends: 52858 [2019-12-27 22:19:29,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:19:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52858 states. [2019-12-27 22:19:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52858 to 41876. [2019-12-27 22:19:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41876 states. [2019-12-27 22:19:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41876 states to 41876 states and 134705 transitions. [2019-12-27 22:19:30,590 INFO L78 Accepts]: Start accepts. Automaton has 41876 states and 134705 transitions. Word has length 29 [2019-12-27 22:19:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:30,590 INFO L462 AbstractCegarLoop]: Abstraction has 41876 states and 134705 transitions. [2019-12-27 22:19:30,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:19:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 41876 states and 134705 transitions. [2019-12-27 22:19:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 22:19:30,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:30,609 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] [2019-12-27 22:19:30,609 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:30,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:30,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1560097484, now seen corresponding path program 1 times [2019-12-27 22:19:30,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:30,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388472003] [2019-12-27 22:19:30,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:30,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388472003] [2019-12-27 22:19:30,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:30,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:19:30,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [836533819] [2019-12-27 22:19:30,654 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:30,659 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:30,672 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 111 transitions. [2019-12-27 22:19:30,673 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:30,684 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:19:30,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:19:30,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:30,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:19:30,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:19:30,685 INFO L87 Difference]: Start difference. First operand 41876 states and 134705 transitions. Second operand 4 states. [2019-12-27 22:19:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:30,920 INFO L93 Difference]: Finished difference Result 65138 states and 211462 transitions. [2019-12-27 22:19:30,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:19:30,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-27 22:19:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:30,974 INFO L225 Difference]: With dead ends: 65138 [2019-12-27 22:19:30,974 INFO L226 Difference]: Without dead ends: 31472 [2019-12-27 22:19:30,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:19:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31472 states. [2019-12-27 22:19:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31472 to 30611. [2019-12-27 22:19:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30611 states. [2019-12-27 22:19:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30611 states to 30611 states and 97193 transitions. [2019-12-27 22:19:31,819 INFO L78 Accepts]: Start accepts. Automaton has 30611 states and 97193 transitions. Word has length 29 [2019-12-27 22:19:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:31,820 INFO L462 AbstractCegarLoop]: Abstraction has 30611 states and 97193 transitions. [2019-12-27 22:19:31,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:19:31,820 INFO L276 IsEmpty]: Start isEmpty. Operand 30611 states and 97193 transitions. [2019-12-27 22:19:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 22:19:31,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:31,832 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] [2019-12-27 22:19:31,833 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:31,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:31,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2068336147, now seen corresponding path program 1 times [2019-12-27 22:19:31,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:31,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582011092] [2019-12-27 22:19:31,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:31,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582011092] [2019-12-27 22:19:31,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:31,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:19:31,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [711769131] [2019-12-27 22:19:31,883 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:31,890 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:31,900 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 52 transitions. [2019-12-27 22:19:31,900 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:31,918 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:19:31,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:19:31,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:31,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:19:31,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:19:31,919 INFO L87 Difference]: Start difference. First operand 30611 states and 97193 transitions. Second operand 5 states. [2019-12-27 22:19:32,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:32,399 INFO L93 Difference]: Finished difference Result 68373 states and 223368 transitions. [2019-12-27 22:19:32,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:19:32,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 22:19:32,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:32,474 INFO L225 Difference]: With dead ends: 68373 [2019-12-27 22:19:32,474 INFO L226 Difference]: Without dead ends: 40821 [2019-12-27 22:19:32,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:19:32,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40821 states. [2019-12-27 22:19:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40821 to 23978. [2019-12-27 22:19:32,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23978 states. [2019-12-27 22:19:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23978 states to 23978 states and 78428 transitions. [2019-12-27 22:19:33,428 INFO L78 Accepts]: Start accepts. Automaton has 23978 states and 78428 transitions. Word has length 30 [2019-12-27 22:19:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:33,428 INFO L462 AbstractCegarLoop]: Abstraction has 23978 states and 78428 transitions. [2019-12-27 22:19:33,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:19:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 23978 states and 78428 transitions. [2019-12-27 22:19:33,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 22:19:33,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:33,443 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] [2019-12-27 22:19:33,443 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:33,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:33,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1129404662, now seen corresponding path program 1 times [2019-12-27 22:19:33,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:33,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40705359] [2019-12-27 22:19:33,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:33,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40705359] [2019-12-27 22:19:33,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:33,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:19:33,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1626785776] [2019-12-27 22:19:33,521 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:33,526 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:33,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 114 transitions. [2019-12-27 22:19:33,545 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:33,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:19:33,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:19:33,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:33,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:19:33,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:19:33,625 INFO L87 Difference]: Start difference. First operand 23978 states and 78428 transitions. Second operand 8 states. [2019-12-27 22:19:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:34,399 INFO L93 Difference]: Finished difference Result 38751 states and 124676 transitions. [2019-12-27 22:19:34,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:19:34,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-27 22:19:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:34,464 INFO L225 Difference]: With dead ends: 38751 [2019-12-27 22:19:34,464 INFO L226 Difference]: Without dead ends: 38751 [2019-12-27 22:19:34,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:19:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38751 states. [2019-12-27 22:19:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38751 to 31393. [2019-12-27 22:19:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31393 states. [2019-12-27 22:19:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31393 states to 31393 states and 101821 transitions. [2019-12-27 22:19:35,098 INFO L78 Accepts]: Start accepts. Automaton has 31393 states and 101821 transitions. Word has length 30 [2019-12-27 22:19:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:35,099 INFO L462 AbstractCegarLoop]: Abstraction has 31393 states and 101821 transitions. [2019-12-27 22:19:35,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:19:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 31393 states and 101821 transitions. [2019-12-27 22:19:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 22:19:35,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:35,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:19:35,122 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:35,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:35,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1533119952, now seen corresponding path program 1 times [2019-12-27 22:19:35,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:35,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866458433] [2019-12-27 22:19:35,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:35,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866458433] [2019-12-27 22:19:35,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:35,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:19:35,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1542006497] [2019-12-27 22:19:35,206 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:35,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:35,231 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 119 transitions. [2019-12-27 22:19:35,232 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:35,257 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:19:35,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:19:35,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:35,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:19:35,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:19:35,258 INFO L87 Difference]: Start difference. First operand 31393 states and 101821 transitions. Second operand 6 states. [2019-12-27 22:19:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:35,364 INFO L93 Difference]: Finished difference Result 14683 states and 43981 transitions. [2019-12-27 22:19:35,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:19:35,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 22:19:35,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:35,382 INFO L225 Difference]: With dead ends: 14683 [2019-12-27 22:19:35,383 INFO L226 Difference]: Without dead ends: 12336 [2019-12-27 22:19:35,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:19:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12336 states. [2019-12-27 22:19:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12336 to 12139. [2019-12-27 22:19:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12139 states. [2019-12-27 22:19:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12139 states to 12139 states and 36048 transitions. [2019-12-27 22:19:35,560 INFO L78 Accepts]: Start accepts. Automaton has 12139 states and 36048 transitions. Word has length 31 [2019-12-27 22:19:35,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:35,560 INFO L462 AbstractCegarLoop]: Abstraction has 12139 states and 36048 transitions. [2019-12-27 22:19:35,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:19:35,560 INFO L276 IsEmpty]: Start isEmpty. Operand 12139 states and 36048 transitions. [2019-12-27 22:19:35,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:19:35,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:35,572 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] [2019-12-27 22:19:35,572 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:35,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:35,572 INFO L82 PathProgramCache]: Analyzing trace with hash -210063419, now seen corresponding path program 1 times [2019-12-27 22:19:35,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:35,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329028790] [2019-12-27 22:19:35,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:35,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329028790] [2019-12-27 22:19:35,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:35,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:19:35,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1599684635] [2019-12-27 22:19:35,672 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:35,681 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:35,798 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 152 transitions. [2019-12-27 22:19:35,799 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:35,815 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:19:35,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:19:35,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:35,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:19:35,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:19:35,816 INFO L87 Difference]: Start difference. First operand 12139 states and 36048 transitions. Second operand 6 states. [2019-12-27 22:19:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:36,047 INFO L93 Difference]: Finished difference Result 12265 states and 36282 transitions. [2019-12-27 22:19:36,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:19:36,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 22:19:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:36,063 INFO L225 Difference]: With dead ends: 12265 [2019-12-27 22:19:36,063 INFO L226 Difference]: Without dead ends: 12038 [2019-12-27 22:19:36,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:19:36,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12038 states. [2019-12-27 22:19:36,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12038 to 12038. [2019-12-27 22:19:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12038 states. [2019-12-27 22:19:36,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12038 states to 12038 states and 35837 transitions. [2019-12-27 22:19:36,239 INFO L78 Accepts]: Start accepts. Automaton has 12038 states and 35837 transitions. Word has length 40 [2019-12-27 22:19:36,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:36,239 INFO L462 AbstractCegarLoop]: Abstraction has 12038 states and 35837 transitions. [2019-12-27 22:19:36,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:19:36,239 INFO L276 IsEmpty]: Start isEmpty. Operand 12038 states and 35837 transitions. [2019-12-27 22:19:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:19:36,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:36,252 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] [2019-12-27 22:19:36,252 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:36,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1917096257, now seen corresponding path program 1 times [2019-12-27 22:19:36,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:36,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65868009] [2019-12-27 22:19:36,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:36,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65868009] [2019-12-27 22:19:36,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:36,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:19:36,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [710067088] [2019-12-27 22:19:36,338 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:36,346 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:36,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 162 transitions. [2019-12-27 22:19:36,381 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:36,435 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:19:36,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:19:36,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:36,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:19:36,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:19:36,437 INFO L87 Difference]: Start difference. First operand 12038 states and 35837 transitions. Second operand 9 states. [2019-12-27 22:19:38,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:38,175 INFO L93 Difference]: Finished difference Result 41257 states and 120463 transitions. [2019-12-27 22:19:38,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:19:38,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-12-27 22:19:38,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:38,234 INFO L225 Difference]: With dead ends: 41257 [2019-12-27 22:19:38,234 INFO L226 Difference]: Without dead ends: 41257 [2019-12-27 22:19:38,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:19:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41257 states. [2019-12-27 22:19:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41257 to 13996. [2019-12-27 22:19:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13996 states. [2019-12-27 22:19:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13996 states to 13996 states and 41939 transitions. [2019-12-27 22:19:38,622 INFO L78 Accepts]: Start accepts. Automaton has 13996 states and 41939 transitions. Word has length 40 [2019-12-27 22:19:38,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:38,622 INFO L462 AbstractCegarLoop]: Abstraction has 13996 states and 41939 transitions. [2019-12-27 22:19:38,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:19:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 13996 states and 41939 transitions. [2019-12-27 22:19:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:19:38,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:38,640 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] [2019-12-27 22:19:38,640 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:38,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:38,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1006245989, now seen corresponding path program 2 times [2019-12-27 22:19:38,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:38,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190351663] [2019-12-27 22:19:38,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:38,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190351663] [2019-12-27 22:19:38,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:38,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:19:38,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [177905667] [2019-12-27 22:19:38,752 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:38,761 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:38,819 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 199 transitions. [2019-12-27 22:19:38,819 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:38,912 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 22:19:38,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:19:38,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:38,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:19:38,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:19:38,913 INFO L87 Difference]: Start difference. First operand 13996 states and 41939 transitions. Second operand 10 states. [2019-12-27 22:19:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:41,484 INFO L93 Difference]: Finished difference Result 41573 states and 121058 transitions. [2019-12-27 22:19:41,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 22:19:41,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 22:19:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:41,542 INFO L225 Difference]: With dead ends: 41573 [2019-12-27 22:19:41,543 INFO L226 Difference]: Without dead ends: 41573 [2019-12-27 22:19:41,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-12-27 22:19:41,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41573 states. [2019-12-27 22:19:41,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41573 to 14658. [2019-12-27 22:19:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14658 states. [2019-12-27 22:19:41,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14658 states to 14658 states and 43887 transitions. [2019-12-27 22:19:41,941 INFO L78 Accepts]: Start accepts. Automaton has 14658 states and 43887 transitions. Word has length 40 [2019-12-27 22:19:41,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:41,942 INFO L462 AbstractCegarLoop]: Abstraction has 14658 states and 43887 transitions. [2019-12-27 22:19:41,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:19:41,942 INFO L276 IsEmpty]: Start isEmpty. Operand 14658 states and 43887 transitions. [2019-12-27 22:19:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:19:41,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:41,958 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] [2019-12-27 22:19:41,958 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:41,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:41,958 INFO L82 PathProgramCache]: Analyzing trace with hash 525688229, now seen corresponding path program 3 times [2019-12-27 22:19:41,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:41,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485940510] [2019-12-27 22:19:41,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:42,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485940510] [2019-12-27 22:19:42,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:42,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:19:42,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [995290387] [2019-12-27 22:19:42,065 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:42,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:42,111 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 182 transitions. [2019-12-27 22:19:42,111 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:42,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:19:42,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 22:19:42,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:19:42,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:42,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:19:42,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:19:42,230 INFO L87 Difference]: Start difference. First operand 14658 states and 43887 transitions. Second operand 11 states. [2019-12-27 22:19:45,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:45,389 INFO L93 Difference]: Finished difference Result 22332 states and 65871 transitions. [2019-12-27 22:19:45,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 22:19:45,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-12-27 22:19:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:45,420 INFO L225 Difference]: With dead ends: 22332 [2019-12-27 22:19:45,420 INFO L226 Difference]: Without dead ends: 22332 [2019-12-27 22:19:45,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:19:45,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22332 states. [2019-12-27 22:19:45,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22332 to 14718. [2019-12-27 22:19:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14718 states. [2019-12-27 22:19:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14718 states to 14718 states and 44057 transitions. [2019-12-27 22:19:45,693 INFO L78 Accepts]: Start accepts. Automaton has 14718 states and 44057 transitions. Word has length 40 [2019-12-27 22:19:45,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:45,694 INFO L462 AbstractCegarLoop]: Abstraction has 14718 states and 44057 transitions. [2019-12-27 22:19:45,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:19:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 14718 states and 44057 transitions. [2019-12-27 22:19:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 22:19:45,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:45,709 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] [2019-12-27 22:19:45,710 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:45,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1341792848, now seen corresponding path program 1 times [2019-12-27 22:19:45,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:45,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326615095] [2019-12-27 22:19:45,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:45,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326615095] [2019-12-27 22:19:45,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:45,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:19:45,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1260645949] [2019-12-27 22:19:45,789 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:45,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:45,860 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 161 transitions. [2019-12-27 22:19:45,860 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:45,932 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:19:45,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:19:45,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:45,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:19:45,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:19:45,933 INFO L87 Difference]: Start difference. First operand 14718 states and 44057 transitions. Second operand 7 states. [2019-12-27 22:19:47,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:47,039 INFO L93 Difference]: Finished difference Result 24844 states and 73687 transitions. [2019-12-27 22:19:47,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 22:19:47,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 22:19:47,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:47,105 INFO L225 Difference]: With dead ends: 24844 [2019-12-27 22:19:47,105 INFO L226 Difference]: Without dead ends: 24503 [2019-12-27 22:19:47,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:19:47,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24503 states. [2019-12-27 22:19:47,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24503 to 15019. [2019-12-27 22:19:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15019 states. [2019-12-27 22:19:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15019 states to 15019 states and 45195 transitions. [2019-12-27 22:19:47,653 INFO L78 Accepts]: Start accepts. Automaton has 15019 states and 45195 transitions. Word has length 41 [2019-12-27 22:19:47,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:47,654 INFO L462 AbstractCegarLoop]: Abstraction has 15019 states and 45195 transitions. [2019-12-27 22:19:47,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:19:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 15019 states and 45195 transitions. [2019-12-27 22:19:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 22:19:47,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:47,678 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] [2019-12-27 22:19:47,678 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:47,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:47,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1410483013, now seen corresponding path program 1 times [2019-12-27 22:19:47,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:47,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734697367] [2019-12-27 22:19:47,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:47,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734697367] [2019-12-27 22:19:47,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:47,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:19:47,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [519394445] [2019-12-27 22:19:47,750 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:47,771 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:47,814 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 163 transitions. [2019-12-27 22:19:47,814 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:47,823 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:19:47,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:19:47,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:47,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:19:47,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:19:47,824 INFO L87 Difference]: Start difference. First operand 15019 states and 45195 transitions. Second operand 4 states. [2019-12-27 22:19:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:48,076 INFO L93 Difference]: Finished difference Result 16238 states and 47107 transitions. [2019-12-27 22:19:48,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:19:48,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 22:19:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:48,099 INFO L225 Difference]: With dead ends: 16238 [2019-12-27 22:19:48,099 INFO L226 Difference]: Without dead ends: 16238 [2019-12-27 22:19:48,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:19:48,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16238 states. [2019-12-27 22:19:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16238 to 11654. [2019-12-27 22:19:48,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11654 states. [2019-12-27 22:19:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11654 states to 11654 states and 34270 transitions. [2019-12-27 22:19:48,296 INFO L78 Accepts]: Start accepts. Automaton has 11654 states and 34270 transitions. Word has length 41 [2019-12-27 22:19:48,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:48,296 INFO L462 AbstractCegarLoop]: Abstraction has 11654 states and 34270 transitions. [2019-12-27 22:19:48,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:19:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 11654 states and 34270 transitions. [2019-12-27 22:19:48,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 22:19:48,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:48,366 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] [2019-12-27 22:19:48,366 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:48,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:48,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1227192015, now seen corresponding path program 1 times [2019-12-27 22:19:48,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:48,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844062782] [2019-12-27 22:19:48,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:48,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844062782] [2019-12-27 22:19:48,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:48,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:19:48,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1145112084] [2019-12-27 22:19:48,435 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:48,457 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:48,496 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 93 states and 149 transitions. [2019-12-27 22:19:48,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:48,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:19:48,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:19:48,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:48,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:19:48,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:19:48,498 INFO L87 Difference]: Start difference. First operand 11654 states and 34270 transitions. Second operand 3 states. [2019-12-27 22:19:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:48,556 INFO L93 Difference]: Finished difference Result 11573 states and 33991 transitions. [2019-12-27 22:19:48,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:19:48,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 22:19:48,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:48,574 INFO L225 Difference]: With dead ends: 11573 [2019-12-27 22:19:48,574 INFO L226 Difference]: Without dead ends: 11573 [2019-12-27 22:19:48,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:19:48,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11573 states. [2019-12-27 22:19:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11573 to 9235. [2019-12-27 22:19:48,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9235 states. [2019-12-27 22:19:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9235 states to 9235 states and 27374 transitions. [2019-12-27 22:19:48,727 INFO L78 Accepts]: Start accepts. Automaton has 9235 states and 27374 transitions. Word has length 41 [2019-12-27 22:19:48,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:48,727 INFO L462 AbstractCegarLoop]: Abstraction has 9235 states and 27374 transitions. [2019-12-27 22:19:48,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:19:48,727 INFO L276 IsEmpty]: Start isEmpty. Operand 9235 states and 27374 transitions. [2019-12-27 22:19:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 22:19:48,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:48,736 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] [2019-12-27 22:19:48,737 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:48,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:48,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1573172907, now seen corresponding path program 1 times [2019-12-27 22:19:48,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:48,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537566233] [2019-12-27 22:19:48,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:48,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:48,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537566233] [2019-12-27 22:19:48,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:48,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:19:48,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [726553620] [2019-12-27 22:19:48,804 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:48,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:48,854 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 152 transitions. [2019-12-27 22:19:48,855 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:48,857 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:19:48,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:19:48,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:48,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:19:48,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:19:48,858 INFO L87 Difference]: Start difference. First operand 9235 states and 27374 transitions. Second operand 6 states. [2019-12-27 22:19:48,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:48,999 INFO L93 Difference]: Finished difference Result 8207 states and 24926 transitions. [2019-12-27 22:19:49,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:19:49,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 22:19:49,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:49,014 INFO L225 Difference]: With dead ends: 8207 [2019-12-27 22:19:49,015 INFO L226 Difference]: Without dead ends: 8099 [2019-12-27 22:19:49,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:19:49,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8099 states. [2019-12-27 22:19:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8099 to 7739. [2019-12-27 22:19:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7739 states. [2019-12-27 22:19:49,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7739 states to 7739 states and 23689 transitions. [2019-12-27 22:19:49,281 INFO L78 Accepts]: Start accepts. Automaton has 7739 states and 23689 transitions. Word has length 42 [2019-12-27 22:19:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:49,281 INFO L462 AbstractCegarLoop]: Abstraction has 7739 states and 23689 transitions. [2019-12-27 22:19:49,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:19:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 7739 states and 23689 transitions. [2019-12-27 22:19:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:19:49,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:49,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:19:49,296 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:49,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:49,296 INFO L82 PathProgramCache]: Analyzing trace with hash 612223072, now seen corresponding path program 1 times [2019-12-27 22:19:49,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:49,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505862431] [2019-12-27 22:19:49,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:49,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505862431] [2019-12-27 22:19:49,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:49,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:19:49,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [704054056] [2019-12-27 22:19:49,447 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:49,478 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:49,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 359 transitions. [2019-12-27 22:19:49,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:49,803 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:19:49,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:19:49,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:49,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:19:49,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:19:49,804 INFO L87 Difference]: Start difference. First operand 7739 states and 23689 transitions. Second operand 11 states. [2019-12-27 22:19:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:50,963 INFO L93 Difference]: Finished difference Result 14814 states and 44501 transitions. [2019-12-27 22:19:50,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 22:19:50,964 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 22:19:50,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:50,979 INFO L225 Difference]: With dead ends: 14814 [2019-12-27 22:19:50,979 INFO L226 Difference]: Without dead ends: 9703 [2019-12-27 22:19:50,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:19:51,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9703 states. [2019-12-27 22:19:51,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9703 to 9113. [2019-12-27 22:19:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9113 states. [2019-12-27 22:19:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9113 states to 9113 states and 27288 transitions. [2019-12-27 22:19:51,130 INFO L78 Accepts]: Start accepts. Automaton has 9113 states and 27288 transitions. Word has length 56 [2019-12-27 22:19:51,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:51,130 INFO L462 AbstractCegarLoop]: Abstraction has 9113 states and 27288 transitions. [2019-12-27 22:19:51,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:19:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9113 states and 27288 transitions. [2019-12-27 22:19:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:19:51,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:51,141 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 22:19:51,141 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:51,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1401618532, now seen corresponding path program 2 times [2019-12-27 22:19:51,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:51,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197260724] [2019-12-27 22:19:51,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:51,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197260724] [2019-12-27 22:19:51,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:51,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:19:51,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1016911004] [2019-12-27 22:19:51,345 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:51,361 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:51,563 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 288 transitions. [2019-12-27 22:19:51,563 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:51,776 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 22:19:51,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 22:19:51,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:51,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 22:19:51,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:19:51,777 INFO L87 Difference]: Start difference. First operand 9113 states and 27288 transitions. Second operand 17 states. [2019-12-27 22:19:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:53,970 INFO L93 Difference]: Finished difference Result 18463 states and 54887 transitions. [2019-12-27 22:19:53,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 22:19:53,971 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-27 22:19:53,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:53,991 INFO L225 Difference]: With dead ends: 18463 [2019-12-27 22:19:53,991 INFO L226 Difference]: Without dead ends: 14457 [2019-12-27 22:19:53,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=367, Invalid=1795, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 22:19:54,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14457 states. [2019-12-27 22:19:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14457 to 9075. [2019-12-27 22:19:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9075 states. [2019-12-27 22:19:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9075 states to 9075 states and 26965 transitions. [2019-12-27 22:19:54,166 INFO L78 Accepts]: Start accepts. Automaton has 9075 states and 26965 transitions. Word has length 56 [2019-12-27 22:19:54,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:54,166 INFO L462 AbstractCegarLoop]: Abstraction has 9075 states and 26965 transitions. [2019-12-27 22:19:54,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 22:19:54,166 INFO L276 IsEmpty]: Start isEmpty. Operand 9075 states and 26965 transitions. [2019-12-27 22:19:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:19:54,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:54,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, 1] [2019-12-27 22:19:54,176 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:54,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:54,176 INFO L82 PathProgramCache]: Analyzing trace with hash 625469602, now seen corresponding path program 3 times [2019-12-27 22:19:54,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:54,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132448253] [2019-12-27 22:19:54,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:19:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:19:54,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132448253] [2019-12-27 22:19:54,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:19:54,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:19:54,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1650898286] [2019-12-27 22:19:54,332 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:19:54,355 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:19:54,510 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 333 transitions. [2019-12-27 22:19:54,510 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:19:54,817 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 22:19:54,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:19:54,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:19:54,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:19:54,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:19:54,818 INFO L87 Difference]: Start difference. First operand 9075 states and 26965 transitions. Second operand 15 states. [2019-12-27 22:19:55,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:19:55,733 INFO L93 Difference]: Finished difference Result 10258 states and 29946 transitions. [2019-12-27 22:19:55,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 22:19:55,733 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 22:19:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:19:55,748 INFO L225 Difference]: With dead ends: 10258 [2019-12-27 22:19:55,748 INFO L226 Difference]: Without dead ends: 9639 [2019-12-27 22:19:55,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 11 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=709, Unknown=0, NotChecked=0, Total=870 [2019-12-27 22:19:55,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9639 states. [2019-12-27 22:19:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9639 to 8785. [2019-12-27 22:19:55,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8785 states. [2019-12-27 22:19:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8785 states to 8785 states and 26211 transitions. [2019-12-27 22:19:55,946 INFO L78 Accepts]: Start accepts. Automaton has 8785 states and 26211 transitions. Word has length 56 [2019-12-27 22:19:55,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:19:55,946 INFO L462 AbstractCegarLoop]: Abstraction has 8785 states and 26211 transitions. [2019-12-27 22:19:55,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:19:55,947 INFO L276 IsEmpty]: Start isEmpty. Operand 8785 states and 26211 transitions. [2019-12-27 22:19:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:19:55,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:19:55,956 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 22:19:55,956 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:19:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:19:55,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2002078782, now seen corresponding path program 4 times [2019-12-27 22:19:55,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:19:55,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050501913] [2019-12-27 22:19:55,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:19:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:19:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:19:56,070 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:19:56,070 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:19:56,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$w_buff1~0_24) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1903~0.base_22|)) (= 0 v_~x$r_buff0_thd1~0_73) (= 0 v_~x$r_buff0_thd2~0_26) (= 0 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~x$r_buff0_thd0~0_22) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1903~0.base_22| 4) |v_#length_23|) (= v_~__unbuffered_p2_EBX~0_14 0) (= v_~x$r_buff1_thd2~0_18 0) (= v_~x$flush_delayed~0_13 0) (= 0 v_~__unbuffered_p0_EAX~0_14) (< 0 |v_#StackHeapBarrier_17|) (= v_~x~0_23 0) (= v_~x$w_buff1_used~0_67 0) (= v_~y~0_16 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1903~0.base_22| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1903~0.base_22|) |v_ULTIMATE.start_main_~#t1903~0.offset_18| 0)) |v_#memory_int_23|) (= 0 v_~x$read_delayed~0_6) (= v_~x$r_buff1_thd1~0_41 0) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$w_buff0_used~0_113) (= v_~x$mem_tmp~0_10 0) (= v_~x$r_buff1_thd0~0_20 0) (= 0 v_~x$r_buff0_thd3~0_20) (= 0 |v_ULTIMATE.start_main_~#t1903~0.offset_18|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_15 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1903~0.base_22| 1)) (= 0 v_~__unbuffered_p2_EAX~0_14) (= 0 v_~weak$$choice0~0_6) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1903~0.base_22|) (= 0 v_~x$w_buff0~0_30) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff1_thd3~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_30, ~x$flush_delayed~0=v_~x$flush_delayed~0_13, ULTIMATE.start_main_~#t1904~0.offset=|v_ULTIMATE.start_main_~#t1904~0.offset_18|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_41, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_22, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~x$w_buff1~0=v_~x$w_buff1~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_67, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ULTIMATE.start_main_~#t1905~0.base=|v_ULTIMATE.start_main_~#t1905~0.base_19|, ~x~0=v_~x~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_73, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t1904~0.base=|v_ULTIMATE.start_main_~#t1904~0.base_23|, ULTIMATE.start_main_~#t1905~0.offset=|v_ULTIMATE.start_main_~#t1905~0.offset_14|, ~y~0=v_~y~0_16, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1903~0.base=|v_ULTIMATE.start_main_~#t1903~0.base_22|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_113, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1903~0.offset=|v_ULTIMATE.start_main_~#t1903~0.offset_18|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1904~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1904~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1905~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_~#t1903~0.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1903~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1905~0.base, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:19:56,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1904~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1904~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1904~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t1904~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1904~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1904~0.base_10|) |v_ULTIMATE.start_main_~#t1904~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t1904~0.offset_9| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1904~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1904~0.base=|v_ULTIMATE.start_main_~#t1904~0.base_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1904~0.offset=|v_ULTIMATE.start_main_~#t1904~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1904~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1904~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 22:19:56,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= 1 v_~x$w_buff0~0_14) (= 1 v_~x$w_buff0_used~0_68) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_~x$w_buff0~0_15 v_~x$w_buff1~0_12) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= 0 (mod v_~x$w_buff1_used~0_40 256)) (= v_~x$w_buff1_used~0_40 v_~x$w_buff0_used~0_69) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_14, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_12, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_68} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 22:19:56,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L820-1-->L822: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1905~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1905~0.offset_10| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1905~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1905~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1905~0.base_11|) |v_ULTIMATE.start_main_~#t1905~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1905~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1905~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1905~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1905~0.offset=|v_ULTIMATE.start_main_~#t1905~0.offset_10|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1905~0.base=|v_ULTIMATE.start_main_~#t1905~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t1905~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1905~0.base] because there is no mapped edge [2019-12-27 22:19:56,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In321308152 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In321308152 256) 0))) (or (and (= ~x~0_In321308152 |P2Thread1of1ForFork1_#t~ite32_Out321308152|) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In321308152 |P2Thread1of1ForFork1_#t~ite32_Out321308152|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In321308152, ~x$w_buff1_used~0=~x$w_buff1_used~0_In321308152, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In321308152, ~x~0=~x~0_In321308152} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out321308152|, ~x$w_buff1~0=~x$w_buff1~0_In321308152, ~x$w_buff1_used~0=~x$w_buff1_used~0_In321308152, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In321308152, ~x~0=~x~0_In321308152} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:19:56,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 22:19:56,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-296560022 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-296560022 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-296560022 |P2Thread1of1ForFork1_#t~ite34_Out-296560022|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-296560022|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-296560022, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-296560022} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-296560022|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-296560022, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-296560022} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:19:56,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1539893777 256)))) (or (and (not .cse0) (= ~x$w_buff0~0_In1539893777 |P0Thread1of1ForFork2_#t~ite9_Out1539893777|) (= |P0Thread1of1ForFork2_#t~ite8_In1539893777| |P0Thread1of1ForFork2_#t~ite8_Out1539893777|)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out1539893777| ~x$w_buff0~0_In1539893777) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1539893777 256)))) (or (and (= (mod ~x$w_buff1_used~0_In1539893777 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In1539893777 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In1539893777 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite8_Out1539893777| |P0Thread1of1ForFork2_#t~ite9_Out1539893777|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1539893777, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1539893777, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In1539893777|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1539893777, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1539893777, ~weak$$choice2~0=~weak$$choice2~0_In1539893777, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1539893777} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1539893777, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1539893777, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1539893777|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1539893777, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out1539893777|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1539893777, ~weak$$choice2~0=~weak$$choice2~0_In1539893777, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1539893777} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 22:19:56,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1975856654 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1975856654 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1975856654|)) (and (= ~x$w_buff0_used~0_In-1975856654 |P1Thread1of1ForFork0_#t~ite28_Out-1975856654|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1975856654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1975856654} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1975856654, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1975856654|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1975856654} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 22:19:56,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In851993081 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In851993081 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In851993081 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In851993081 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In851993081 |P1Thread1of1ForFork0_#t~ite29_Out851993081|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out851993081|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In851993081, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In851993081, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In851993081, ~x$w_buff0_used~0=~x$w_buff0_used~0_In851993081} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In851993081, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In851993081, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In851993081, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out851993081|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In851993081} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 22:19:56,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1023071832 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1023071832 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1023071832 ~x$r_buff0_thd2~0_Out1023071832)) (and (not .cse1) (= ~x$r_buff0_thd2~0_Out1023071832 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1023071832, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1023071832} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1023071832|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1023071832, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1023071832} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:19:56,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In73675646 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In73675646 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In73675646 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In73675646 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In73675646 |P1Thread1of1ForFork0_#t~ite31_Out73675646|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out73675646|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In73675646, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In73675646, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In73675646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In73675646} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out73675646|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In73675646, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In73675646, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In73675646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In73675646} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 22:19:56,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 22:19:56,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In645839256 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In645839256 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In645839256 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In645839256 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out645839256|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In645839256 |P2Thread1of1ForFork1_#t~ite35_Out645839256|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In645839256, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In645839256, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In645839256, ~x$w_buff0_used~0=~x$w_buff0_used~0_In645839256} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out645839256|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In645839256, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In645839256, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In645839256, ~x$w_buff0_used~0=~x$w_buff0_used~0_In645839256} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:19:56,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-728720525 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-728720525 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-728720525 |P2Thread1of1ForFork1_#t~ite36_Out-728720525|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-728720525|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-728720525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-728720525} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-728720525|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-728720525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-728720525} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:19:56,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1859349222 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_Out1859349222| |P0Thread1of1ForFork2_#t~ite18_Out1859349222|) (= ~x$w_buff1_used~0_In1859349222 |P0Thread1of1ForFork2_#t~ite17_Out1859349222|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1859349222 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In1859349222 256) 0)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1859349222 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In1859349222 256))))) (and (not .cse0) (= ~x$w_buff1_used~0_In1859349222 |P0Thread1of1ForFork2_#t~ite18_Out1859349222|) (= |P0Thread1of1ForFork2_#t~ite17_In1859349222| |P0Thread1of1ForFork2_#t~ite17_Out1859349222|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1859349222, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1859349222|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1859349222, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1859349222, ~weak$$choice2~0=~weak$$choice2~0_In1859349222, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1859349222} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1859349222, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1859349222|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1859349222|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1859349222, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1859349222, ~weak$$choice2~0=~weak$$choice2~0_In1859349222, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1859349222} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:19:56,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_56 v_~x$r_buff0_thd1~0_55) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_55, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 22:19:56,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L745-->L745-8: Formula: (let ((.cse4 (= 0 (mod ~x$w_buff0_used~0_In991445977 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In991445977 256))) (.cse6 (= 0 (mod ~x$r_buff0_thd1~0_In991445977 256))) (.cse5 (= 0 (mod ~x$r_buff1_thd1~0_In991445977 256))) (.cse3 (= |P0Thread1of1ForFork2_#t~ite24_Out991445977| |P0Thread1of1ForFork2_#t~ite23_Out991445977|)) (.cse2 (= (mod ~weak$$choice2~0_In991445977 256) 0))) (or (let ((.cse0 (not .cse6))) (and (= 0 |P0Thread1of1ForFork2_#t~ite22_Out991445977|) (or .cse0 (not .cse1)) .cse2 .cse3 (not .cse4) (or .cse0 (not .cse5)) (= |P0Thread1of1ForFork2_#t~ite23_Out991445977| |P0Thread1of1ForFork2_#t~ite22_Out991445977|))) (and (= |P0Thread1of1ForFork2_#t~ite22_In991445977| |P0Thread1of1ForFork2_#t~ite22_Out991445977|) (or (and .cse2 (or .cse4 (and .cse6 .cse1) (and .cse6 .cse5)) .cse3 (= ~x$r_buff1_thd1~0_In991445977 |P0Thread1of1ForFork2_#t~ite23_Out991445977|)) (and (= |P0Thread1of1ForFork2_#t~ite23_In991445977| |P0Thread1of1ForFork2_#t~ite23_Out991445977|) (= ~x$r_buff1_thd1~0_In991445977 |P0Thread1of1ForFork2_#t~ite24_Out991445977|) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In991445977, ~x$w_buff1_used~0=~x$w_buff1_used~0_In991445977, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In991445977, ~weak$$choice2~0=~weak$$choice2~0_In991445977, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In991445977|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In991445977|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In991445977} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In991445977, ~x$w_buff1_used~0=~x$w_buff1_used~0_In991445977, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In991445977, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out991445977|, ~weak$$choice2~0=~weak$$choice2~0_In991445977, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out991445977|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out991445977|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In991445977} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 22:19:56,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1574067247 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1574067247 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-1574067247 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1574067247 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-1574067247| ~x$r_buff1_thd3~0_In-1574067247) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork1_#t~ite37_Out-1574067247| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1574067247, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1574067247, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1574067247, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1574067247} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1574067247|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1574067247, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1574067247, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1574067247, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1574067247} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:19:56,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 22:19:56,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_4 v_~x~0_16) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1)) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 22:19:56,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_15 256) 0) (= 0 (mod v_~x$w_buff0_used~0_86 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:19:56,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1300044351 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1300044351 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1300044351| ~x~0_In1300044351) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out1300044351| ~x$w_buff1~0_In1300044351) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1300044351, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1300044351, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1300044351, ~x~0=~x~0_In1300044351} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1300044351|, ~x$w_buff1~0=~x$w_buff1~0_In1300044351, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1300044351, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1300044351, ~x~0=~x~0_In1300044351} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 22:19:56,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 22:19:56,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-566010119 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-566010119 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out-566010119|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-566010119 |ULTIMATE.start_main_#t~ite43_Out-566010119|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-566010119, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-566010119} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-566010119, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-566010119|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-566010119} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:19:56,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In326505603 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In326505603 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In326505603 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In326505603 256)))) (or (and (= ~x$w_buff1_used~0_In326505603 |ULTIMATE.start_main_#t~ite44_Out326505603|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out326505603|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In326505603, ~x$w_buff1_used~0=~x$w_buff1_used~0_In326505603, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In326505603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In326505603} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In326505603, ~x$w_buff1_used~0=~x$w_buff1_used~0_In326505603, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In326505603, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out326505603|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In326505603} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:19:56,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-168382235 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-168382235 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-168382235| ~x$r_buff0_thd0~0_In-168382235) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-168382235|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-168382235, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-168382235} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-168382235, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-168382235|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-168382235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:19:56,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1114747198 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1114747198 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1114747198 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1114747198 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out-1114747198| ~x$r_buff1_thd0~0_In-1114747198)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out-1114747198| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1114747198, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1114747198, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1114747198, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1114747198} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1114747198, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1114747198|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1114747198, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1114747198, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1114747198} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 22:19:56,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~main$tmp_guard1~0_10 0) (= v_~y~0_11 2) (= v_~x$r_buff1_thd0~0_15 |v_ULTIMATE.start_main_#t~ite46_12|) (= v_~__unbuffered_p2_EBX~0_8 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_11} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~y~0=v_~y~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:19:56,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:19:56 BasicIcfg [2019-12-27 22:19:56,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:19:56,209 INFO L168 Benchmark]: Toolchain (without parser) took 189524.25 ms. Allocated memory was 140.0 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 103.1 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 672.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:19:56,209 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 140.0 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 22:19:56,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.80 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 102.7 MB in the beginning and 158.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-27 22:19:56,210 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.55 ms. Allocated memory is still 204.5 MB. Free memory was 158.6 MB in the beginning and 155.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:19:56,211 INFO L168 Benchmark]: Boogie Preprocessor took 45.24 ms. Allocated memory is still 204.5 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:19:56,211 INFO L168 Benchmark]: RCFGBuilder took 851.00 ms. Allocated memory is still 204.5 MB. Free memory was 153.0 MB in the beginning and 106.8 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 22:19:56,212 INFO L168 Benchmark]: TraceAbstraction took 187776.13 ms. Allocated memory was 204.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 106.8 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 611.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:19:56,214 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.21 ms. Allocated memory is still 140.0 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.80 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 102.7 MB in the beginning and 158.6 MB in the end (delta: -55.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.55 ms. Allocated memory is still 204.5 MB. Free memory was 158.6 MB in the beginning and 155.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.24 ms. Allocated memory is still 204.5 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 851.00 ms. Allocated memory is still 204.5 MB. Free memory was 153.0 MB in the beginning and 106.8 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 187776.13 ms. Allocated memory was 204.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 106.8 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 611.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 163 ProgramPointsBefore, 84 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 6606 VarBasedMoverChecksPositive, 211 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 69182 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] FCALL, FORK 0 pthread_create(&t1905, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 y = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 187.4s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 67.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5316 SDtfs, 8768 SDslu, 16157 SDs, 0 SdLazy, 12241 SolverSat, 500 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 468 GetRequests, 155 SyntacticMatches, 44 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165407occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 93.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 405189 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 952 NumberOfCodeBlocks, 952 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 866 ConstructedInterpolants, 0 QuantifiedInterpolants, 107478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...