/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-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 02:03:31,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 02:03:31,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 02:03:31,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 02:03:31,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 02:03:31,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 02:03:31,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 02:03:31,364 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 02:03:31,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 02:03:31,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 02:03:31,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 02:03:31,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 02:03:31,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 02:03:31,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 02:03:31,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 02:03:31,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 02:03:31,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 02:03:31,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 02:03:31,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 02:03:31,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 02:03:31,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 02:03:31,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 02:03:31,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 02:03:31,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 02:03:31,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 02:03:31,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 02:03:31,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 02:03:31,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 02:03:31,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 02:03:31,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 02:03:31,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 02:03:31,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 02:03:31,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 02:03:31,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 02:03:31,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 02:03:31,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 02:03:31,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 02:03:31,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 02:03:31,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 02:03:31,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 02:03:31,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 02:03:31,410 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-NoLbe-MCR.epf [2019-12-28 02:03:31,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 02:03:31,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 02:03:31,436 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 02:03:31,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 02:03:31,436 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 02:03:31,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 02:03:31,436 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 02:03:31,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 02:03:31,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 02:03:31,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 02:03:31,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 02:03:31,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 02:03:31,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 02:03:31,439 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 02:03:31,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 02:03:31,439 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 02:03:31,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 02:03:31,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 02:03:31,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 02:03:31,440 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 02:03:31,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 02:03:31,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 02:03:31,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 02:03:31,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 02:03:31,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 02:03:31,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 02:03:31,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 02:03:31,441 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 02:03:31,441 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 02:03:31,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 02:03:31,442 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 02:03:31,442 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 02:03:31,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 02:03:31,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 02:03:31,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 02:03:31,748 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 02:03:31,749 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 02:03:31,749 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.oepc.i [2019-12-28 02:03:31,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9bffb369/57ba49f8d0e84e96928b2971880bf5c7/FLAG8a735f194 [2019-12-28 02:03:32,325 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 02:03:32,325 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.oepc.i [2019-12-28 02:03:32,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9bffb369/57ba49f8d0e84e96928b2971880bf5c7/FLAG8a735f194 [2019-12-28 02:03:32,618 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9bffb369/57ba49f8d0e84e96928b2971880bf5c7 [2019-12-28 02:03:32,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 02:03:32,628 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 02:03:32,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 02:03:32,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 02:03:32,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 02:03:32,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:03:32" (1/1) ... [2019-12-28 02:03:32,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:32, skipping insertion in model container [2019-12-28 02:03:32,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:03:32" (1/1) ... [2019-12-28 02:03:32,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 02:03:32,706 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 02:03:33,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:03:33,210 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 02:03:33,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:03:33,374 INFO L208 MainTranslator]: Completed translation [2019-12-28 02:03:33,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:33 WrapperNode [2019-12-28 02:03:33,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 02:03:33,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 02:03:33,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 02:03:33,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 02:03:33,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:33" (1/1) ... [2019-12-28 02:03:33,405 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:33" (1/1) ... [2019-12-28 02:03:33,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 02:03:33,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 02:03:33,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 02:03:33,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 02:03:33,450 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:33" (1/1) ... [2019-12-28 02:03:33,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:33" (1/1) ... [2019-12-28 02:03:33,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:33" (1/1) ... [2019-12-28 02:03:33,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:33" (1/1) ... [2019-12-28 02:03:33,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:33" (1/1) ... [2019-12-28 02:03:33,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:33" (1/1) ... [2019-12-28 02:03:33,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:33" (1/1) ... [2019-12-28 02:03:33,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 02:03:33,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 02:03:33,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 02:03:33,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 02:03:33,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:33" (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-28 02:03:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 02:03:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 02:03:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 02:03:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 02:03:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 02:03:33,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 02:03:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 02:03:33,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 02:03:33,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 02:03:33,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 02:03:33,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 02:03:33,571 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 02:03:34,286 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 02:03:34,286 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 02:03:34,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:03:34 BoogieIcfgContainer [2019-12-28 02:03:34,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 02:03:34,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 02:03:34,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 02:03:34,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 02:03:34,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:03:32" (1/3) ... [2019-12-28 02:03:34,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd7c075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:03:34, skipping insertion in model container [2019-12-28 02:03:34,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:03:33" (2/3) ... [2019-12-28 02:03:34,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd7c075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:03:34, skipping insertion in model container [2019-12-28 02:03:34,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:03:34" (3/3) ... [2019-12-28 02:03:34,297 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_pso.oepc.i [2019-12-28 02:03:34,309 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 02:03:34,310 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 02:03:34,324 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 02:03:34,325 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 02:03:34,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,386 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,387 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,388 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,388 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,403 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,403 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,456 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,456 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,457 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,466 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,487 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:03:34,504 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 02:03:34,532 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 02:03:34,532 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 02:03:34,532 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 02:03:34,532 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 02:03:34,532 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 02:03:34,533 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 02:03:34,533 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 02:03:34,533 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 02:03:34,547 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149 places, 183 transitions [2019-12-28 02:03:36,504 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32593 states. [2019-12-28 02:03:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 32593 states. [2019-12-28 02:03:36,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-28 02:03:36,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:36,516 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] [2019-12-28 02:03:36,516 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:36,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:36,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1674583442, now seen corresponding path program 1 times [2019-12-28 02:03:36,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:36,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604253877] [2019-12-28 02:03:36,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:37,002 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-28 02:03:37,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604253877] [2019-12-28 02:03:37,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:37,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:03:37,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774201771] [2019-12-28 02:03:37,009 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:37,016 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:37,047 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 36 transitions. [2019-12-28 02:03:37,047 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:37,054 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:37,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:03:37,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:37,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:03:37,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:03:37,079 INFO L87 Difference]: Start difference. First operand 32593 states. Second operand 4 states. [2019-12-28 02:03:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:37,901 INFO L93 Difference]: Finished difference Result 33593 states and 129570 transitions. [2019-12-28 02:03:37,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:03:37,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-28 02:03:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:39,171 INFO L225 Difference]: With dead ends: 33593 [2019-12-28 02:03:39,172 INFO L226 Difference]: Without dead ends: 25705 [2019-12-28 02:03:39,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:03:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25705 states. [2019-12-28 02:03:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25705 to 25705. [2019-12-28 02:03:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25705 states. [2019-12-28 02:03:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25705 states to 25705 states and 99586 transitions. [2019-12-28 02:03:40,758 INFO L78 Accepts]: Start accepts. Automaton has 25705 states and 99586 transitions. Word has length 36 [2019-12-28 02:03:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:40,759 INFO L462 AbstractCegarLoop]: Abstraction has 25705 states and 99586 transitions. [2019-12-28 02:03:40,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:03:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 25705 states and 99586 transitions. [2019-12-28 02:03:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 02:03:40,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:40,773 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] [2019-12-28 02:03:40,774 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:40,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:40,774 INFO L82 PathProgramCache]: Analyzing trace with hash -196337745, now seen corresponding path program 1 times [2019-12-28 02:03:40,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:40,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134230860] [2019-12-28 02:03:40,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:40,914 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-28 02:03:40,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134230860] [2019-12-28 02:03:40,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:40,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:40,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2130091070] [2019-12-28 02:03:40,915 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:40,920 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:40,924 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 02:03:40,924 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:40,925 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:40,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:03:40,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:40,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:03:40,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:40,927 INFO L87 Difference]: Start difference. First operand 25705 states and 99586 transitions. Second operand 5 states. [2019-12-28 02:03:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:42,019 INFO L93 Difference]: Finished difference Result 41083 states and 150433 transitions. [2019-12-28 02:03:42,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:03:42,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-28 02:03:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:42,210 INFO L225 Difference]: With dead ends: 41083 [2019-12-28 02:03:42,210 INFO L226 Difference]: Without dead ends: 40547 [2019-12-28 02:03:42,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:03:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40547 states. [2019-12-28 02:03:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40547 to 38927. [2019-12-28 02:03:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38927 states. [2019-12-28 02:03:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38927 states to 38927 states and 143583 transitions. [2019-12-28 02:03:44,995 INFO L78 Accepts]: Start accepts. Automaton has 38927 states and 143583 transitions. Word has length 48 [2019-12-28 02:03:44,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:44,996 INFO L462 AbstractCegarLoop]: Abstraction has 38927 states and 143583 transitions. [2019-12-28 02:03:44,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:03:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 38927 states and 143583 transitions. [2019-12-28 02:03:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 02:03:45,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:45,003 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] [2019-12-28 02:03:45,003 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:45,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:45,003 INFO L82 PathProgramCache]: Analyzing trace with hash -207257985, now seen corresponding path program 1 times [2019-12-28 02:03:45,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:45,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334601010] [2019-12-28 02:03:45,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:45,106 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-28 02:03:45,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334601010] [2019-12-28 02:03:45,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:45,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:03:45,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811073399] [2019-12-28 02:03:45,108 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:45,114 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:45,120 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 49 transitions. [2019-12-28 02:03:45,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:45,120 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:45,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:03:45,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:45,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:03:45,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:03:45,122 INFO L87 Difference]: Start difference. First operand 38927 states and 143583 transitions. Second operand 5 states. [2019-12-28 02:03:45,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:45,730 INFO L93 Difference]: Finished difference Result 49780 states and 180635 transitions. [2019-12-28 02:03:45,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:03:45,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-28 02:03:45,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:46,033 INFO L225 Difference]: With dead ends: 49780 [2019-12-28 02:03:46,033 INFO L226 Difference]: Without dead ends: 49276 [2019-12-28 02:03:46,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:03:48,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49276 states. [2019-12-28 02:03:49,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49276 to 42679. [2019-12-28 02:03:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42679 states. [2019-12-28 02:03:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42679 states to 42679 states and 156594 transitions. [2019-12-28 02:03:49,113 INFO L78 Accepts]: Start accepts. Automaton has 42679 states and 156594 transitions. Word has length 49 [2019-12-28 02:03:49,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:49,114 INFO L462 AbstractCegarLoop]: Abstraction has 42679 states and 156594 transitions. [2019-12-28 02:03:49,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:03:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 42679 states and 156594 transitions. [2019-12-28 02:03:49,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 02:03:49,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:49,122 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:49,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:49,123 INFO L82 PathProgramCache]: Analyzing trace with hash -635197403, now seen corresponding path program 1 times [2019-12-28 02:03:49,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:49,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888140780] [2019-12-28 02:03:49,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:49,181 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-28 02:03:49,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888140780] [2019-12-28 02:03:49,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:49,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:03:49,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1870305359] [2019-12-28 02:03:49,182 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:49,189 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:49,195 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 51 transitions. [2019-12-28 02:03:49,195 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:49,195 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:03:49,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:03:49,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:49,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:03:49,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:03:49,197 INFO L87 Difference]: Start difference. First operand 42679 states and 156594 transitions. Second operand 3 states. [2019-12-28 02:03:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:49,492 INFO L93 Difference]: Finished difference Result 61089 states and 221432 transitions. [2019-12-28 02:03:49,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:03:49,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-28 02:03:49,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:49,673 INFO L225 Difference]: With dead ends: 61089 [2019-12-28 02:03:49,673 INFO L226 Difference]: Without dead ends: 61089 [2019-12-28 02:03:49,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:03:51,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61089 states. [2019-12-28 02:03:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61089 to 48018. [2019-12-28 02:03:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48018 states. [2019-12-28 02:03:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48018 states to 48018 states and 174181 transitions. [2019-12-28 02:03:52,895 INFO L78 Accepts]: Start accepts. Automaton has 48018 states and 174181 transitions. Word has length 51 [2019-12-28 02:03:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:52,895 INFO L462 AbstractCegarLoop]: Abstraction has 48018 states and 174181 transitions. [2019-12-28 02:03:52,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:03:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 48018 states and 174181 transitions. [2019-12-28 02:03:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:03:52,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:52,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:52,914 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:52,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:52,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1064293156, now seen corresponding path program 1 times [2019-12-28 02:03:52,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:52,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829169533] [2019-12-28 02:03:52,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:53,056 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-28 02:03:53,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829169533] [2019-12-28 02:03:53,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:53,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:03:53,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1445980940] [2019-12-28 02:03:53,058 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:53,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:53,070 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-28 02:03:53,070 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:03:53,133 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 02:03:53,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:03:53,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:03:53,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:03:53,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:03:53,134 INFO L87 Difference]: Start difference. First operand 48018 states and 174181 transitions. Second operand 7 states. [2019-12-28 02:03:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:03:54,124 INFO L93 Difference]: Finished difference Result 63758 states and 229381 transitions. [2019-12-28 02:03:54,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:03:54,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-28 02:03:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:03:54,426 INFO L225 Difference]: With dead ends: 63758 [2019-12-28 02:03:54,426 INFO L226 Difference]: Without dead ends: 63758 [2019-12-28 02:03:54,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:03:54,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63758 states. [2019-12-28 02:03:56,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63758 to 59951. [2019-12-28 02:03:56,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59951 states. [2019-12-28 02:03:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59951 states to 59951 states and 215674 transitions. [2019-12-28 02:03:59,813 INFO L78 Accepts]: Start accepts. Automaton has 59951 states and 215674 transitions. Word has length 55 [2019-12-28 02:03:59,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:03:59,814 INFO L462 AbstractCegarLoop]: Abstraction has 59951 states and 215674 transitions. [2019-12-28 02:03:59,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:03:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 59951 states and 215674 transitions. [2019-12-28 02:03:59,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:03:59,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:03:59,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:03:59,846 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:03:59,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:03:59,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1433722781, now seen corresponding path program 1 times [2019-12-28 02:03:59,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:03:59,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781850365] [2019-12-28 02:03:59,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:03:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:03:59,967 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-28 02:03:59,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781850365] [2019-12-28 02:03:59,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:03:59,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:03:59,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2042063963] [2019-12-28 02:03:59,969 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:03:59,974 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:03:59,980 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-28 02:03:59,981 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:00,024 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 02:04:00,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:04:00,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:00,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:04:00,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:00,025 INFO L87 Difference]: Start difference. First operand 59951 states and 215674 transitions. Second operand 8 states. [2019-12-28 02:04:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:01,652 INFO L93 Difference]: Finished difference Result 83687 states and 290099 transitions. [2019-12-28 02:04:01,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:04:01,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-28 02:04:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:01,833 INFO L225 Difference]: With dead ends: 83687 [2019-12-28 02:04:01,833 INFO L226 Difference]: Without dead ends: 83687 [2019-12-28 02:04:01,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-28 02:04:02,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83687 states. [2019-12-28 02:04:03,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83687 to 71014. [2019-12-28 02:04:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71014 states. [2019-12-28 02:04:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71014 states to 71014 states and 249888 transitions. [2019-12-28 02:04:04,209 INFO L78 Accepts]: Start accepts. Automaton has 71014 states and 249888 transitions. Word has length 55 [2019-12-28 02:04:04,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:04,209 INFO L462 AbstractCegarLoop]: Abstraction has 71014 states and 249888 transitions. [2019-12-28 02:04:04,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:04:04,209 INFO L276 IsEmpty]: Start isEmpty. Operand 71014 states and 249888 transitions. [2019-12-28 02:04:04,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:04:04,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:04,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:04,228 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:04,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:04,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1973740834, now seen corresponding path program 1 times [2019-12-28 02:04:04,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:04,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557434503] [2019-12-28 02:04:04,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:04,321 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-28 02:04:04,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557434503] [2019-12-28 02:04:04,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:04,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:04,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1534902887] [2019-12-28 02:04:04,323 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:04,328 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:04,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 67 transitions. [2019-12-28 02:04:04,335 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:04,341 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:04:04,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:04:04,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:04,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:04:04,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:04:04,343 INFO L87 Difference]: Start difference. First operand 71014 states and 249888 transitions. Second operand 4 states. [2019-12-28 02:04:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:04,418 INFO L93 Difference]: Finished difference Result 12161 states and 37831 transitions. [2019-12-28 02:04:04,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:04:04,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-28 02:04:04,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:04,434 INFO L225 Difference]: With dead ends: 12161 [2019-12-28 02:04:04,434 INFO L226 Difference]: Without dead ends: 10676 [2019-12-28 02:04:04,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 02:04:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10676 states. [2019-12-28 02:04:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10676 to 10627. [2019-12-28 02:04:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10627 states. [2019-12-28 02:04:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 32593 transitions. [2019-12-28 02:04:04,573 INFO L78 Accepts]: Start accepts. Automaton has 10627 states and 32593 transitions. Word has length 55 [2019-12-28 02:04:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:04,573 INFO L462 AbstractCegarLoop]: Abstraction has 10627 states and 32593 transitions. [2019-12-28 02:04:04,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:04:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 10627 states and 32593 transitions. [2019-12-28 02:04:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:04:04,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:04,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:04,575 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:04,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:04,575 INFO L82 PathProgramCache]: Analyzing trace with hash -984017040, now seen corresponding path program 1 times [2019-12-28 02:04:04,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:04,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922286002] [2019-12-28 02:04:04,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:04,656 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-28 02:04:04,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922286002] [2019-12-28 02:04:04,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:04,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:04,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1728186399] [2019-12-28 02:04:04,657 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:04,665 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:04,672 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 56 states and 55 transitions. [2019-12-28 02:04:04,673 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:04,673 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:04,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:04:04,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:04,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:04:04,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:04:04,674 INFO L87 Difference]: Start difference. First operand 10627 states and 32593 transitions. Second operand 6 states. [2019-12-28 02:04:05,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:05,160 INFO L93 Difference]: Finished difference Result 13184 states and 39874 transitions. [2019-12-28 02:04:05,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 02:04:05,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-28 02:04:05,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:05,178 INFO L225 Difference]: With dead ends: 13184 [2019-12-28 02:04:05,179 INFO L226 Difference]: Without dead ends: 13121 [2019-12-28 02:04:05,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-28 02:04:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13121 states. [2019-12-28 02:04:05,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13121 to 11050. [2019-12-28 02:04:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11050 states. [2019-12-28 02:04:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11050 states to 11050 states and 33787 transitions. [2019-12-28 02:04:05,336 INFO L78 Accepts]: Start accepts. Automaton has 11050 states and 33787 transitions. Word has length 55 [2019-12-28 02:04:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:05,336 INFO L462 AbstractCegarLoop]: Abstraction has 11050 states and 33787 transitions. [2019-12-28 02:04:05,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:04:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 11050 states and 33787 transitions. [2019-12-28 02:04:05,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 02:04:05,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:05,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:05,341 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:05,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:05,342 INFO L82 PathProgramCache]: Analyzing trace with hash 721551436, now seen corresponding path program 1 times [2019-12-28 02:04:05,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:05,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065492184] [2019-12-28 02:04:05,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:05,406 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-28 02:04:05,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065492184] [2019-12-28 02:04:05,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:05,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:05,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [768012793] [2019-12-28 02:04:05,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:05,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:05,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-28 02:04:05,428 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:05,429 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:05,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:04:05,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:05,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:04:05,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:04:05,430 INFO L87 Difference]: Start difference. First operand 11050 states and 33787 transitions. Second operand 4 states. [2019-12-28 02:04:05,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:05,608 INFO L93 Difference]: Finished difference Result 12864 states and 39393 transitions. [2019-12-28 02:04:05,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:04:05,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-28 02:04:05,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:05,634 INFO L225 Difference]: With dead ends: 12864 [2019-12-28 02:04:05,635 INFO L226 Difference]: Without dead ends: 12864 [2019-12-28 02:04:05,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-28 02:04:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2019-12-28 02:04:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 11695. [2019-12-28 02:04:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2019-12-28 02:04:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 35764 transitions. [2019-12-28 02:04:05,874 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 35764 transitions. Word has length 63 [2019-12-28 02:04:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:05,874 INFO L462 AbstractCegarLoop]: Abstraction has 11695 states and 35764 transitions. [2019-12-28 02:04:05,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:04:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 35764 transitions. [2019-12-28 02:04:05,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-28 02:04:05,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:05,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:05,880 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:05,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:05,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1830605525, now seen corresponding path program 1 times [2019-12-28 02:04:05,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:05,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650864305] [2019-12-28 02:04:05,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:05,954 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-28 02:04:05,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650864305] [2019-12-28 02:04:05,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:05,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:05,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [407605971] [2019-12-28 02:04:05,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:05,964 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:05,974 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-28 02:04:05,975 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:05,975 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:05,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:04:05,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:05,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:04:05,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:04:05,976 INFO L87 Difference]: Start difference. First operand 11695 states and 35764 transitions. Second operand 6 states. [2019-12-28 02:04:06,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:06,598 INFO L93 Difference]: Finished difference Result 14221 states and 42862 transitions. [2019-12-28 02:04:06,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 02:04:06,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-28 02:04:06,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:06,619 INFO L225 Difference]: With dead ends: 14221 [2019-12-28 02:04:06,619 INFO L226 Difference]: Without dead ends: 14160 [2019-12-28 02:04:06,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:04:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14160 states. [2019-12-28 02:04:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14160 to 13463. [2019-12-28 02:04:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13463 states. [2019-12-28 02:04:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13463 states to 13463 states and 40781 transitions. [2019-12-28 02:04:06,807 INFO L78 Accepts]: Start accepts. Automaton has 13463 states and 40781 transitions. Word has length 63 [2019-12-28 02:04:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:06,807 INFO L462 AbstractCegarLoop]: Abstraction has 13463 states and 40781 transitions. [2019-12-28 02:04:06,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:04:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 13463 states and 40781 transitions. [2019-12-28 02:04:06,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 02:04:06,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:06,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:06,813 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:06,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:06,813 INFO L82 PathProgramCache]: Analyzing trace with hash -827165457, now seen corresponding path program 1 times [2019-12-28 02:04:06,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:06,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564780388] [2019-12-28 02:04:06,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:06,858 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-28 02:04:06,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564780388] [2019-12-28 02:04:06,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:06,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:04:06,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1860248146] [2019-12-28 02:04:06,859 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:06,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:06,892 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 02:04:06,893 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:06,953 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:04:06,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:04:06,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:06,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:04:06,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:04:06,954 INFO L87 Difference]: Start difference. First operand 13463 states and 40781 transitions. Second operand 5 states. [2019-12-28 02:04:07,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:07,307 INFO L93 Difference]: Finished difference Result 14051 states and 42317 transitions. [2019-12-28 02:04:07,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:04:07,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-28 02:04:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:07,328 INFO L225 Difference]: With dead ends: 14051 [2019-12-28 02:04:07,329 INFO L226 Difference]: Without dead ends: 14051 [2019-12-28 02:04:07,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:04:07,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14051 states. [2019-12-28 02:04:07,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14051 to 13757. [2019-12-28 02:04:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13757 states. [2019-12-28 02:04:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13757 states to 13757 states and 41549 transitions. [2019-12-28 02:04:07,519 INFO L78 Accepts]: Start accepts. Automaton has 13757 states and 41549 transitions. Word has length 67 [2019-12-28 02:04:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:07,520 INFO L462 AbstractCegarLoop]: Abstraction has 13757 states and 41549 transitions. [2019-12-28 02:04:07,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:04:07,520 INFO L276 IsEmpty]: Start isEmpty. Operand 13757 states and 41549 transitions. [2019-12-28 02:04:07,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 02:04:07,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:07,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:07,526 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:07,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:07,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1250043886, now seen corresponding path program 1 times [2019-12-28 02:04:07,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:07,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109698384] [2019-12-28 02:04:07,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:07,584 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-28 02:04:07,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109698384] [2019-12-28 02:04:07,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:07,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:07,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [680973150] [2019-12-28 02:04:07,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:07,597 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:07,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 120 states and 171 transitions. [2019-12-28 02:04:07,619 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:07,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 02:04:07,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:07,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:07,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:07,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:07,669 INFO L87 Difference]: Start difference. First operand 13757 states and 41549 transitions. Second operand 7 states. [2019-12-28 02:04:08,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:08,218 INFO L93 Difference]: Finished difference Result 16799 states and 50141 transitions. [2019-12-28 02:04:08,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:04:08,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-28 02:04:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:08,243 INFO L225 Difference]: With dead ends: 16799 [2019-12-28 02:04:08,243 INFO L226 Difference]: Without dead ends: 16799 [2019-12-28 02:04:08,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:08,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16799 states. [2019-12-28 02:04:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16799 to 15278. [2019-12-28 02:04:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15278 states. [2019-12-28 02:04:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15278 states to 15278 states and 45730 transitions. [2019-12-28 02:04:08,606 INFO L78 Accepts]: Start accepts. Automaton has 15278 states and 45730 transitions. Word has length 67 [2019-12-28 02:04:08,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:08,606 INFO L462 AbstractCegarLoop]: Abstraction has 15278 states and 45730 transitions. [2019-12-28 02:04:08,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 15278 states and 45730 transitions. [2019-12-28 02:04:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:08,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:08,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:08,615 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:08,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:08,615 INFO L82 PathProgramCache]: Analyzing trace with hash -750353405, now seen corresponding path program 1 times [2019-12-28 02:04:08,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:08,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178060197] [2019-12-28 02:04:08,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:08,716 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-28 02:04:08,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178060197] [2019-12-28 02:04:08,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:08,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:08,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1601788785] [2019-12-28 02:04:08,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:08,729 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:08,753 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:04:08,754 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:08,904 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-28 02:04:08,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 02:04:08,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:08,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 02:04:08,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:04:08,906 INFO L87 Difference]: Start difference. First operand 15278 states and 45730 transitions. Second operand 10 states. [2019-12-28 02:04:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:09,827 INFO L93 Difference]: Finished difference Result 16275 states and 48105 transitions. [2019-12-28 02:04:09,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:04:09,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-12-28 02:04:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:09,854 INFO L225 Difference]: With dead ends: 16275 [2019-12-28 02:04:09,854 INFO L226 Difference]: Without dead ends: 16275 [2019-12-28 02:04:09,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:04:09,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2019-12-28 02:04:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 15851. [2019-12-28 02:04:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15851 states. [2019-12-28 02:04:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15851 states to 15851 states and 47027 transitions. [2019-12-28 02:04:10,119 INFO L78 Accepts]: Start accepts. Automaton has 15851 states and 47027 transitions. Word has length 69 [2019-12-28 02:04:10,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:10,119 INFO L462 AbstractCegarLoop]: Abstraction has 15851 states and 47027 transitions. [2019-12-28 02:04:10,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 02:04:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 15851 states and 47027 transitions. [2019-12-28 02:04:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:10,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:10,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:10,129 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:10,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1467404548, now seen corresponding path program 1 times [2019-12-28 02:04:10,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:10,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632599937] [2019-12-28 02:04:10,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:10,242 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-28 02:04:10,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632599937] [2019-12-28 02:04:10,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:10,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:10,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [798037838] [2019-12-28 02:04:10,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:10,256 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:10,284 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:04:10,284 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:10,407 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 02:04:10,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 02:04:10,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:10,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 02:04:10,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:04:10,408 INFO L87 Difference]: Start difference. First operand 15851 states and 47027 transitions. Second operand 10 states. [2019-12-28 02:04:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:11,077 INFO L93 Difference]: Finished difference Result 18162 states and 52355 transitions. [2019-12-28 02:04:11,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:04:11,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-12-28 02:04:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:11,103 INFO L225 Difference]: With dead ends: 18162 [2019-12-28 02:04:11,104 INFO L226 Difference]: Without dead ends: 18162 [2019-12-28 02:04:11,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-12-28 02:04:11,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18162 states. [2019-12-28 02:04:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18162 to 16543. [2019-12-28 02:04:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16543 states. [2019-12-28 02:04:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16543 states to 16543 states and 48247 transitions. [2019-12-28 02:04:11,323 INFO L78 Accepts]: Start accepts. Automaton has 16543 states and 48247 transitions. Word has length 69 [2019-12-28 02:04:11,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:11,324 INFO L462 AbstractCegarLoop]: Abstraction has 16543 states and 48247 transitions. [2019-12-28 02:04:11,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 02:04:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 16543 states and 48247 transitions. [2019-12-28 02:04:11,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:11,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:11,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:11,334 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:11,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:11,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1678755461, now seen corresponding path program 1 times [2019-12-28 02:04:11,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:11,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980989798] [2019-12-28 02:04:11,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:11,405 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-28 02:04:11,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980989798] [2019-12-28 02:04:11,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:11,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:11,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1545450373] [2019-12-28 02:04:11,406 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:11,432 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:11,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:04:11,461 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:11,506 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 02:04:11,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:11,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:11,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:11,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:11,507 INFO L87 Difference]: Start difference. First operand 16543 states and 48247 transitions. Second operand 7 states. [2019-12-28 02:04:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:12,078 INFO L93 Difference]: Finished difference Result 21457 states and 62487 transitions. [2019-12-28 02:04:12,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:04:12,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-28 02:04:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:12,109 INFO L225 Difference]: With dead ends: 21457 [2019-12-28 02:04:12,109 INFO L226 Difference]: Without dead ends: 21457 [2019-12-28 02:04:12,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:04:12,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21457 states. [2019-12-28 02:04:12,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21457 to 19522. [2019-12-28 02:04:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19522 states. [2019-12-28 02:04:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19522 states to 19522 states and 56656 transitions. [2019-12-28 02:04:12,377 INFO L78 Accepts]: Start accepts. Automaton has 19522 states and 56656 transitions. Word has length 69 [2019-12-28 02:04:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:12,377 INFO L462 AbstractCegarLoop]: Abstraction has 19522 states and 56656 transitions. [2019-12-28 02:04:12,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 19522 states and 56656 transitions. [2019-12-28 02:04:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:12,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:12,389 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:12,389 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:12,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:12,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1168221284, now seen corresponding path program 1 times [2019-12-28 02:04:12,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:12,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202201736] [2019-12-28 02:04:12,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:12,459 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-28 02:04:12,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202201736] [2019-12-28 02:04:12,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:12,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:12,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1910167285] [2019-12-28 02:04:12,460 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:12,471 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:12,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:04:12,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:12,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:04:12,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:12,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:12,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:12,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:12,528 INFO L87 Difference]: Start difference. First operand 19522 states and 56656 transitions. Second operand 7 states. [2019-12-28 02:04:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:13,233 INFO L93 Difference]: Finished difference Result 26409 states and 76314 transitions. [2019-12-28 02:04:13,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:04:13,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-28 02:04:13,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:13,270 INFO L225 Difference]: With dead ends: 26409 [2019-12-28 02:04:13,270 INFO L226 Difference]: Without dead ends: 26409 [2019-12-28 02:04:13,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:04:13,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26409 states. [2019-12-28 02:04:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26409 to 21410. [2019-12-28 02:04:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-28 02:04:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 61930 transitions. [2019-12-28 02:04:13,586 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 61930 transitions. Word has length 69 [2019-12-28 02:04:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:13,586 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 61930 transitions. [2019-12-28 02:04:13,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:13,586 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 61930 transitions. [2019-12-28 02:04:13,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:13,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:13,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:13,599 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:13,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:13,600 INFO L82 PathProgramCache]: Analyzing trace with hash -639233179, now seen corresponding path program 1 times [2019-12-28 02:04:13,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:13,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575621300] [2019-12-28 02:04:13,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:13,655 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-28 02:04:13,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575621300] [2019-12-28 02:04:13,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:13,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:13,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1611405642] [2019-12-28 02:04:13,656 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:13,679 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:13,719 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:04:13,719 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:13,720 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:13,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:04:13,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:13,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:04:13,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:04:13,722 INFO L87 Difference]: Start difference. First operand 21410 states and 61930 transitions. Second operand 4 states. [2019-12-28 02:04:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:14,535 INFO L93 Difference]: Finished difference Result 27971 states and 81352 transitions. [2019-12-28 02:04:14,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:04:14,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 02:04:14,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:14,582 INFO L225 Difference]: With dead ends: 27971 [2019-12-28 02:04:14,582 INFO L226 Difference]: Without dead ends: 27836 [2019-12-28 02:04:14,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-28 02:04:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27836 states. [2019-12-28 02:04:14,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27836 to 25847. [2019-12-28 02:04:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25847 states. [2019-12-28 02:04:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25847 states to 25847 states and 75190 transitions. [2019-12-28 02:04:14,928 INFO L78 Accepts]: Start accepts. Automaton has 25847 states and 75190 transitions. Word has length 69 [2019-12-28 02:04:14,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:14,928 INFO L462 AbstractCegarLoop]: Abstraction has 25847 states and 75190 transitions. [2019-12-28 02:04:14,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:04:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 25847 states and 75190 transitions. [2019-12-28 02:04:14,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:14,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:14,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:14,938 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:14,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:14,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1858782758, now seen corresponding path program 1 times [2019-12-28 02:04:14,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:14,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373906657] [2019-12-28 02:04:14,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:15,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373906657] [2019-12-28 02:04:15,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:15,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:04:15,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2100227658] [2019-12-28 02:04:15,095 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:15,107 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:15,138 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:04:15,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:15,278 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-28 02:04:15,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 02:04:15,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:15,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 02:04:15,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:04:15,279 INFO L87 Difference]: Start difference. First operand 25847 states and 75190 transitions. Second operand 10 states. [2019-12-28 02:04:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:15,986 INFO L93 Difference]: Finished difference Result 23115 states and 64212 transitions. [2019-12-28 02:04:15,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 02:04:15,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-12-28 02:04:15,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:16,015 INFO L225 Difference]: With dead ends: 23115 [2019-12-28 02:04:16,016 INFO L226 Difference]: Without dead ends: 23115 [2019-12-28 02:04:16,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-12-28 02:04:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23115 states. [2019-12-28 02:04:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23115 to 18811. [2019-12-28 02:04:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18811 states. [2019-12-28 02:04:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18811 states to 18811 states and 52247 transitions. [2019-12-28 02:04:16,272 INFO L78 Accepts]: Start accepts. Automaton has 18811 states and 52247 transitions. Word has length 69 [2019-12-28 02:04:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:16,273 INFO L462 AbstractCegarLoop]: Abstraction has 18811 states and 52247 transitions. [2019-12-28 02:04:16,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 02:04:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 18811 states and 52247 transitions. [2019-12-28 02:04:16,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:16,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:16,280 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:16,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:16,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1548680857, now seen corresponding path program 1 times [2019-12-28 02:04:16,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:16,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054322481] [2019-12-28 02:04:16,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:16,354 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-28 02:04:16,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054322481] [2019-12-28 02:04:16,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:16,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:16,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1948548226] [2019-12-28 02:04:16,355 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:16,366 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:16,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 173 transitions. [2019-12-28 02:04:16,393 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:16,411 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:04:16,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:04:16,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:16,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:04:16,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:04:16,412 INFO L87 Difference]: Start difference. First operand 18811 states and 52247 transitions. Second operand 6 states. [2019-12-28 02:04:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:16,493 INFO L93 Difference]: Finished difference Result 6133 states and 14464 transitions. [2019-12-28 02:04:16,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:04:16,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 02:04:16,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:16,502 INFO L225 Difference]: With dead ends: 6133 [2019-12-28 02:04:16,502 INFO L226 Difference]: Without dead ends: 5263 [2019-12-28 02:04:16,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-28 02:04:16,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-12-28 02:04:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 4728. [2019-12-28 02:04:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4728 states. [2019-12-28 02:04:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4728 states to 4728 states and 10823 transitions. [2019-12-28 02:04:16,588 INFO L78 Accepts]: Start accepts. Automaton has 4728 states and 10823 transitions. Word has length 69 [2019-12-28 02:04:16,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:16,588 INFO L462 AbstractCegarLoop]: Abstraction has 4728 states and 10823 transitions. [2019-12-28 02:04:16,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:04:16,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4728 states and 10823 transitions. [2019-12-28 02:04:16,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:16,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:16,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:16,595 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:16,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:16,595 INFO L82 PathProgramCache]: Analyzing trace with hash -839136164, now seen corresponding path program 1 times [2019-12-28 02:04:16,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:16,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150892133] [2019-12-28 02:04:16,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:16,631 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-28 02:04:16,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150892133] [2019-12-28 02:04:16,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:16,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:04:16,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [881173026] [2019-12-28 02:04:16,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:16,643 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:16,658 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:16,658 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:16,659 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:16,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:04:16,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:16,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:04:16,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:04:16,660 INFO L87 Difference]: Start difference. First operand 4728 states and 10823 transitions. Second operand 3 states. [2019-12-28 02:04:16,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:16,702 INFO L93 Difference]: Finished difference Result 5858 states and 13189 transitions. [2019-12-28 02:04:16,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:04:16,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-28 02:04:16,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:16,711 INFO L225 Difference]: With dead ends: 5858 [2019-12-28 02:04:16,711 INFO L226 Difference]: Without dead ends: 5858 [2019-12-28 02:04:16,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:04:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2019-12-28 02:04:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 4663. [2019-12-28 02:04:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2019-12-28 02:04:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 10385 transitions. [2019-12-28 02:04:16,786 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 10385 transitions. Word has length 69 [2019-12-28 02:04:16,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:16,786 INFO L462 AbstractCegarLoop]: Abstraction has 4663 states and 10385 transitions. [2019-12-28 02:04:16,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:04:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 10385 transitions. [2019-12-28 02:04:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 02:04:16,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:16,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:16,793 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:16,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash -537618065, now seen corresponding path program 1 times [2019-12-28 02:04:16,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:16,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556097227] [2019-12-28 02:04:16,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:16,887 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-28 02:04:16,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556097227] [2019-12-28 02:04:16,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:16,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:16,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [764829582] [2019-12-28 02:04:16,888 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:16,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:16,921 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 75 transitions. [2019-12-28 02:04:16,921 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:16,922 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:16,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:04:16,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:16,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:04:16,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:04:16,923 INFO L87 Difference]: Start difference. First operand 4663 states and 10385 transitions. Second operand 5 states. [2019-12-28 02:04:17,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:17,110 INFO L93 Difference]: Finished difference Result 5724 states and 12814 transitions. [2019-12-28 02:04:17,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:04:17,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-28 02:04:17,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:17,116 INFO L225 Difference]: With dead ends: 5724 [2019-12-28 02:04:17,117 INFO L226 Difference]: Without dead ends: 5724 [2019-12-28 02:04:17,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:04:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5724 states. [2019-12-28 02:04:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5724 to 5083. [2019-12-28 02:04:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5083 states. [2019-12-28 02:04:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5083 states to 5083 states and 11343 transitions. [2019-12-28 02:04:17,168 INFO L78 Accepts]: Start accepts. Automaton has 5083 states and 11343 transitions. Word has length 75 [2019-12-28 02:04:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:17,169 INFO L462 AbstractCegarLoop]: Abstraction has 5083 states and 11343 transitions. [2019-12-28 02:04:17,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:04:17,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5083 states and 11343 transitions. [2019-12-28 02:04:17,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-28 02:04:17,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:17,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:17,174 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:17,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:17,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1205192270, now seen corresponding path program 1 times [2019-12-28 02:04:17,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:17,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288941260] [2019-12-28 02:04:17,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:17,248 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-28 02:04:17,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288941260] [2019-12-28 02:04:17,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:17,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:04:17,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1185617183] [2019-12-28 02:04:17,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:17,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:17,282 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 75 transitions. [2019-12-28 02:04:17,282 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:17,282 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:17,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:17,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:17,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:17,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:17,283 INFO L87 Difference]: Start difference. First operand 5083 states and 11343 transitions. Second operand 7 states. [2019-12-28 02:04:17,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:17,754 INFO L93 Difference]: Finished difference Result 5823 states and 12866 transitions. [2019-12-28 02:04:17,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 02:04:17,755 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-28 02:04:17,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:17,762 INFO L225 Difference]: With dead ends: 5823 [2019-12-28 02:04:17,762 INFO L226 Difference]: Without dead ends: 5770 [2019-12-28 02:04:17,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-28 02:04:17,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2019-12-28 02:04:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5170. [2019-12-28 02:04:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2019-12-28 02:04:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 11432 transitions. [2019-12-28 02:04:17,815 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 11432 transitions. Word has length 75 [2019-12-28 02:04:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:17,816 INFO L462 AbstractCegarLoop]: Abstraction has 5170 states and 11432 transitions. [2019-12-28 02:04:17,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 11432 transitions. [2019-12-28 02:04:17,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 02:04:17,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:17,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:17,821 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:17,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:17,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1470478578, now seen corresponding path program 1 times [2019-12-28 02:04:17,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:17,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571133822] [2019-12-28 02:04:17,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:17,883 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-28 02:04:17,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571133822] [2019-12-28 02:04:17,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:17,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:17,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [214998761] [2019-12-28 02:04:17,890 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:17,914 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:18,001 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 216 transitions. [2019-12-28 02:04:18,001 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:18,046 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-28 02:04:18,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:18,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:18,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:18,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:18,047 INFO L87 Difference]: Start difference. First operand 5170 states and 11432 transitions. Second operand 7 states. [2019-12-28 02:04:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:18,573 INFO L93 Difference]: Finished difference Result 6012 states and 13224 transitions. [2019-12-28 02:04:18,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:04:18,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-28 02:04:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:18,581 INFO L225 Difference]: With dead ends: 6012 [2019-12-28 02:04:18,581 INFO L226 Difference]: Without dead ends: 6012 [2019-12-28 02:04:18,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:04:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2019-12-28 02:04:18,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 5315. [2019-12-28 02:04:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5315 states. [2019-12-28 02:04:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5315 states to 5315 states and 11747 transitions. [2019-12-28 02:04:18,636 INFO L78 Accepts]: Start accepts. Automaton has 5315 states and 11747 transitions. Word has length 96 [2019-12-28 02:04:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:18,636 INFO L462 AbstractCegarLoop]: Abstraction has 5315 states and 11747 transitions. [2019-12-28 02:04:18,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 5315 states and 11747 transitions. [2019-12-28 02:04:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 02:04:18,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:18,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:18,643 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:18,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1713375192, now seen corresponding path program 2 times [2019-12-28 02:04:18,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:18,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559109357] [2019-12-28 02:04:18,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:18,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-28 02:04:18,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559109357] [2019-12-28 02:04:18,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:18,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:18,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [563070119] [2019-12-28 02:04:18,698 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:18,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:18,808 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 203 transitions. [2019-12-28 02:04:18,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:18,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:04:18,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:04:18,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:18,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:04:18,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:04:18,811 INFO L87 Difference]: Start difference. First operand 5315 states and 11747 transitions. Second operand 4 states. [2019-12-28 02:04:18,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:18,921 INFO L93 Difference]: Finished difference Result 6278 states and 13796 transitions. [2019-12-28 02:04:18,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:04:18,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-28 02:04:18,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:18,928 INFO L225 Difference]: With dead ends: 6278 [2019-12-28 02:04:18,928 INFO L226 Difference]: Without dead ends: 6278 [2019-12-28 02:04:18,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-28 02:04:18,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6278 states. [2019-12-28 02:04:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6278 to 5509. [2019-12-28 02:04:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5509 states. [2019-12-28 02:04:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 12153 transitions. [2019-12-28 02:04:18,987 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 12153 transitions. Word has length 96 [2019-12-28 02:04:18,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:18,988 INFO L462 AbstractCegarLoop]: Abstraction has 5509 states and 12153 transitions. [2019-12-28 02:04:18,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:04:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 12153 transitions. [2019-12-28 02:04:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:18,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:18,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:18,993 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:18,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:18,993 INFO L82 PathProgramCache]: Analyzing trace with hash -319220326, now seen corresponding path program 1 times [2019-12-28 02:04:18,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:18,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765182863] [2019-12-28 02:04:18,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:19,065 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-28 02:04:19,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765182863] [2019-12-28 02:04:19,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:19,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:19,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [353637221] [2019-12-28 02:04:19,066 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:19,093 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:19,260 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 222 transitions. [2019-12-28 02:04:19,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:19,277 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:04:19,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:04:19,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:19,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:04:19,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:04:19,279 INFO L87 Difference]: Start difference. First operand 5509 states and 12153 transitions. Second operand 6 states. [2019-12-28 02:04:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:19,416 INFO L93 Difference]: Finished difference Result 5979 states and 13177 transitions. [2019-12-28 02:04:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:04:19,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-28 02:04:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:19,422 INFO L225 Difference]: With dead ends: 5979 [2019-12-28 02:04:19,423 INFO L226 Difference]: Without dead ends: 5979 [2019-12-28 02:04:19,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2019-12-28 02:04:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 4609. [2019-12-28 02:04:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4609 states. [2019-12-28 02:04:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 10154 transitions. [2019-12-28 02:04:19,471 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 10154 transitions. Word has length 98 [2019-12-28 02:04:19,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:19,472 INFO L462 AbstractCegarLoop]: Abstraction has 4609 states and 10154 transitions. [2019-12-28 02:04:19,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:04:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 10154 transitions. [2019-12-28 02:04:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:19,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:19,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:19,478 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:19,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:19,479 INFO L82 PathProgramCache]: Analyzing trace with hash -307904199, now seen corresponding path program 1 times [2019-12-28 02:04:19,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:19,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625080343] [2019-12-28 02:04:19,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:19,576 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-28 02:04:19,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625080343] [2019-12-28 02:04:19,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:19,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:19,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [839767330] [2019-12-28 02:04:19,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:19,603 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:19,696 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 222 transitions. [2019-12-28 02:04:19,696 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:19,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-28 02:04:19,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 02:04:19,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:19,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 02:04:19,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:04:19,811 INFO L87 Difference]: Start difference. First operand 4609 states and 10154 transitions. Second operand 10 states. [2019-12-28 02:04:20,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:20,145 INFO L93 Difference]: Finished difference Result 5093 states and 11141 transitions. [2019-12-28 02:04:20,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:04:20,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-12-28 02:04:20,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:20,153 INFO L225 Difference]: With dead ends: 5093 [2019-12-28 02:04:20,153 INFO L226 Difference]: Without dead ends: 5093 [2019-12-28 02:04:20,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:04:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5093 states. [2019-12-28 02:04:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5093 to 4503. [2019-12-28 02:04:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4503 states. [2019-12-28 02:04:20,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 9963 transitions. [2019-12-28 02:04:20,244 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 9963 transitions. Word has length 98 [2019-12-28 02:04:20,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:20,245 INFO L462 AbstractCegarLoop]: Abstraction has 4503 states and 9963 transitions. [2019-12-28 02:04:20,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 02:04:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 9963 transitions. [2019-12-28 02:04:20,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:20,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:20,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:20,254 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:20,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:20,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1153746234, now seen corresponding path program 1 times [2019-12-28 02:04:20,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:20,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044961651] [2019-12-28 02:04:20,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:20,368 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-28 02:04:20,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044961651] [2019-12-28 02:04:20,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:20,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:20,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1823518995] [2019-12-28 02:04:20,369 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:20,414 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:20,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 314 transitions. [2019-12-28 02:04:20,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:20,585 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 02:04:20,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:04:20,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:20,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:04:20,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:04:20,586 INFO L87 Difference]: Start difference. First operand 4503 states and 9963 transitions. Second operand 4 states. [2019-12-28 02:04:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:20,909 INFO L93 Difference]: Finished difference Result 5718 states and 12590 transitions. [2019-12-28 02:04:20,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:04:20,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-28 02:04:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:20,918 INFO L225 Difference]: With dead ends: 5718 [2019-12-28 02:04:20,918 INFO L226 Difference]: Without dead ends: 5662 [2019-12-28 02:04:20,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-28 02:04:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5662 states. [2019-12-28 02:04:20,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5662 to 5357. [2019-12-28 02:04:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5357 states. [2019-12-28 02:04:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5357 states to 5357 states and 11821 transitions. [2019-12-28 02:04:20,998 INFO L78 Accepts]: Start accepts. Automaton has 5357 states and 11821 transitions. Word has length 98 [2019-12-28 02:04:20,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:21,000 INFO L462 AbstractCegarLoop]: Abstraction has 5357 states and 11821 transitions. [2019-12-28 02:04:21,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:04:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 5357 states and 11821 transitions. [2019-12-28 02:04:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:21,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:21,008 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:21,008 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:21,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:21,008 INFO L82 PathProgramCache]: Analyzing trace with hash -923463109, now seen corresponding path program 1 times [2019-12-28 02:04:21,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:21,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168967934] [2019-12-28 02:04:21,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:21,218 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-28 02:04:21,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168967934] [2019-12-28 02:04:21,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:21,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 02:04:21,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1245474046] [2019-12-28 02:04:21,220 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:21,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:21,430 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 314 transitions. [2019-12-28 02:04:21,430 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:21,718 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-28 02:04:21,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-28 02:04:21,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:21,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-28 02:04:21,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-12-28 02:04:21,720 INFO L87 Difference]: Start difference. First operand 5357 states and 11821 transitions. Second operand 14 states. [2019-12-28 02:04:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:24,315 INFO L93 Difference]: Finished difference Result 7739 states and 16898 transitions. [2019-12-28 02:04:24,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-28 02:04:24,316 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-12-28 02:04:24,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:24,326 INFO L225 Difference]: With dead ends: 7739 [2019-12-28 02:04:24,326 INFO L226 Difference]: Without dead ends: 7739 [2019-12-28 02:04:24,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2019-12-28 02:04:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7739 states. [2019-12-28 02:04:24,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7739 to 5826. [2019-12-28 02:04:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5826 states. [2019-12-28 02:04:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 12786 transitions. [2019-12-28 02:04:24,426 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 12786 transitions. Word has length 98 [2019-12-28 02:04:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:24,426 INFO L462 AbstractCegarLoop]: Abstraction has 5826 states and 12786 transitions. [2019-12-28 02:04:24,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-28 02:04:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 12786 transitions. [2019-12-28 02:04:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:24,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:24,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:24,434 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:24,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:24,435 INFO L82 PathProgramCache]: Analyzing trace with hash -712112196, now seen corresponding path program 1 times [2019-12-28 02:04:24,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:24,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954875359] [2019-12-28 02:04:24,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:24,622 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-28 02:04:24,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954875359] [2019-12-28 02:04:24,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:24,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 02:04:24,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1882394857] [2019-12-28 02:04:24,624 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:24,650 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:24,794 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 314 transitions. [2019-12-28 02:04:24,794 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:24,975 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-28 02:04:24,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-28 02:04:24,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:24,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-28 02:04:24,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-28 02:04:24,977 INFO L87 Difference]: Start difference. First operand 5826 states and 12786 transitions. Second operand 14 states. [2019-12-28 02:04:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:27,168 INFO L93 Difference]: Finished difference Result 7553 states and 16479 transitions. [2019-12-28 02:04:27,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-28 02:04:27,169 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-12-28 02:04:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:27,178 INFO L225 Difference]: With dead ends: 7553 [2019-12-28 02:04:27,178 INFO L226 Difference]: Without dead ends: 7521 [2019-12-28 02:04:27,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=258, Invalid=798, Unknown=0, NotChecked=0, Total=1056 [2019-12-28 02:04:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7521 states. [2019-12-28 02:04:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7521 to 5791. [2019-12-28 02:04:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5791 states. [2019-12-28 02:04:27,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 12703 transitions. [2019-12-28 02:04:27,246 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 12703 transitions. Word has length 98 [2019-12-28 02:04:27,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:27,246 INFO L462 AbstractCegarLoop]: Abstraction has 5791 states and 12703 transitions. [2019-12-28 02:04:27,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-28 02:04:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 12703 transitions. [2019-12-28 02:04:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:27,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:27,252 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:27,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:27,252 INFO L82 PathProgramCache]: Analyzing trace with hash 175391485, now seen corresponding path program 1 times [2019-12-28 02:04:27,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:27,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963605837] [2019-12-28 02:04:27,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:27,385 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-28 02:04:27,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963605837] [2019-12-28 02:04:27,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:27,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 02:04:27,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1794699280] [2019-12-28 02:04:27,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:27,404 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:27,536 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 314 transitions. [2019-12-28 02:04:27,537 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:27,698 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-28 02:04:27,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-28 02:04:27,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:27,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-28 02:04:27,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-28 02:04:27,700 INFO L87 Difference]: Start difference. First operand 5791 states and 12703 transitions. Second operand 15 states. [2019-12-28 02:04:27,931 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-28 02:04:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:30,610 INFO L93 Difference]: Finished difference Result 21225 states and 47175 transitions. [2019-12-28 02:04:30,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-28 02:04:30,611 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-12-28 02:04:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:30,625 INFO L225 Difference]: With dead ends: 21225 [2019-12-28 02:04:30,625 INFO L226 Difference]: Without dead ends: 13221 [2019-12-28 02:04:30,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2019-12-28 02:04:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13221 states. [2019-12-28 02:04:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13221 to 5768. [2019-12-28 02:04:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5768 states. [2019-12-28 02:04:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5768 states to 5768 states and 12572 transitions. [2019-12-28 02:04:30,718 INFO L78 Accepts]: Start accepts. Automaton has 5768 states and 12572 transitions. Word has length 98 [2019-12-28 02:04:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:30,719 INFO L462 AbstractCegarLoop]: Abstraction has 5768 states and 12572 transitions. [2019-12-28 02:04:30,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-28 02:04:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 5768 states and 12572 transitions. [2019-12-28 02:04:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:30,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:30,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:30,724 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:30,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:30,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1812352579, now seen corresponding path program 1 times [2019-12-28 02:04:30,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:30,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805884331] [2019-12-28 02:04:30,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:30,802 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-28 02:04:30,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805884331] [2019-12-28 02:04:30,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:30,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:30,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [184223194] [2019-12-28 02:04:30,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:30,820 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:30,899 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 222 transitions. [2019-12-28 02:04:30,899 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:30,955 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 02:04:30,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:30,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:30,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:30,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:30,956 INFO L87 Difference]: Start difference. First operand 5768 states and 12572 transitions. Second operand 7 states. [2019-12-28 02:04:31,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:31,388 INFO L93 Difference]: Finished difference Result 5281 states and 11442 transitions. [2019-12-28 02:04:31,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:04:31,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-28 02:04:31,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:31,394 INFO L225 Difference]: With dead ends: 5281 [2019-12-28 02:04:31,395 INFO L226 Difference]: Without dead ends: 5281 [2019-12-28 02:04:31,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5281 states. [2019-12-28 02:04:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5281 to 4881. [2019-12-28 02:04:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4881 states. [2019-12-28 02:04:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 10623 transitions. [2019-12-28 02:04:31,441 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 10623 transitions. Word has length 98 [2019-12-28 02:04:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:31,441 INFO L462 AbstractCegarLoop]: Abstraction has 4881 states and 10623 transitions. [2019-12-28 02:04:31,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 10623 transitions. [2019-12-28 02:04:31,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:31,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:31,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:31,446 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:31,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:31,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1130623483, now seen corresponding path program 1 times [2019-12-28 02:04:31,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:31,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26361250] [2019-12-28 02:04:31,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:31,567 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-28 02:04:31,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26361250] [2019-12-28 02:04:31,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:31,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:31,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [449471103] [2019-12-28 02:04:31,568 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:31,585 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:31,666 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 222 transitions. [2019-12-28 02:04:31,666 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:31,725 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:04:31,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:04:31,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:31,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:04:31,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:31,726 INFO L87 Difference]: Start difference. First operand 4881 states and 10623 transitions. Second operand 8 states. [2019-12-28 02:04:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:31,916 INFO L93 Difference]: Finished difference Result 5529 states and 11939 transitions. [2019-12-28 02:04:31,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:04:31,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2019-12-28 02:04:31,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:31,922 INFO L225 Difference]: With dead ends: 5529 [2019-12-28 02:04:31,923 INFO L226 Difference]: Without dead ends: 5481 [2019-12-28 02:04:31,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:04:31,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2019-12-28 02:04:31,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 4881. [2019-12-28 02:04:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4881 states. [2019-12-28 02:04:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 10556 transitions. [2019-12-28 02:04:31,977 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 10556 transitions. Word has length 98 [2019-12-28 02:04:31,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:31,978 INFO L462 AbstractCegarLoop]: Abstraction has 4881 states and 10556 transitions. [2019-12-28 02:04:31,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:04:31,978 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 10556 transitions. [2019-12-28 02:04:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:31,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:31,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:31,984 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:31,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:31,984 INFO L82 PathProgramCache]: Analyzing trace with hash -961810619, now seen corresponding path program 2 times [2019-12-28 02:04:31,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:31,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830475345] [2019-12-28 02:04:31,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:32,148 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-28 02:04:32,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830475345] [2019-12-28 02:04:32,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:32,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 02:04:32,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [993543407] [2019-12-28 02:04:32,150 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:32,162 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:32,283 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 190 transitions. [2019-12-28 02:04:32,283 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:32,355 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:04:32,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 02:04:32,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:32,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 02:04:32,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:04:32,358 INFO L87 Difference]: Start difference. First operand 4881 states and 10556 transitions. Second operand 12 states. [2019-12-28 02:04:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:34,099 INFO L93 Difference]: Finished difference Result 6110 states and 13148 transitions. [2019-12-28 02:04:34,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 02:04:34,099 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-12-28 02:04:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:34,107 INFO L225 Difference]: With dead ends: 6110 [2019-12-28 02:04:34,107 INFO L226 Difference]: Without dead ends: 6080 [2019-12-28 02:04:34,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-28 02:04:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6080 states. [2019-12-28 02:04:34,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6080 to 5020. [2019-12-28 02:04:34,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5020 states. [2019-12-28 02:04:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 10870 transitions. [2019-12-28 02:04:34,159 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 10870 transitions. Word has length 98 [2019-12-28 02:04:34,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:34,160 INFO L462 AbstractCegarLoop]: Abstraction has 5020 states and 10870 transitions. [2019-12-28 02:04:34,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 02:04:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 10870 transitions. [2019-12-28 02:04:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:34,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:34,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:34,165 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:34,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:34,165 INFO L82 PathProgramCache]: Analyzing trace with hash -750459706, now seen corresponding path program 1 times [2019-12-28 02:04:34,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:34,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918073906] [2019-12-28 02:04:34,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:34,248 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-28 02:04:34,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918073906] [2019-12-28 02:04:34,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:34,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:34,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [824587253] [2019-12-28 02:04:34,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:34,268 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:34,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 190 transitions. [2019-12-28 02:04:34,359 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:34,374 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:04:34,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:34,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:34,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:34,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:34,375 INFO L87 Difference]: Start difference. First operand 5020 states and 10870 transitions. Second operand 7 states. [2019-12-28 02:04:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:34,595 INFO L93 Difference]: Finished difference Result 5135 states and 11089 transitions. [2019-12-28 02:04:34,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:04:34,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-28 02:04:34,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:34,602 INFO L225 Difference]: With dead ends: 5135 [2019-12-28 02:04:34,603 INFO L226 Difference]: Without dead ends: 5135 [2019-12-28 02:04:34,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:04:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2019-12-28 02:04:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 4888. [2019-12-28 02:04:34,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2019-12-28 02:04:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10568 transitions. [2019-12-28 02:04:34,651 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10568 transitions. Word has length 98 [2019-12-28 02:04:34,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:34,651 INFO L462 AbstractCegarLoop]: Abstraction has 4888 states and 10568 transitions. [2019-12-28 02:04:34,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10568 transitions. [2019-12-28 02:04:34,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:34,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:34,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:34,656 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:34,656 INFO L82 PathProgramCache]: Analyzing trace with hash -800857722, now seen corresponding path program 1 times [2019-12-28 02:04:34,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:34,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019743466] [2019-12-28 02:04:34,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:34,856 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-28 02:04:34,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019743466] [2019-12-28 02:04:34,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:34,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 02:04:34,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164282239] [2019-12-28 02:04:34,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:34,888 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:34,998 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 166 states and 222 transitions. [2019-12-28 02:04:34,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:35,073 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-28 02:04:35,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 02:04:35,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 02:04:35,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-28 02:04:35,074 INFO L87 Difference]: Start difference. First operand 4888 states and 10568 transitions. Second operand 11 states. [2019-12-28 02:04:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:36,668 INFO L93 Difference]: Finished difference Result 6851 states and 14664 transitions. [2019-12-28 02:04:36,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-28 02:04:36,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-12-28 02:04:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:36,677 INFO L225 Difference]: With dead ends: 6851 [2019-12-28 02:04:36,677 INFO L226 Difference]: Without dead ends: 6851 [2019-12-28 02:04:36,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-12-28 02:04:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6851 states. [2019-12-28 02:04:36,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6851 to 4988. [2019-12-28 02:04:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2019-12-28 02:04:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 10796 transitions. [2019-12-28 02:04:36,727 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 10796 transitions. Word has length 98 [2019-12-28 02:04:36,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:36,728 INFO L462 AbstractCegarLoop]: Abstraction has 4988 states and 10796 transitions. [2019-12-28 02:04:36,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 02:04:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 10796 transitions. [2019-12-28 02:04:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-28 02:04:36,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:36,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 02:04:36,732 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash -589506809, now seen corresponding path program 2 times [2019-12-28 02:04:36,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:36,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658718206] [2019-12-28 02:04:36,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:04:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:04:36,811 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 02:04:36,811 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 02:04:36,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:04:36 BasicIcfg [2019-12-28 02:04:36,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 02:04:36,963 INFO L168 Benchmark]: Toolchain (without parser) took 64336.07 ms. Allocated memory was 137.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 100.7 MB in the beginning and 556.2 MB in the end (delta: -455.5 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-28 02:04:36,964 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-28 02:04:36,964 INFO L168 Benchmark]: CACSL2BoogieTranslator took 747.04 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 100.2 MB in the beginning and 156.3 MB in the end (delta: -56.1 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:36,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.73 ms. Allocated memory is still 200.8 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:36,965 INFO L168 Benchmark]: Boogie Preprocessor took 72.04 ms. Allocated memory is still 200.8 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:36,965 INFO L168 Benchmark]: RCFGBuilder took 779.16 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 106.9 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-28 02:04:36,965 INFO L168 Benchmark]: TraceAbstraction took 62672.52 ms. Allocated memory was 200.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 106.2 MB in the beginning and 556.2 MB in the end (delta: -450.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-28 02:04:36,967 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.19 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 747.04 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 100.2 MB in the beginning and 156.3 MB in the end (delta: -56.1 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.73 ms. Allocated memory is still 200.8 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.04 ms. Allocated memory is still 200.8 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 779.16 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 106.9 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62672.52 ms. Allocated memory was 200.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 106.2 MB in the beginning and 556.2 MB in the end (delta: -450.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L709] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L710] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L711] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L712] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L713] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L714] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L715] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L716] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L717] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L718] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L719] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L720] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L721] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L722] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 0 pthread_t t901; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t901, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 0 pthread_t t902; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L728] 1 z$w_buff1 = z$w_buff0 [L729] 1 z$w_buff0 = 1 [L730] 1 z$w_buff1_used = z$w_buff0_used [L731] 1 z$w_buff0_used = (_Bool)1 [L806] FCALL, FORK 0 pthread_create(&t902, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L775] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z = z$flush_delayed ? z$mem_tmp : z [L778] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L816] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L819] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 62.2s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 29.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10151 SDtfs, 14146 SDslu, 28007 SDs, 0 SdLazy, 14294 SolverSat, 684 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 638 GetRequests, 251 SyntacticMatches, 47 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71014occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.4s AutomataMinimizationTime, 35 MinimizatonAttempts, 80807 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2734 NumberOfCodeBlocks, 2734 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2601 ConstructedInterpolants, 0 QuantifiedInterpolants, 542558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...